/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix022_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 16:44:47,093 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 16:44:47,096 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 16:44:47,112 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 16:44:47,112 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 16:44:47,113 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 16:44:47,115 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 16:44:47,116 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 16:44:47,118 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 16:44:47,119 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 16:44:47,120 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 16:44:47,121 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 16:44:47,121 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 16:44:47,122 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 16:44:47,123 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 16:44:47,124 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 16:44:47,125 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 16:44:47,126 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 16:44:47,128 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 16:44:47,130 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 16:44:47,131 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 16:44:47,132 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 16:44:47,133 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 16:44:47,134 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 16:44:47,136 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 16:44:47,137 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 16:44:47,137 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 16:44:47,138 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 16:44:47,138 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 16:44:47,139 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 16:44:47,139 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 16:44:47,140 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 16:44:47,141 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 16:44:47,141 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 16:44:47,142 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 16:44:47,143 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 16:44:47,143 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 16:44:47,143 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 16:44:47,144 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 16:44:47,145 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 16:44:47,145 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 16:44:47,146 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 16:44:47,160 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 16:44:47,160 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 16:44:47,161 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 16:44:47,162 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 16:44:47,162 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 16:44:47,162 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 16:44:47,162 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 16:44:47,163 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 16:44:47,163 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 16:44:47,163 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 16:44:47,163 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 16:44:47,163 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 16:44:47,164 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 16:44:47,164 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 16:44:47,164 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 16:44:47,164 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 16:44:47,164 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 16:44:47,165 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 16:44:47,165 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 16:44:47,165 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 16:44:47,165 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 16:44:47,165 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 16:44:47,166 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 16:44:47,166 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 16:44:47,166 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 16:44:47,166 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 16:44:47,166 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 16:44:47,167 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 16:44:47,167 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 16:44:47,435 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 16:44:47,448 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 16:44:47,451 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 16:44:47,453 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 16:44:47,453 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 16:44:47,454 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix022_power.oepc.i [2019-12-18 16:44:47,514 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b39fa5d50/2ef42fe5650c42e3a5b52b8fa113b22e/FLAG47b155c5d [2019-12-18 16:44:48,080 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 16:44:48,081 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix022_power.oepc.i [2019-12-18 16:44:48,098 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b39fa5d50/2ef42fe5650c42e3a5b52b8fa113b22e/FLAG47b155c5d [2019-12-18 16:44:48,354 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b39fa5d50/2ef42fe5650c42e3a5b52b8fa113b22e [2019-12-18 16:44:48,364 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 16:44:48,366 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 16:44:48,367 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 16:44:48,367 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 16:44:48,371 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 16:44:48,372 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:44:48" (1/1) ... [2019-12-18 16:44:48,375 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d02b3ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:44:48, skipping insertion in model container [2019-12-18 16:44:48,375 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:44:48" (1/1) ... [2019-12-18 16:44:48,383 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 16:44:48,456 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 16:44:49,029 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 16:44:49,048 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 16:44:49,143 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 16:44:49,232 INFO L208 MainTranslator]: Completed translation [2019-12-18 16:44:49,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:44:49 WrapperNode [2019-12-18 16:44:49,233 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 16:44:49,234 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 16:44:49,234 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 16:44:49,235 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 16:44:49,244 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:44:49" (1/1) ... [2019-12-18 16:44:49,268 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:44:49" (1/1) ... [2019-12-18 16:44:49,303 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 16:44:49,303 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 16:44:49,304 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 16:44:49,304 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 16:44:49,316 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:44:49" (1/1) ... [2019-12-18 16:44:49,317 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:44:49" (1/1) ... [2019-12-18 16:44:49,328 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:44:49" (1/1) ... [2019-12-18 16:44:49,329 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:44:49" (1/1) ... [2019-12-18 16:44:49,345 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:44:49" (1/1) ... [2019-12-18 16:44:49,350 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:44:49" (1/1) ... [2019-12-18 16:44:49,354 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:44:49" (1/1) ... [2019-12-18 16:44:49,362 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 16:44:49,363 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 16:44:49,363 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 16:44:49,363 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 16:44:49,364 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:44:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 16:44:49,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 16:44:49,433 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 16:44:49,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 16:44:49,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 16:44:49,433 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 16:44:49,434 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 16:44:49,434 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 16:44:49,434 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 16:44:49,434 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 16:44:49,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 16:44:49,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 16:44:49,437 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 16:44:50,112 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 16:44:50,113 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 16:44:50,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:44:50 BoogieIcfgContainer [2019-12-18 16:44:50,114 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 16:44:50,116 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 16:44:50,116 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 16:44:50,119 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 16:44:50,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 04:44:48" (1/3) ... [2019-12-18 16:44:50,120 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74c25b96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:44:50, skipping insertion in model container [2019-12-18 16:44:50,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:44:49" (2/3) ... [2019-12-18 16:44:50,121 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74c25b96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:44:50, skipping insertion in model container [2019-12-18 16:44:50,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:44:50" (3/3) ... [2019-12-18 16:44:50,123 INFO L109 eAbstractionObserver]: Analyzing ICFG mix022_power.oepc.i [2019-12-18 16:44:50,133 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 16:44:50,134 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 16:44:50,142 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 16:44:50,143 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 16:44:50,182 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,182 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,183 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,183 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,183 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,184 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,184 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,184 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,185 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,185 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,185 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,186 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,186 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,186 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,187 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,187 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,187 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,187 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,188 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,188 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,188 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,189 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,189 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,189 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,194 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,195 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,249 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,249 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,250 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,257 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,261 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:44:50,280 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 16:44:50,301 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 16:44:50,302 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 16:44:50,302 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 16:44:50,302 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 16:44:50,302 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 16:44:50,302 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 16:44:50,302 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 16:44:50,302 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 16:44:50,325 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-18 16:44:50,327 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-18 16:44:50,441 INFO L126 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-18 16:44:50,442 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 16:44:50,454 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 340 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 16:44:50,472 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-18 16:44:50,510 INFO L126 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-18 16:44:50,510 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 16:44:50,518 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 340 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 16:44:50,537 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-18 16:44:50,538 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 16:44:54,354 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-12-18 16:44:55,470 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-18 16:44:55,631 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-18 16:44:55,684 INFO L206 etLargeBlockEncoding]: Checked pairs total: 47763 [2019-12-18 16:44:55,684 INFO L214 etLargeBlockEncoding]: Total number of compositions: 101 [2019-12-18 16:44:55,687 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 87 transitions [2019-12-18 16:44:56,139 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8640 states. [2019-12-18 16:44:56,142 INFO L276 IsEmpty]: Start isEmpty. Operand 8640 states. [2019-12-18 16:44:56,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 16:44:56,148 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:44:56,149 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 16:44:56,150 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:44:56,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:44:56,156 INFO L82 PathProgramCache]: Analyzing trace with hash 789332, now seen corresponding path program 1 times [2019-12-18 16:44:56,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:44:56,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872715253] [2019-12-18 16:44:56,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:44:56,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:44:56,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:44:56,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872715253] [2019-12-18 16:44:56,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:44:56,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 16:44:56,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203172216] [2019-12-18 16:44:56,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:44:56,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:44:56,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:44:56,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:44:56,431 INFO L87 Difference]: Start difference. First operand 8640 states. Second operand 3 states. [2019-12-18 16:44:56,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:44:56,688 INFO L93 Difference]: Finished difference Result 8468 states and 27386 transitions. [2019-12-18 16:44:56,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:44:56,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 16:44:56,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:44:56,768 INFO L225 Difference]: With dead ends: 8468 [2019-12-18 16:44:56,768 INFO L226 Difference]: Without dead ends: 7976 [2019-12-18 16:44:56,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:44:56,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7976 states. [2019-12-18 16:44:57,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7976 to 7976. [2019-12-18 16:44:57,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7976 states. [2019-12-18 16:44:57,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7976 states to 7976 states and 25749 transitions. [2019-12-18 16:44:57,244 INFO L78 Accepts]: Start accepts. Automaton has 7976 states and 25749 transitions. Word has length 3 [2019-12-18 16:44:57,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:44:57,244 INFO L462 AbstractCegarLoop]: Abstraction has 7976 states and 25749 transitions. [2019-12-18 16:44:57,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:44:57,244 INFO L276 IsEmpty]: Start isEmpty. Operand 7976 states and 25749 transitions. [2019-12-18 16:44:57,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 16:44:57,248 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:44:57,248 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:44:57,248 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:44:57,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:44:57,249 INFO L82 PathProgramCache]: Analyzing trace with hash -374477309, now seen corresponding path program 1 times [2019-12-18 16:44:57,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:44:57,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483982241] [2019-12-18 16:44:57,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:44:57,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:44:57,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:44:57,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483982241] [2019-12-18 16:44:57,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:44:57,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:44:57,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328132243] [2019-12-18 16:44:57,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:44:57,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:44:57,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:44:57,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:44:57,356 INFO L87 Difference]: Start difference. First operand 7976 states and 25749 transitions. Second operand 4 states. [2019-12-18 16:44:57,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:44:57,722 INFO L93 Difference]: Finished difference Result 12178 states and 37599 transitions. [2019-12-18 16:44:57,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:44:57,722 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 16:44:57,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:44:57,796 INFO L225 Difference]: With dead ends: 12178 [2019-12-18 16:44:57,796 INFO L226 Difference]: Without dead ends: 12171 [2019-12-18 16:44:57,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:44:57,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12171 states. [2019-12-18 16:44:58,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12171 to 10893. [2019-12-18 16:44:58,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10893 states. [2019-12-18 16:44:58,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10893 states to 10893 states and 34228 transitions. [2019-12-18 16:44:58,761 INFO L78 Accepts]: Start accepts. Automaton has 10893 states and 34228 transitions. Word has length 11 [2019-12-18 16:44:58,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:44:58,762 INFO L462 AbstractCegarLoop]: Abstraction has 10893 states and 34228 transitions. [2019-12-18 16:44:58,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:44:58,763 INFO L276 IsEmpty]: Start isEmpty. Operand 10893 states and 34228 transitions. [2019-12-18 16:44:58,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 16:44:58,773 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:44:58,773 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:44:58,773 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:44:58,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:44:58,773 INFO L82 PathProgramCache]: Analyzing trace with hash 56348668, now seen corresponding path program 1 times [2019-12-18 16:44:58,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:44:58,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080311257] [2019-12-18 16:44:58,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:44:58,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:44:58,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:44:58,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080311257] [2019-12-18 16:44:58,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:44:58,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:44:58,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76323344] [2019-12-18 16:44:58,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:44:58,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:44:58,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:44:58,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:44:58,920 INFO L87 Difference]: Start difference. First operand 10893 states and 34228 transitions. Second operand 4 states. [2019-12-18 16:44:59,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:44:59,160 INFO L93 Difference]: Finished difference Result 13366 states and 41774 transitions. [2019-12-18 16:44:59,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:44:59,160 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 16:44:59,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:44:59,220 INFO L225 Difference]: With dead ends: 13366 [2019-12-18 16:44:59,221 INFO L226 Difference]: Without dead ends: 13366 [2019-12-18 16:44:59,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:44:59,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13366 states. [2019-12-18 16:44:59,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13366 to 11878. [2019-12-18 16:44:59,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11878 states. [2019-12-18 16:44:59,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11878 states to 11878 states and 37348 transitions. [2019-12-18 16:44:59,796 INFO L78 Accepts]: Start accepts. Automaton has 11878 states and 37348 transitions. Word has length 14 [2019-12-18 16:44:59,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:44:59,797 INFO L462 AbstractCegarLoop]: Abstraction has 11878 states and 37348 transitions. [2019-12-18 16:44:59,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:44:59,798 INFO L276 IsEmpty]: Start isEmpty. Operand 11878 states and 37348 transitions. [2019-12-18 16:44:59,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 16:44:59,801 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:44:59,801 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:44:59,801 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:44:59,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:44:59,802 INFO L82 PathProgramCache]: Analyzing trace with hash 525416671, now seen corresponding path program 1 times [2019-12-18 16:44:59,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:44:59,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353202920] [2019-12-18 16:44:59,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:44:59,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:44:59,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:44:59,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353202920] [2019-12-18 16:44:59,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:44:59,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 16:44:59,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420872303] [2019-12-18 16:44:59,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:44:59,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:44:59,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:44:59,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:44:59,868 INFO L87 Difference]: Start difference. First operand 11878 states and 37348 transitions. Second operand 3 states. [2019-12-18 16:44:59,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:44:59,930 INFO L93 Difference]: Finished difference Result 11853 states and 37274 transitions. [2019-12-18 16:44:59,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:44:59,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 16:44:59,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:44:59,963 INFO L225 Difference]: With dead ends: 11853 [2019-12-18 16:44:59,964 INFO L226 Difference]: Without dead ends: 11853 [2019-12-18 16:44:59,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:45:00,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11853 states. [2019-12-18 16:45:00,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11853 to 11853. [2019-12-18 16:45:00,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11853 states. [2019-12-18 16:45:00,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11853 states to 11853 states and 37274 transitions. [2019-12-18 16:45:00,293 INFO L78 Accepts]: Start accepts. Automaton has 11853 states and 37274 transitions. Word has length 16 [2019-12-18 16:45:00,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:45:00,294 INFO L462 AbstractCegarLoop]: Abstraction has 11853 states and 37274 transitions. [2019-12-18 16:45:00,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:45:00,294 INFO L276 IsEmpty]: Start isEmpty. Operand 11853 states and 37274 transitions. [2019-12-18 16:45:00,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 16:45:00,298 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:45:00,298 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:45:00,298 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:45:00,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:45:00,299 INFO L82 PathProgramCache]: Analyzing trace with hash -886588009, now seen corresponding path program 1 times [2019-12-18 16:45:00,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:45:00,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533452152] [2019-12-18 16:45:00,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:45:00,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:45:00,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:45:00,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533452152] [2019-12-18 16:45:00,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:45:00,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:45:00,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420871726] [2019-12-18 16:45:00,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:45:00,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:45:00,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:45:00,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:45:00,399 INFO L87 Difference]: Start difference. First operand 11853 states and 37274 transitions. Second operand 4 states. [2019-12-18 16:45:00,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:45:00,440 INFO L93 Difference]: Finished difference Result 2296 states and 5756 transitions. [2019-12-18 16:45:00,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 16:45:00,441 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-18 16:45:00,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:45:00,445 INFO L225 Difference]: With dead ends: 2296 [2019-12-18 16:45:00,445 INFO L226 Difference]: Without dead ends: 1624 [2019-12-18 16:45:00,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:45:00,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1624 states. [2019-12-18 16:45:00,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 1608. [2019-12-18 16:45:00,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1608 states. [2019-12-18 16:45:00,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1608 states and 3603 transitions. [2019-12-18 16:45:00,473 INFO L78 Accepts]: Start accepts. Automaton has 1608 states and 3603 transitions. Word has length 17 [2019-12-18 16:45:00,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:45:00,474 INFO L462 AbstractCegarLoop]: Abstraction has 1608 states and 3603 transitions. [2019-12-18 16:45:00,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:45:00,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 3603 transitions. [2019-12-18 16:45:00,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 16:45:00,476 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:45:00,476 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:45:00,476 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:45:00,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:45:00,476 INFO L82 PathProgramCache]: Analyzing trace with hash -139254967, now seen corresponding path program 1 times [2019-12-18 16:45:00,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:45:00,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94844769] [2019-12-18 16:45:00,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:45:00,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:45:00,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:45:00,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94844769] [2019-12-18 16:45:00,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:45:00,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 16:45:00,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317176695] [2019-12-18 16:45:00,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 16:45:00,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:45:00,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 16:45:00,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:45:00,596 INFO L87 Difference]: Start difference. First operand 1608 states and 3603 transitions. Second operand 6 states. [2019-12-18 16:45:01,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:45:01,227 INFO L93 Difference]: Finished difference Result 4480 states and 9903 transitions. [2019-12-18 16:45:01,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 16:45:01,227 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-18 16:45:01,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:45:01,237 INFO L225 Difference]: With dead ends: 4480 [2019-12-18 16:45:01,237 INFO L226 Difference]: Without dead ends: 4445 [2019-12-18 16:45:01,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 16:45:01,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4445 states. [2019-12-18 16:45:01,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4445 to 2168. [2019-12-18 16:45:01,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2168 states. [2019-12-18 16:45:01,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2168 states to 2168 states and 4907 transitions. [2019-12-18 16:45:01,289 INFO L78 Accepts]: Start accepts. Automaton has 2168 states and 4907 transitions. Word has length 25 [2019-12-18 16:45:01,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:45:01,289 INFO L462 AbstractCegarLoop]: Abstraction has 2168 states and 4907 transitions. [2019-12-18 16:45:01,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 16:45:01,290 INFO L276 IsEmpty]: Start isEmpty. Operand 2168 states and 4907 transitions. [2019-12-18 16:45:01,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 16:45:01,293 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:45:01,293 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:45:01,293 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:45:01,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:45:01,293 INFO L82 PathProgramCache]: Analyzing trace with hash 2133801578, now seen corresponding path program 1 times [2019-12-18 16:45:01,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:45:01,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436270491] [2019-12-18 16:45:01,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:45:01,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:45:01,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:45:01,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436270491] [2019-12-18 16:45:01,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:45:01,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 16:45:01,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382485221] [2019-12-18 16:45:01,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 16:45:01,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:45:01,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 16:45:01,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:45:01,394 INFO L87 Difference]: Start difference. First operand 2168 states and 4907 transitions. Second operand 6 states. [2019-12-18 16:45:01,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:45:01,915 INFO L93 Difference]: Finished difference Result 4358 states and 9517 transitions. [2019-12-18 16:45:01,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 16:45:01,916 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-18 16:45:01,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:45:01,921 INFO L225 Difference]: With dead ends: 4358 [2019-12-18 16:45:01,921 INFO L226 Difference]: Without dead ends: 4329 [2019-12-18 16:45:01,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 16:45:01,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4329 states. [2019-12-18 16:45:01,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4329 to 2043. [2019-12-18 16:45:01,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2043 states. [2019-12-18 16:45:01,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2043 states to 2043 states and 4651 transitions. [2019-12-18 16:45:01,968 INFO L78 Accepts]: Start accepts. Automaton has 2043 states and 4651 transitions. Word has length 26 [2019-12-18 16:45:01,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:45:01,968 INFO L462 AbstractCegarLoop]: Abstraction has 2043 states and 4651 transitions. [2019-12-18 16:45:01,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 16:45:01,969 INFO L276 IsEmpty]: Start isEmpty. Operand 2043 states and 4651 transitions. [2019-12-18 16:45:01,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 16:45:01,972 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:45:01,972 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:45:01,972 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:45:01,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:45:01,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1022467216, now seen corresponding path program 1 times [2019-12-18 16:45:01,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:45:01,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266279506] [2019-12-18 16:45:01,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:45:01,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:45:02,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:45:02,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266279506] [2019-12-18 16:45:02,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:45:02,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:45:02,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583386299] [2019-12-18 16:45:02,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:45:02,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:45:02,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:45:02,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:45:02,026 INFO L87 Difference]: Start difference. First operand 2043 states and 4651 transitions. Second operand 3 states. [2019-12-18 16:45:02,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:45:02,056 INFO L93 Difference]: Finished difference Result 3738 states and 8517 transitions. [2019-12-18 16:45:02,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:45:02,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 16:45:02,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:45:02,060 INFO L225 Difference]: With dead ends: 3738 [2019-12-18 16:45:02,060 INFO L226 Difference]: Without dead ends: 1966 [2019-12-18 16:45:02,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:45:02,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1966 states. [2019-12-18 16:45:02,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1966 to 1950. [2019-12-18 16:45:02,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1950 states. [2019-12-18 16:45:02,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1950 states and 4342 transitions. [2019-12-18 16:45:02,106 INFO L78 Accepts]: Start accepts. Automaton has 1950 states and 4342 transitions. Word has length 27 [2019-12-18 16:45:02,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:45:02,107 INFO L462 AbstractCegarLoop]: Abstraction has 1950 states and 4342 transitions. [2019-12-18 16:45:02,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:45:02,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1950 states and 4342 transitions. [2019-12-18 16:45:02,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 16:45:02,110 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:45:02,111 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:45:02,111 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:45:02,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:45:02,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1564138658, now seen corresponding path program 2 times [2019-12-18 16:45:02,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:45:02,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642856193] [2019-12-18 16:45:02,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:45:02,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:45:02,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:45:02,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642856193] [2019-12-18 16:45:02,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:45:02,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 16:45:02,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955542760] [2019-12-18 16:45:02,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:45:02,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:45:02,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:45:02,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:45:02,202 INFO L87 Difference]: Start difference. First operand 1950 states and 4342 transitions. Second operand 5 states. [2019-12-18 16:45:02,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:45:02,683 INFO L93 Difference]: Finished difference Result 2942 states and 6436 transitions. [2019-12-18 16:45:02,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 16:45:02,684 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 16:45:02,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:45:02,688 INFO L225 Difference]: With dead ends: 2942 [2019-12-18 16:45:02,689 INFO L226 Difference]: Without dead ends: 2942 [2019-12-18 16:45:02,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:45:02,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2942 states. [2019-12-18 16:45:02,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2942 to 2507. [2019-12-18 16:45:02,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2507 states. [2019-12-18 16:45:02,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 5550 transitions. [2019-12-18 16:45:02,731 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 5550 transitions. Word has length 27 [2019-12-18 16:45:02,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:45:02,731 INFO L462 AbstractCegarLoop]: Abstraction has 2507 states and 5550 transitions. [2019-12-18 16:45:02,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:45:02,731 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 5550 transitions. [2019-12-18 16:45:02,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 16:45:02,736 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:45:02,736 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:45:02,736 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:45:02,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:45:02,737 INFO L82 PathProgramCache]: Analyzing trace with hash -5510903, now seen corresponding path program 1 times [2019-12-18 16:45:02,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:45:02,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024818093] [2019-12-18 16:45:02,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:45:02,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:45:02,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:45:02,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024818093] [2019-12-18 16:45:02,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:45:02,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 16:45:02,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477985247] [2019-12-18 16:45:02,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:45:02,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:45:02,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:45:02,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:45:02,842 INFO L87 Difference]: Start difference. First operand 2507 states and 5550 transitions. Second operand 5 states. [2019-12-18 16:45:02,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:45:02,904 INFO L93 Difference]: Finished difference Result 1526 states and 3206 transitions. [2019-12-18 16:45:02,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:45:02,905 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 16:45:02,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:45:02,907 INFO L225 Difference]: With dead ends: 1526 [2019-12-18 16:45:02,907 INFO L226 Difference]: Without dead ends: 1282 [2019-12-18 16:45:02,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:45:02,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states. [2019-12-18 16:45:03,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 1187. [2019-12-18 16:45:03,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1187 states. [2019-12-18 16:45:03,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 1187 states and 2573 transitions. [2019-12-18 16:45:03,026 INFO L78 Accepts]: Start accepts. Automaton has 1187 states and 2573 transitions. Word has length 28 [2019-12-18 16:45:03,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:45:03,027 INFO L462 AbstractCegarLoop]: Abstraction has 1187 states and 2573 transitions. [2019-12-18 16:45:03,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:45:03,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1187 states and 2573 transitions. [2019-12-18 16:45:03,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 16:45:03,032 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:45:03,032 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:45:03,033 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:45:03,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:45:03,033 INFO L82 PathProgramCache]: Analyzing trace with hash -282366580, now seen corresponding path program 1 times [2019-12-18 16:45:03,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:45:03,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781160507] [2019-12-18 16:45:03,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:45:03,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:45:03,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:45:03,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781160507] [2019-12-18 16:45:03,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:45:03,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 16:45:03,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226675208] [2019-12-18 16:45:03,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:45:03,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:45:03,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:45:03,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:45:03,176 INFO L87 Difference]: Start difference. First operand 1187 states and 2573 transitions. Second operand 7 states. [2019-12-18 16:45:03,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:45:03,352 INFO L93 Difference]: Finished difference Result 2079 states and 4404 transitions. [2019-12-18 16:45:03,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 16:45:03,353 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-18 16:45:03,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:45:03,355 INFO L225 Difference]: With dead ends: 2079 [2019-12-18 16:45:03,355 INFO L226 Difference]: Without dead ends: 1402 [2019-12-18 16:45:03,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-18 16:45:03,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2019-12-18 16:45:03,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1193. [2019-12-18 16:45:03,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1193 states. [2019-12-18 16:45:03,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 2562 transitions. [2019-12-18 16:45:03,377 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 2562 transitions. Word has length 51 [2019-12-18 16:45:03,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:45:03,379 INFO L462 AbstractCegarLoop]: Abstraction has 1193 states and 2562 transitions. [2019-12-18 16:45:03,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:45:03,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 2562 transitions. [2019-12-18 16:45:03,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 16:45:03,383 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:45:03,384 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:45:03,384 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:45:03,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:45:03,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1667743284, now seen corresponding path program 2 times [2019-12-18 16:45:03,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:45:03,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82717096] [2019-12-18 16:45:03,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:45:03,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:45:03,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:45:03,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82717096] [2019-12-18 16:45:03,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:45:03,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:45:03,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801706694] [2019-12-18 16:45:03,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:45:03,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:45:03,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:45:03,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:45:03,482 INFO L87 Difference]: Start difference. First operand 1193 states and 2562 transitions. Second operand 3 states. [2019-12-18 16:45:03,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:45:03,533 INFO L93 Difference]: Finished difference Result 1560 states and 3313 transitions. [2019-12-18 16:45:03,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:45:03,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-18 16:45:03,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:45:03,536 INFO L225 Difference]: With dead ends: 1560 [2019-12-18 16:45:03,536 INFO L226 Difference]: Without dead ends: 1560 [2019-12-18 16:45:03,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:45:03,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1560 states. [2019-12-18 16:45:03,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1560 to 1241. [2019-12-18 16:45:03,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1241 states. [2019-12-18 16:45:03,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 1241 states and 2674 transitions. [2019-12-18 16:45:03,558 INFO L78 Accepts]: Start accepts. Automaton has 1241 states and 2674 transitions. Word has length 51 [2019-12-18 16:45:03,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:45:03,559 INFO L462 AbstractCegarLoop]: Abstraction has 1241 states and 2674 transitions. [2019-12-18 16:45:03,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:45:03,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 2674 transitions. [2019-12-18 16:45:03,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 16:45:03,561 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:45:03,561 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:45:03,562 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:45:03,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:45:03,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1232036927, now seen corresponding path program 1 times [2019-12-18 16:45:03,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:45:03,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649515177] [2019-12-18 16:45:03,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:45:03,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:45:03,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:45:03,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649515177] [2019-12-18 16:45:03,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:45:03,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:45:03,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919413031] [2019-12-18 16:45:03,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 16:45:03,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:45:03,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 16:45:03,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 16:45:03,748 INFO L87 Difference]: Start difference. First operand 1241 states and 2674 transitions. Second operand 8 states. [2019-12-18 16:45:05,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:45:05,198 INFO L93 Difference]: Finished difference Result 2619 states and 5414 transitions. [2019-12-18 16:45:05,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 16:45:05,198 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-12-18 16:45:05,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:45:05,202 INFO L225 Difference]: With dead ends: 2619 [2019-12-18 16:45:05,202 INFO L226 Difference]: Without dead ends: 2619 [2019-12-18 16:45:05,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=421, Unknown=0, NotChecked=0, Total=552 [2019-12-18 16:45:05,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2619 states. [2019-12-18 16:45:05,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2619 to 1259. [2019-12-18 16:45:05,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1259 states. [2019-12-18 16:45:05,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1259 states to 1259 states and 2696 transitions. [2019-12-18 16:45:05,225 INFO L78 Accepts]: Start accepts. Automaton has 1259 states and 2696 transitions. Word has length 52 [2019-12-18 16:45:05,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:45:05,225 INFO L462 AbstractCegarLoop]: Abstraction has 1259 states and 2696 transitions. [2019-12-18 16:45:05,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 16:45:05,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1259 states and 2696 transitions. [2019-12-18 16:45:05,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 16:45:05,228 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:45:05,228 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:45:05,228 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:45:05,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:45:05,229 INFO L82 PathProgramCache]: Analyzing trace with hash -448501738, now seen corresponding path program 1 times [2019-12-18 16:45:05,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:45:05,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188934925] [2019-12-18 16:45:05,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:45:05,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:45:05,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:45:05,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188934925] [2019-12-18 16:45:05,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:45:05,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 16:45:05,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512277316] [2019-12-18 16:45:05,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:45:05,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:45:05,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:45:05,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:45:05,339 INFO L87 Difference]: Start difference. First operand 1259 states and 2696 transitions. Second operand 7 states. [2019-12-18 16:45:06,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:45:06,390 INFO L93 Difference]: Finished difference Result 2242 states and 4589 transitions. [2019-12-18 16:45:06,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 16:45:06,391 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-18 16:45:06,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:45:06,394 INFO L225 Difference]: With dead ends: 2242 [2019-12-18 16:45:06,394 INFO L226 Difference]: Without dead ends: 2242 [2019-12-18 16:45:06,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2019-12-18 16:45:06,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2242 states. [2019-12-18 16:45:06,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2242 to 1280. [2019-12-18 16:45:06,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1280 states. [2019-12-18 16:45:06,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 2742 transitions. [2019-12-18 16:45:06,417 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 2742 transitions. Word has length 52 [2019-12-18 16:45:06,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:45:06,417 INFO L462 AbstractCegarLoop]: Abstraction has 1280 states and 2742 transitions. [2019-12-18 16:45:06,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:45:06,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 2742 transitions. [2019-12-18 16:45:06,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 16:45:06,420 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:45:06,420 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:45:06,420 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:45:06,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:45:06,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1247011877, now seen corresponding path program 2 times [2019-12-18 16:45:06,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:45:06,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855596322] [2019-12-18 16:45:06,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:45:06,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:45:06,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:45:06,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855596322] [2019-12-18 16:45:06,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:45:06,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:45:06,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804639583] [2019-12-18 16:45:06,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:45:06,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:45:06,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:45:06,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:45:06,485 INFO L87 Difference]: Start difference. First operand 1280 states and 2742 transitions. Second operand 3 states. [2019-12-18 16:45:06,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:45:06,496 INFO L93 Difference]: Finished difference Result 1279 states and 2740 transitions. [2019-12-18 16:45:06,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:45:06,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 16:45:06,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:45:06,499 INFO L225 Difference]: With dead ends: 1279 [2019-12-18 16:45:06,499 INFO L226 Difference]: Without dead ends: 1279 [2019-12-18 16:45:06,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:45:06,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2019-12-18 16:45:06,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 878. [2019-12-18 16:45:06,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 878 states. [2019-12-18 16:45:06,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1910 transitions. [2019-12-18 16:45:06,522 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1910 transitions. Word has length 52 [2019-12-18 16:45:06,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:45:06,523 INFO L462 AbstractCegarLoop]: Abstraction has 878 states and 1910 transitions. [2019-12-18 16:45:06,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:45:06,523 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1910 transitions. [2019-12-18 16:45:06,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 16:45:06,525 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:45:06,525 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:45:06,526 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:45:06,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:45:06,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1710729972, now seen corresponding path program 1 times [2019-12-18 16:45:06,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:45:06,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457244206] [2019-12-18 16:45:06,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:45:06,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 16:45:06,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 16:45:06,703 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 16:45:06,705 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 16:45:06,709 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_54| 0 0))) (and (= 0 v_~x~0_148) (= 0 v_~y$flush_delayed~0_33) (= 0 v_~y$read_delayed_var~0.offset_7) (= |v_#valid_52| (store .cse0 |v_ULTIMATE.start_main_~#t585~0.base_29| 1)) (= v_~y$w_buff1~0_317 0) (= v_~y$r_buff1_thd0~0_179 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t585~0.base_29| 4)) (= 0 v_~__unbuffered_cnt~0_62) (= |v_ULTIMATE.start_main_~#t585~0.offset_20| 0) (= v_~y$mem_tmp~0_26 0) (= v_~y~0_149 0) (= 0 v_~y$r_buff1_thd2~0_326) (= v_~y$read_delayed~0_6 0) (= v_~y$w_buff1_used~0_504 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t585~0.base_29|) 0) (= v_~y$r_buff0_thd1~0_219 0) (= v_~y$r_buff1_thd1~0_159 0) (= 0 v_~weak$$choice0~0_21) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t585~0.base_29|) (= 0 v_~y$read_delayed_var~0.base_7) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= 0 v_~__unbuffered_p1_EAX~0_47) (= 0 v_~y$r_buff0_thd2~0_362) (= v_~__unbuffered_p1_EBX~0_46 0) (= v_~y$w_buff0_used~0_796 0) (= v_~main$tmp_guard0~0_32 0) (= v_~y$r_buff0_thd0~0_136 0) (= v_~weak$$choice2~0_121 0) (= 0 v_~y$w_buff0~0_547) (= 0 |v_#NULL.base_5|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t585~0.base_29| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t585~0.base_29|) |v_ULTIMATE.start_main_~#t585~0.offset_20| 0)) |v_#memory_int_15|) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_796, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_29|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_35|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_73|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_31|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_159, ~y$mem_tmp~0=v_~y$mem_tmp~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_547, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_219, ~y$flush_delayed~0=v_~y$flush_delayed~0_33, ULTIMATE.start_main_~#t585~0.base=|v_ULTIMATE.start_main_~#t585~0.base_29|, #length=|v_#length_15|, ~y~0=v_~y~0_149, ULTIMATE.start_main_~#t586~0.base=|v_ULTIMATE.start_main_~#t586~0.base_17|, ULTIMATE.start_main_~#t586~0.offset=|v_ULTIMATE.start_main_~#t586~0.offset_14|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_46, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, #NULL.base=|v_#NULL.base_5|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_326, ~weak$$choice0~0=v_~weak$$choice0~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_36|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_35|, ~y$w_buff1~0=v_~y$w_buff1~0_317, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_136, ULTIMATE.start_main_~#t585~0.offset=|v_ULTIMATE.start_main_~#t585~0.offset_20|, #valid=|v_#valid_52|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_362, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_18|, ~weak$$choice2~0=v_~weak$$choice2~0_121, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_179, ~x~0=v_~x~0_148, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_504} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ULTIMATE.start_main_~#t585~0.base, #length, ~y~0, ULTIMATE.start_main_~#t586~0.base, ULTIMATE.start_main_~#t586~0.offset, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, ULTIMATE.start_main_~#t585~0.offset, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 16:45:06,711 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L797-1-->L799: Formula: (and (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t586~0.base_12| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t586~0.base_12|)) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t586~0.base_12| 4) |v_#length_9|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t586~0.base_12|) (= |v_ULTIMATE.start_main_~#t586~0.offset_10| 0) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t586~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t586~0.base_12|) |v_ULTIMATE.start_main_~#t586~0.offset_10| 1))) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t586~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t586~0.base=|v_ULTIMATE.start_main_~#t586~0.base_12|, ULTIMATE.start_main_~#t586~0.offset=|v_ULTIMATE.start_main_~#t586~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t586~0.base, ULTIMATE.start_main_~#t586~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-18 16:45:06,711 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L4-->L738: Formula: (and (= v_~y$r_buff0_thd1~0_41 v_~y$r_buff1_thd1~0_23) (= v_~y$r_buff0_thd2~0_107 v_~y$r_buff1_thd2~0_62) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_66 0)) (= v_~y$r_buff0_thd0~0_52 v_~y$r_buff1_thd0~0_32) (= v_~x~0_18 1) (= v_~y$r_buff0_thd1~0_40 1)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_52, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_41, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_107, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_66} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_62, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_23, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_52, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_40, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_107, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_66, ~x~0=v_~x~0_18, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_32} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 16:45:06,715 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L739-->L739-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In436204474 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In436204474 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In436204474 |P0Thread1of1ForFork0_#t~ite5_Out436204474|)) (and (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out436204474|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In436204474, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In436204474} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out436204474|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In436204474, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In436204474} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 16:45:06,716 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L763-->L763-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1791433731 256) 0))) (or (and (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-1791433731 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In-1791433731 256)) (and (= 0 (mod ~y$w_buff1_used~0_In-1791433731 256)) .cse0) (and (= 0 (mod ~y$r_buff1_thd2~0_In-1791433731 256)) .cse0))) .cse1 (= |P1Thread1of1ForFork1_#t~ite15_Out-1791433731| |P1Thread1of1ForFork1_#t~ite14_Out-1791433731|) (= ~y$w_buff0~0_In-1791433731 |P1Thread1of1ForFork1_#t~ite14_Out-1791433731|)) (and (not .cse1) (= ~y$w_buff0~0_In-1791433731 |P1Thread1of1ForFork1_#t~ite15_Out-1791433731|) (= |P1Thread1of1ForFork1_#t~ite14_In-1791433731| |P1Thread1of1ForFork1_#t~ite14_Out-1791433731|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1791433731, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1791433731, ~y$w_buff0~0=~y$w_buff0~0_In-1791433731, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1791433731, ~weak$$choice2~0=~weak$$choice2~0_In-1791433731, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In-1791433731|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1791433731} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1791433731, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1791433731, ~y$w_buff0~0=~y$w_buff0~0_In-1791433731, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1791433731, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out-1791433731|, ~weak$$choice2~0=~weak$$choice2~0_In-1791433731, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1791433731|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1791433731} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 16:45:06,717 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L764-->L764-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In709084914 256)))) (or (and .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In709084914 256)))) (or (and .cse1 (= (mod ~y$r_buff1_thd2~0_In709084914 256) 0)) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In709084914 256))) (= (mod ~y$w_buff0_used~0_In709084914 256) 0))) (= |P1Thread1of1ForFork1_#t~ite18_Out709084914| |P1Thread1of1ForFork1_#t~ite17_Out709084914|) (= ~y$w_buff1~0_In709084914 |P1Thread1of1ForFork1_#t~ite17_Out709084914|)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite18_Out709084914| ~y$w_buff1~0_In709084914) (= |P1Thread1of1ForFork1_#t~ite17_In709084914| |P1Thread1of1ForFork1_#t~ite17_Out709084914|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In709084914, ~y$w_buff1~0=~y$w_buff1~0_In709084914, ~y$w_buff0_used~0=~y$w_buff0_used~0_In709084914, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In709084914, ~weak$$choice2~0=~weak$$choice2~0_In709084914, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In709084914|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In709084914} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In709084914, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out709084914|, ~y$w_buff1~0=~y$w_buff1~0_In709084914, ~y$w_buff0_used~0=~y$w_buff0_used~0_In709084914, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In709084914, ~weak$$choice2~0=~weak$$choice2~0_In709084914, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out709084914|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In709084914} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-18 16:45:06,718 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L740-->L740-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In-579396663 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-579396663 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-579396663 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In-579396663 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-579396663|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-579396663 |P0Thread1of1ForFork0_#t~ite6_Out-579396663|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-579396663, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-579396663, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-579396663, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-579396663} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-579396663|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-579396663, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-579396663, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-579396663, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-579396663} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 16:45:06,719 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L741-->L742: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In757423382 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In757423382 256) 0))) (or (and (not .cse0) (= 0 ~y$r_buff0_thd1~0_Out757423382) (not .cse1)) (and (= ~y$r_buff0_thd1~0_Out757423382 ~y$r_buff0_thd1~0_In757423382) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In757423382, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In757423382} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In757423382, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out757423382|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out757423382} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 16:45:06,719 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L742-->L742-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In968244319 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In968244319 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In968244319 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In968244319 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out968244319|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd1~0_In968244319 |P0Thread1of1ForFork0_#t~ite8_Out968244319|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In968244319, ~y$w_buff0_used~0=~y$w_buff0_used~0_In968244319, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In968244319, ~y$w_buff1_used~0=~y$w_buff1_used~0_In968244319} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In968244319, ~y$w_buff0_used~0=~y$w_buff0_used~0_In968244319, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out968244319|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In968244319, ~y$w_buff1_used~0=~y$w_buff1_used~0_In968244319} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 16:45:06,720 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L765-->L765-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-913172714 256)))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-913172714 256)))) (or (= (mod ~y$w_buff0_used~0_In-913172714 256) 0) (and (= 0 (mod ~y$w_buff1_used~0_In-913172714 256)) .cse0) (and (= 0 (mod ~y$r_buff1_thd2~0_In-913172714 256)) .cse0))) (= |P1Thread1of1ForFork1_#t~ite20_Out-913172714| |P1Thread1of1ForFork1_#t~ite21_Out-913172714|) .cse1 (= ~y$w_buff0_used~0_In-913172714 |P1Thread1of1ForFork1_#t~ite20_Out-913172714|)) (and (= ~y$w_buff0_used~0_In-913172714 |P1Thread1of1ForFork1_#t~ite21_Out-913172714|) (= |P1Thread1of1ForFork1_#t~ite20_In-913172714| |P1Thread1of1ForFork1_#t~ite20_Out-913172714|) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-913172714, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-913172714, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-913172714|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-913172714, ~weak$$choice2~0=~weak$$choice2~0_In-913172714, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-913172714} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-913172714, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-913172714, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-913172714|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-913172714, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-913172714|, ~weak$$choice2~0=~weak$$choice2~0_In-913172714, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-913172714} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-18 16:45:06,722 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L767-->L768: Formula: (and (= v_~y$r_buff0_thd2~0_136 v_~y$r_buff0_thd2~0_135) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_136, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_135, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_9|, ~weak$$choice2~0=v_~weak$$choice2~0_28, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_14|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_11|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-18 16:45:06,722 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L768-->L768-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-655426978 256)))) (or (and (= ~y$r_buff1_thd2~0_In-655426978 |P1Thread1of1ForFork1_#t~ite30_Out-655426978|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite29_In-655426978| |P1Thread1of1ForFork1_#t~ite29_Out-655426978|)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-655426978 256) 0))) (or (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-655426978 256) 0)) (= (mod ~y$w_buff0_used~0_In-655426978 256) 0) (and (= 0 (mod ~y$w_buff1_used~0_In-655426978 256)) .cse1))) (= |P1Thread1of1ForFork1_#t~ite29_Out-655426978| ~y$r_buff1_thd2~0_In-655426978) .cse0 (= |P1Thread1of1ForFork1_#t~ite29_Out-655426978| |P1Thread1of1ForFork1_#t~ite30_Out-655426978|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-655426978, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-655426978|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-655426978, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-655426978, ~weak$$choice2~0=~weak$$choice2~0_In-655426978, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-655426978} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-655426978, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-655426978|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-655426978|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-655426978, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-655426978, ~weak$$choice2~0=~weak$$choice2~0_In-655426978, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-655426978} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-18 16:45:06,722 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~y$r_buff1_thd1~0_129 |v_P0Thread1of1ForFork0_#t~ite8_32|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_129, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_31|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 16:45:06,723 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L770-->L774: Formula: (and (= 0 v_~y$flush_delayed~0_6) (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= v_~y~0_21 v_~y$mem_tmp~0_5)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~y~0=v_~y~0_21} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-18 16:45:06,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L774-2-->L774-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In2087591782 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In2087591782 256)))) (or (and (= ~y~0_In2087591782 |P1Thread1of1ForFork1_#t~ite32_Out2087591782|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out2087591782| ~y$w_buff1~0_In2087591782)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2087591782, ~y$w_buff1~0=~y$w_buff1~0_In2087591782, ~y~0=~y~0_In2087591782, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2087591782} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2087591782, ~y$w_buff1~0=~y$w_buff1~0_In2087591782, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out2087591782|, ~y~0=~y~0_In2087591782, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2087591782} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 16:45:06,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L774-4-->L775: Formula: (= v_~y~0_29 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_7|, ~y~0=v_~y~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-18 16:45:06,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L775-->L775-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1699440630 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1699440630 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out1699440630| ~y$w_buff0_used~0_In1699440630) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out1699440630| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1699440630, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1699440630} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1699440630, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1699440630, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out1699440630|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 16:45:06,725 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1424245142 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1424245142 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1424245142 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In1424245142 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out1424245142|)) (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In1424245142 |P1Thread1of1ForFork1_#t~ite35_Out1424245142|) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1424245142, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1424245142, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1424245142, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1424245142} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1424245142, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1424245142, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1424245142, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1424245142|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1424245142} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 16:45:06,726 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L777-->L777-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1287751063 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1287751063 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out1287751063| ~y$r_buff0_thd2~0_In1287751063)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out1287751063| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1287751063, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1287751063} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1287751063, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1287751063, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1287751063|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 16:45:06,726 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L778-->L778-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In1760892903 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In1760892903 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1760892903 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In1760892903 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite37_Out1760892903| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork1_#t~ite37_Out1760892903| ~y$r_buff1_thd2~0_In1760892903) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1760892903, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1760892903, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1760892903, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1760892903} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1760892903, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1760892903, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1760892903, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1760892903|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1760892903} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 16:45:06,727 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L778-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_47 1) v_~__unbuffered_cnt~0_46) (= v_~y$r_buff1_thd2~0_270 |v_P1Thread1of1ForFork1_#t~ite37_42|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_42|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_270, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_41|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 16:45:06,727 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_300 256) 0) (= (mod v_~y$r_buff0_thd0~0_64 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 16:45:06,728 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-621749464 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-621749464 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out-621749464| ~y$w_buff1~0_In-621749464) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y~0_In-621749464 |ULTIMATE.start_main_#t~ite40_Out-621749464|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-621749464, ~y~0=~y~0_In-621749464, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-621749464, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-621749464} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-621749464|, ~y$w_buff1~0=~y$w_buff1~0_In-621749464, ~y~0=~y~0_In-621749464, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-621749464, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-621749464} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 16:45:06,728 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L805-4-->L806: Formula: (= v_~y~0_43 |v_ULTIMATE.start_main_#t~ite40_11|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~y~0=v_~y~0_43} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-18 16:45:06,728 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L806-->L806-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In50644190 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In50644190 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out50644190| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In50644190 |ULTIMATE.start_main_#t~ite42_Out50644190|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In50644190, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In50644190} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In50644190, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In50644190, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out50644190|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 16:45:06,729 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L807-->L807-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd0~0_In1740584291 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1740584291 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In1740584291 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1740584291 256)))) (or (and (= ~y$w_buff1_used~0_In1740584291 |ULTIMATE.start_main_#t~ite43_Out1740584291|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite43_Out1740584291|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1740584291, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1740584291, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1740584291, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1740584291} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1740584291, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1740584291, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1740584291|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1740584291, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1740584291} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 16:45:06,729 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L808-->L808-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In182994626 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In182994626 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite44_Out182994626| 0)) (and (= ~y$r_buff0_thd0~0_In182994626 |ULTIMATE.start_main_#t~ite44_Out182994626|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In182994626, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In182994626} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In182994626, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In182994626, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out182994626|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 16:45:06,730 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L809-->L809-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd0~0_In-309860621 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-309860621 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-309860621 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-309860621 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite45_Out-309860621|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite45_Out-309860621| ~y$r_buff1_thd0~0_In-309860621)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-309860621, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-309860621, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-309860621, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-309860621} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-309860621, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-309860621, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-309860621, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-309860621|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-309860621} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 16:45:06,730 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_17 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~y$r_buff1_thd0~0_140 |v_ULTIMATE.start_main_#t~ite45_40|) (= 2 v_~x~0_117) (= 2 v_~__unbuffered_p1_EAX~0_28) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~__unbuffered_p1_EBX~0_24 0)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~x~0=v_~x~0_117, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_40|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x~0=v_~x~0_117, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_140, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 16:45:06,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 04:45:06 BasicIcfg [2019-12-18 16:45:06,819 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 16:45:06,821 INFO L168 Benchmark]: Toolchain (without parser) took 18455.24 ms. Allocated memory was 138.4 MB in the beginning and 716.2 MB in the end (delta: 577.8 MB). Free memory was 101.7 MB in the beginning and 381.5 MB in the end (delta: -279.8 MB). Peak memory consumption was 297.9 MB. Max. memory is 7.1 GB. [2019-12-18 16:45:06,821 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-18 16:45:06,822 INFO L168 Benchmark]: CACSL2BoogieTranslator took 866.58 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 101.3 MB in the beginning and 156.6 MB in the end (delta: -55.3 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. [2019-12-18 16:45:06,823 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.86 ms. Allocated memory is still 202.4 MB. Free memory was 156.6 MB in the beginning and 153.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 16:45:06,823 INFO L168 Benchmark]: Boogie Preprocessor took 58.82 ms. Allocated memory is still 202.4 MB. Free memory was 153.9 MB in the beginning and 151.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 16:45:06,824 INFO L168 Benchmark]: RCFGBuilder took 751.87 ms. Allocated memory is still 202.4 MB. Free memory was 151.9 MB in the beginning and 107.7 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. [2019-12-18 16:45:06,825 INFO L168 Benchmark]: TraceAbstraction took 16703.76 ms. Allocated memory was 202.4 MB in the beginning and 716.2 MB in the end (delta: 513.8 MB). Free memory was 107.1 MB in the beginning and 381.5 MB in the end (delta: -274.5 MB). Peak memory consumption was 239.4 MB. Max. memory is 7.1 GB. [2019-12-18 16:45:06,828 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 866.58 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 101.3 MB in the beginning and 156.6 MB in the end (delta: -55.3 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.86 ms. Allocated memory is still 202.4 MB. Free memory was 156.6 MB in the beginning and 153.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 58.82 ms. Allocated memory is still 202.4 MB. Free memory was 153.9 MB in the beginning and 151.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 751.87 ms. Allocated memory is still 202.4 MB. Free memory was 151.9 MB in the beginning and 107.7 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16703.76 ms. Allocated memory was 202.4 MB in the beginning and 716.2 MB in the end (delta: 513.8 MB). Free memory was 107.1 MB in the beginning and 381.5 MB in the end (delta: -274.5 MB). Peak memory consumption was 239.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.3s, 147 ProgramPointsBefore, 77 ProgramPointsAfterwards, 181 TransitionsBefore, 87 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 27 ChoiceCompositions, 4555 VarBasedMoverChecksPositive, 216 VarBasedMoverChecksNegative, 60 SemBasedMoverChecksPositive, 196 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 47763 CheckedPairsTotal, 101 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L797] FCALL, FORK 0 pthread_create(&t585, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L799] FCALL, FORK 0 pthread_create(&t586, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 x = 2 [L755] 2 __unbuffered_p1_EAX = x [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 y$flush_delayed = weak$$choice2 [L761] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L762] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L763] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L764] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L765] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L766] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L768] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L774] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L776] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L777] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L807] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L808] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 16.4s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2105 SDtfs, 2383 SDslu, 4179 SDs, 0 SdLazy, 3202 SolverSat, 170 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 28 SyntacticMatches, 9 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11878occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.7s AutomataMinimizationTime, 15 MinimizatonAttempts, 11142 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 505 NumberOfCodeBlocks, 505 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 437 ConstructedInterpolants, 0 QuantifiedInterpolants, 50209 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...