/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-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix034_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:10:52,097 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:10:52,100 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:10:52,115 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:10:52,115 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:10:52,116 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:10:52,119 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:10:52,123 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:10:52,125 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:10:52,129 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:10:52,130 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:10:52,132 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:10:52,132 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:10:52,135 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:10:52,136 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:10:52,137 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:10:52,137 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:10:52,140 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:10:52,144 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:10:52,146 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:10:52,148 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:10:52,149 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:10:52,150 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:10:52,150 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:10:52,152 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:10:52,153 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:10:52,153 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:10:52,154 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:10:52,154 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:10:52,155 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:10:52,155 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:10:52,156 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:10:52,157 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:10:52,158 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:10:52,158 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:10:52,159 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:10:52,159 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:10:52,160 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:10:52,160 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:10:52,161 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:10:52,161 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:10:52,162 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-VariableLbe.epf [2019-12-18 21:10:52,176 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:10:52,177 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:10:52,178 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:10:52,178 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:10:52,178 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:10:52,179 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:10:52,179 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:10:52,179 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:10:52,179 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:10:52,179 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:10:52,180 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:10:52,180 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:10:52,180 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:10:52,180 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:10:52,180 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:10:52,181 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:10:52,181 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:10:52,181 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:10:52,181 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:10:52,181 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:10:52,182 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:10:52,182 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:10:52,182 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:10:52,182 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:10:52,182 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:10:52,183 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:10:52,183 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:10:52,183 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:10:52,183 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:10:52,183 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:10:52,454 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:10:52,467 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:10:52,470 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:10:52,472 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:10:52,472 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:10:52,473 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix034_power.oepc.i [2019-12-18 21:10:52,532 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/524161246/4feab60bfda443b69e8ee5ff98c52fe9/FLAG3e3d3ea40 [2019-12-18 21:10:53,087 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:10:53,088 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix034_power.oepc.i [2019-12-18 21:10:53,116 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/524161246/4feab60bfda443b69e8ee5ff98c52fe9/FLAG3e3d3ea40 [2019-12-18 21:10:53,352 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/524161246/4feab60bfda443b69e8ee5ff98c52fe9 [2019-12-18 21:10:53,361 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:10:53,363 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:10:53,364 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:10:53,364 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:10:53,368 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:10:53,368 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:10:53" (1/1) ... [2019-12-18 21:10:53,371 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29a5a144 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:10:53, skipping insertion in model container [2019-12-18 21:10:53,371 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:10:53" (1/1) ... [2019-12-18 21:10:53,379 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:10:53,438 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:10:53,945 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:10:53,957 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:10:54,043 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:10:54,116 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:10:54,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:10:54 WrapperNode [2019-12-18 21:10:54,117 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:10:54,118 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:10:54,118 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:10:54,118 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:10:54,126 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:10:54" (1/1) ... [2019-12-18 21:10:54,146 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:10:54" (1/1) ... [2019-12-18 21:10:54,177 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:10:54,177 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:10:54,177 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:10:54,177 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:10:54,185 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:10:54" (1/1) ... [2019-12-18 21:10:54,185 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:10:54" (1/1) ... [2019-12-18 21:10:54,190 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:10:54" (1/1) ... [2019-12-18 21:10:54,190 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:10:54" (1/1) ... [2019-12-18 21:10:54,201 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:10:54" (1/1) ... [2019-12-18 21:10:54,205 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:10:54" (1/1) ... [2019-12-18 21:10:54,209 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:10:54" (1/1) ... [2019-12-18 21:10:54,215 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:10:54,216 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:10:54,216 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:10:54,216 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:10:54,217 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:10:54" (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 21:10:54,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:10:54,297 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:10:54,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:10:54,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:10:54,297 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:10:54,297 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:10:54,297 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:10:54,297 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:10:54,298 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:10:54,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:10:54,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:10:54,300 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 21:10:54,972 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:10:54,973 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:10:54,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:10:54 BoogieIcfgContainer [2019-12-18 21:10:54,974 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:10:54,976 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:10:54,977 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:10:54,980 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:10:54,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:10:53" (1/3) ... [2019-12-18 21:10:54,981 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6464544b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:10:54, skipping insertion in model container [2019-12-18 21:10:54,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:10:54" (2/3) ... [2019-12-18 21:10:54,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6464544b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:10:54, skipping insertion in model container [2019-12-18 21:10:54,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:10:54" (3/3) ... [2019-12-18 21:10:54,983 INFO L109 eAbstractionObserver]: Analyzing ICFG mix034_power.oepc.i [2019-12-18 21:10:54,993 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:10:54,994 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:10:55,002 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:10:55,003 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:10:55,048 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,048 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,048 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,049 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,049 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,049 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,049 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,050 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,050 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,050 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,051 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,051 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,051 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,051 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,052 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,052 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,052 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,052 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,052 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,058 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,058 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,091 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,092 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,092 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,113 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,116 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:55,132 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 21:10:55,151 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:10:55,152 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:10:55,152 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:10:55,152 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:10:55,152 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:10:55,152 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:10:55,152 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:10:55,153 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:10:55,168 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 183 transitions [2019-12-18 21:10:55,170 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 149 places, 183 transitions [2019-12-18 21:10:55,265 INFO L126 PetriNetUnfolder]: 41/181 cut-off events. [2019-12-18 21:10:55,265 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:10:55,285 INFO L76 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 181 events. 41/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 351 event pairs. 6/144 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 21:10:55,304 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 149 places, 183 transitions [2019-12-18 21:10:55,377 INFO L126 PetriNetUnfolder]: 41/181 cut-off events. [2019-12-18 21:10:55,377 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:10:55,383 INFO L76 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 181 events. 41/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 351 event pairs. 6/144 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 21:10:55,397 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-18 21:10:55,398 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:10:58,846 WARN L192 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-18 21:10:58,965 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 21:10:58,995 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49761 [2019-12-18 21:10:58,995 INFO L214 etLargeBlockEncoding]: Total number of compositions: 105 [2019-12-18 21:10:58,999 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 74 places, 83 transitions [2019-12-18 21:10:59,407 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8010 states. [2019-12-18 21:10:59,410 INFO L276 IsEmpty]: Start isEmpty. Operand 8010 states. [2019-12-18 21:10:59,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 21:10:59,421 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:10:59,422 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 21:10:59,422 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:10:59,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:10:59,430 INFO L82 PathProgramCache]: Analyzing trace with hash 798121, now seen corresponding path program 1 times [2019-12-18 21:10:59,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:10:59,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200436730] [2019-12-18 21:10:59,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:10:59,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:10:59,714 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 21:10:59,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200436730] [2019-12-18 21:10:59,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:10:59,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:10:59,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591618903] [2019-12-18 21:10:59,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:10:59,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:10:59,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:10:59,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:10:59,735 INFO L87 Difference]: Start difference. First operand 8010 states. Second operand 3 states. [2019-12-18 21:11:00,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:11:00,040 INFO L93 Difference]: Finished difference Result 7842 states and 25482 transitions. [2019-12-18 21:11:00,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:11:00,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 21:11:00,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:11:00,124 INFO L225 Difference]: With dead ends: 7842 [2019-12-18 21:11:00,125 INFO L226 Difference]: Without dead ends: 7386 [2019-12-18 21:11:00,126 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 21:11:00,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7386 states. [2019-12-18 21:11:00,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7386 to 7386. [2019-12-18 21:11:00,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7386 states. [2019-12-18 21:11:00,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7386 states to 7386 states and 23956 transitions. [2019-12-18 21:11:00,574 INFO L78 Accepts]: Start accepts. Automaton has 7386 states and 23956 transitions. Word has length 3 [2019-12-18 21:11:00,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:11:00,574 INFO L462 AbstractCegarLoop]: Abstraction has 7386 states and 23956 transitions. [2019-12-18 21:11:00,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:11:00,574 INFO L276 IsEmpty]: Start isEmpty. Operand 7386 states and 23956 transitions. [2019-12-18 21:11:00,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 21:11:00,580 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:11:00,580 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:11:00,580 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:11:00,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:11:00,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1045751384, now seen corresponding path program 1 times [2019-12-18 21:11:00,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:11:00,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185695377] [2019-12-18 21:11:00,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:11:00,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:11:00,681 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 21:11:00,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185695377] [2019-12-18 21:11:00,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:11:00,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:11:00,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214833931] [2019-12-18 21:11:00,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:11:00,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:11:00,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:11:00,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:11:00,686 INFO L87 Difference]: Start difference. First operand 7386 states and 23956 transitions. Second operand 3 states. [2019-12-18 21:11:00,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:11:00,730 INFO L93 Difference]: Finished difference Result 1203 states and 2726 transitions. [2019-12-18 21:11:00,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:11:00,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-18 21:11:00,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:11:00,740 INFO L225 Difference]: With dead ends: 1203 [2019-12-18 21:11:00,740 INFO L226 Difference]: Without dead ends: 1203 [2019-12-18 21:11:00,744 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 21:11:00,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2019-12-18 21:11:00,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 1203. [2019-12-18 21:11:00,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1203 states. [2019-12-18 21:11:00,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 2726 transitions. [2019-12-18 21:11:00,783 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 2726 transitions. Word has length 11 [2019-12-18 21:11:00,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:11:00,784 INFO L462 AbstractCegarLoop]: Abstraction has 1203 states and 2726 transitions. [2019-12-18 21:11:00,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:11:00,784 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 2726 transitions. [2019-12-18 21:11:00,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 21:11:00,791 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:11:00,791 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:11:00,791 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:11:00,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:11:00,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1102482469, now seen corresponding path program 1 times [2019-12-18 21:11:00,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:11:00,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610012044] [2019-12-18 21:11:00,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:11:00,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:11:00,894 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 21:11:00,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610012044] [2019-12-18 21:11:00,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:11:00,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:11:00,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291488242] [2019-12-18 21:11:00,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:11:00,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:11:00,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:11:00,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:11:00,899 INFO L87 Difference]: Start difference. First operand 1203 states and 2726 transitions. Second operand 3 states. [2019-12-18 21:11:00,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:11:00,969 INFO L93 Difference]: Finished difference Result 1939 states and 4348 transitions. [2019-12-18 21:11:00,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:11:00,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-18 21:11:00,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:11:00,981 INFO L225 Difference]: With dead ends: 1939 [2019-12-18 21:11:00,981 INFO L226 Difference]: Without dead ends: 1939 [2019-12-18 21:11:00,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 21:11:00,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1939 states. [2019-12-18 21:11:01,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1939 to 1336. [2019-12-18 21:11:01,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1336 states. [2019-12-18 21:11:01,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1336 states and 3074 transitions. [2019-12-18 21:11:01,029 INFO L78 Accepts]: Start accepts. Automaton has 1336 states and 3074 transitions. Word has length 14 [2019-12-18 21:11:01,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:11:01,029 INFO L462 AbstractCegarLoop]: Abstraction has 1336 states and 3074 transitions. [2019-12-18 21:11:01,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:11:01,030 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 3074 transitions. [2019-12-18 21:11:01,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 21:11:01,031 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:11:01,031 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:11:01,031 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:11:01,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:11:01,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1024507146, now seen corresponding path program 1 times [2019-12-18 21:11:01,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:11:01,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052353757] [2019-12-18 21:11:01,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:11:01,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:11:01,132 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 21:11:01,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052353757] [2019-12-18 21:11:01,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:11:01,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:11:01,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631103618] [2019-12-18 21:11:01,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:11:01,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:11:01,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:11:01,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:11:01,136 INFO L87 Difference]: Start difference. First operand 1336 states and 3074 transitions. Second operand 4 states. [2019-12-18 21:11:01,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:11:01,350 INFO L93 Difference]: Finished difference Result 1693 states and 3800 transitions. [2019-12-18 21:11:01,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:11:01,350 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 21:11:01,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:11:01,361 INFO L225 Difference]: With dead ends: 1693 [2019-12-18 21:11:01,362 INFO L226 Difference]: Without dead ends: 1693 [2019-12-18 21:11:01,362 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 21:11:01,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1693 states. [2019-12-18 21:11:01,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1693 to 1629. [2019-12-18 21:11:01,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1629 states. [2019-12-18 21:11:01,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1629 states to 1629 states and 3676 transitions. [2019-12-18 21:11:01,408 INFO L78 Accepts]: Start accepts. Automaton has 1629 states and 3676 transitions. Word has length 14 [2019-12-18 21:11:01,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:11:01,409 INFO L462 AbstractCegarLoop]: Abstraction has 1629 states and 3676 transitions. [2019-12-18 21:11:01,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:11:01,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1629 states and 3676 transitions. [2019-12-18 21:11:01,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 21:11:01,410 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:11:01,411 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:11:01,411 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:11:01,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:11:01,411 INFO L82 PathProgramCache]: Analyzing trace with hash -399327403, now seen corresponding path program 1 times [2019-12-18 21:11:01,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:11:01,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532179701] [2019-12-18 21:11:01,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:11:01,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:11:01,473 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 21:11:01,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532179701] [2019-12-18 21:11:01,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:11:01,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:11:01,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149424949] [2019-12-18 21:11:01,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:11:01,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:11:01,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:11:01,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:11:01,476 INFO L87 Difference]: Start difference. First operand 1629 states and 3676 transitions. Second operand 4 states. [2019-12-18 21:11:01,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:11:01,633 INFO L93 Difference]: Finished difference Result 1964 states and 4378 transitions. [2019-12-18 21:11:01,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:11:01,634 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 21:11:01,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:11:01,648 INFO L225 Difference]: With dead ends: 1964 [2019-12-18 21:11:01,648 INFO L226 Difference]: Without dead ends: 1964 [2019-12-18 21:11:01,649 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 21:11:01,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2019-12-18 21:11:01,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1704. [2019-12-18 21:11:01,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1704 states. [2019-12-18 21:11:01,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 3842 transitions. [2019-12-18 21:11:01,708 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 3842 transitions. Word has length 14 [2019-12-18 21:11:01,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:11:01,709 INFO L462 AbstractCegarLoop]: Abstraction has 1704 states and 3842 transitions. [2019-12-18 21:11:01,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:11:01,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 3842 transitions. [2019-12-18 21:11:01,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 21:11:01,713 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:11:01,713 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 21:11:01,713 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:11:01,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:11:01,714 INFO L82 PathProgramCache]: Analyzing trace with hash -524969657, now seen corresponding path program 1 times [2019-12-18 21:11:01,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:11:01,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640959272] [2019-12-18 21:11:01,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:11:01,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:11:02,020 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 21:11:02,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640959272] [2019-12-18 21:11:02,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:11:02,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:11:02,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65868603] [2019-12-18 21:11:02,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:11:02,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:11:02,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:11:02,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:11:02,023 INFO L87 Difference]: Start difference. First operand 1704 states and 3842 transitions. Second operand 5 states. [2019-12-18 21:11:02,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:11:02,288 INFO L93 Difference]: Finished difference Result 2231 states and 4892 transitions. [2019-12-18 21:11:02,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 21:11:02,288 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-18 21:11:02,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:11:02,306 INFO L225 Difference]: With dead ends: 2231 [2019-12-18 21:11:02,307 INFO L226 Difference]: Without dead ends: 2231 [2019-12-18 21:11:02,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:11:02,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2019-12-18 21:11:02,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 1975. [2019-12-18 21:11:02,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1975 states. [2019-12-18 21:11:02,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1975 states to 1975 states and 4398 transitions. [2019-12-18 21:11:02,377 INFO L78 Accepts]: Start accepts. Automaton has 1975 states and 4398 transitions. Word has length 25 [2019-12-18 21:11:02,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:11:02,377 INFO L462 AbstractCegarLoop]: Abstraction has 1975 states and 4398 transitions. [2019-12-18 21:11:02,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:11:02,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1975 states and 4398 transitions. [2019-12-18 21:11:02,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 21:11:02,381 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:11:02,381 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 21:11:02,381 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:11:02,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:11:02,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1656128157, now seen corresponding path program 1 times [2019-12-18 21:11:02,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:11:02,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707449111] [2019-12-18 21:11:02,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:11:02,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:11:02,463 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 21:11:02,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707449111] [2019-12-18 21:11:02,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:11:02,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:11:02,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976250177] [2019-12-18 21:11:02,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:11:02,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:11:02,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:11:02,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:11:02,465 INFO L87 Difference]: Start difference. First operand 1975 states and 4398 transitions. Second operand 4 states. [2019-12-18 21:11:02,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:11:02,482 INFO L93 Difference]: Finished difference Result 1031 states and 2198 transitions. [2019-12-18 21:11:02,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:11:02,483 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-12-18 21:11:02,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:11:02,492 INFO L225 Difference]: With dead ends: 1031 [2019-12-18 21:11:02,492 INFO L226 Difference]: Without dead ends: 1031 [2019-12-18 21:11:02,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:11:02,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2019-12-18 21:11:02,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 973. [2019-12-18 21:11:02,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 973 states. [2019-12-18 21:11:02,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 2091 transitions. [2019-12-18 21:11:02,524 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 2091 transitions. Word has length 26 [2019-12-18 21:11:02,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:11:02,525 INFO L462 AbstractCegarLoop]: Abstraction has 973 states and 2091 transitions. [2019-12-18 21:11:02,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:11:02,525 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 2091 transitions. [2019-12-18 21:11:02,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 21:11:02,527 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:11:02,527 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 21:11:02,527 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:11:02,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:11:02,528 INFO L82 PathProgramCache]: Analyzing trace with hash 2023210146, now seen corresponding path program 1 times [2019-12-18 21:11:02,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:11:02,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329589682] [2019-12-18 21:11:02,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:11:02,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:11:02,637 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 21:11:02,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329589682] [2019-12-18 21:11:02,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:11:02,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:11:02,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848432623] [2019-12-18 21:11:02,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:11:02,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:11:02,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:11:02,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:11:02,640 INFO L87 Difference]: Start difference. First operand 973 states and 2091 transitions. Second operand 5 states. [2019-12-18 21:11:02,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:11:02,818 INFO L93 Difference]: Finished difference Result 1107 states and 2333 transitions. [2019-12-18 21:11:02,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 21:11:02,819 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 21:11:02,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:11:02,823 INFO L225 Difference]: With dead ends: 1107 [2019-12-18 21:11:02,824 INFO L226 Difference]: Without dead ends: 1107 [2019-12-18 21:11:02,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:11:02,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2019-12-18 21:11:02,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 869. [2019-12-18 21:11:02,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 869 states. [2019-12-18 21:11:02,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1878 transitions. [2019-12-18 21:11:02,849 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1878 transitions. Word has length 26 [2019-12-18 21:11:02,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:11:02,850 INFO L462 AbstractCegarLoop]: Abstraction has 869 states and 1878 transitions. [2019-12-18 21:11:02,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:11:02,850 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1878 transitions. [2019-12-18 21:11:02,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 21:11:02,853 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:11:02,853 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 21:11:02,853 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:11:02,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:11:02,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1815455026, now seen corresponding path program 1 times [2019-12-18 21:11:02,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:11:02,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29807201] [2019-12-18 21:11:02,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:11:02,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:11:02,952 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 21:11:02,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29807201] [2019-12-18 21:11:02,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:11:02,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:11:02,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624197047] [2019-12-18 21:11:02,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:11:02,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:11:02,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:11:02,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:11:02,954 INFO L87 Difference]: Start difference. First operand 869 states and 1878 transitions. Second operand 7 states. [2019-12-18 21:11:03,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:11:03,341 INFO L93 Difference]: Finished difference Result 2533 states and 5378 transitions. [2019-12-18 21:11:03,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 21:11:03,341 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-18 21:11:03,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:11:03,350 INFO L225 Difference]: With dead ends: 2533 [2019-12-18 21:11:03,352 INFO L226 Difference]: Without dead ends: 1738 [2019-12-18 21:11:03,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-18 21:11:03,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2019-12-18 21:11:03,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 983. [2019-12-18 21:11:03,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 983 states. [2019-12-18 21:11:03,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 2118 transitions. [2019-12-18 21:11:03,400 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 2118 transitions. Word has length 51 [2019-12-18 21:11:03,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:11:03,400 INFO L462 AbstractCegarLoop]: Abstraction has 983 states and 2118 transitions. [2019-12-18 21:11:03,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:11:03,401 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 2118 transitions. [2019-12-18 21:11:03,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 21:11:03,403 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:11:03,404 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 21:11:03,404 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:11:03,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:11:03,405 INFO L82 PathProgramCache]: Analyzing trace with hash 700498790, now seen corresponding path program 2 times [2019-12-18 21:11:03,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:11:03,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931943057] [2019-12-18 21:11:03,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:11:03,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:11:03,531 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 21:11:03,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931943057] [2019-12-18 21:11:03,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:11:03,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:11:03,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491549159] [2019-12-18 21:11:03,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:11:03,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:11:03,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:11:03,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:11:03,534 INFO L87 Difference]: Start difference. First operand 983 states and 2118 transitions. Second operand 3 states. [2019-12-18 21:11:03,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:11:03,584 INFO L93 Difference]: Finished difference Result 1302 states and 2767 transitions. [2019-12-18 21:11:03,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:11:03,584 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-18 21:11:03,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:11:03,588 INFO L225 Difference]: With dead ends: 1302 [2019-12-18 21:11:03,588 INFO L226 Difference]: Without dead ends: 1302 [2019-12-18 21:11:03,589 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 21:11:03,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2019-12-18 21:11:03,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 1086. [2019-12-18 21:11:03,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1086 states. [2019-12-18 21:11:03,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 2341 transitions. [2019-12-18 21:11:03,618 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 2341 transitions. Word has length 51 [2019-12-18 21:11:03,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:11:03,618 INFO L462 AbstractCegarLoop]: Abstraction has 1086 states and 2341 transitions. [2019-12-18 21:11:03,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:11:03,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 2341 transitions. [2019-12-18 21:11:03,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 21:11:03,624 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:11:03,625 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 21:11:03,625 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:11:03,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:11:03,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1020694631, now seen corresponding path program 1 times [2019-12-18 21:11:03,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:11:03,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389459867] [2019-12-18 21:11:03,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:11:03,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:11:03,756 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 21:11:03,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389459867] [2019-12-18 21:11:03,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:11:03,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:11:03,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737265382] [2019-12-18 21:11:03,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:11:03,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:11:03,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:11:03,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:11:03,759 INFO L87 Difference]: Start difference. First operand 1086 states and 2341 transitions. Second operand 4 states. [2019-12-18 21:11:03,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:11:03,824 INFO L93 Difference]: Finished difference Result 1086 states and 2329 transitions. [2019-12-18 21:11:03,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:11:03,825 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-12-18 21:11:03,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:11:03,828 INFO L225 Difference]: With dead ends: 1086 [2019-12-18 21:11:03,828 INFO L226 Difference]: Without dead ends: 1086 [2019-12-18 21:11:03,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 21:11:03,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1086 states. [2019-12-18 21:11:03,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1086 to 983. [2019-12-18 21:11:03,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 983 states. [2019-12-18 21:11:03,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 2106 transitions. [2019-12-18 21:11:03,851 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 2106 transitions. Word has length 52 [2019-12-18 21:11:03,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:11:03,852 INFO L462 AbstractCegarLoop]: Abstraction has 983 states and 2106 transitions. [2019-12-18 21:11:03,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:11:03,852 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 2106 transitions. [2019-12-18 21:11:03,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 21:11:03,855 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:11:03,855 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 21:11:03,855 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:11:03,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:11:03,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1332632369, now seen corresponding path program 1 times [2019-12-18 21:11:03,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:11:03,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323589376] [2019-12-18 21:11:03,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:11:03,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:11:04,007 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 21:11:04,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323589376] [2019-12-18 21:11:04,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:11:04,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:11:04,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117739191] [2019-12-18 21:11:04,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:11:04,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:11:04,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:11:04,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:11:04,010 INFO L87 Difference]: Start difference. First operand 983 states and 2106 transitions. Second operand 3 states. [2019-12-18 21:11:04,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:11:04,024 INFO L93 Difference]: Finished difference Result 982 states and 2104 transitions. [2019-12-18 21:11:04,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:11:04,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 21:11:04,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:11:04,028 INFO L225 Difference]: With dead ends: 982 [2019-12-18 21:11:04,028 INFO L226 Difference]: Without dead ends: 982 [2019-12-18 21:11:04,028 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 21:11:04,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2019-12-18 21:11:04,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 836. [2019-12-18 21:11:04,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 836 states. [2019-12-18 21:11:04,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1828 transitions. [2019-12-18 21:11:04,049 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1828 transitions. Word has length 52 [2019-12-18 21:11:04,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:11:04,049 INFO L462 AbstractCegarLoop]: Abstraction has 836 states and 1828 transitions. [2019-12-18 21:11:04,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:11:04,049 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1828 transitions. [2019-12-18 21:11:04,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 21:11:04,052 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:11:04,052 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 21:11:04,052 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:11:04,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:11:04,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1167104957, now seen corresponding path program 1 times [2019-12-18 21:11:04,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:11:04,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595340237] [2019-12-18 21:11:04,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:11:04,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:11:04,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:11:04,272 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:11:04,273 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:11:04,277 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] ULTIMATE.startENTRY-->L804: Formula: (let ((.cse0 (store |v_#valid_50| 0 0))) (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t897~0.base_27| 4)) (= 0 v_~__unbuffered_p1_EAX~0_13) (= 0 v_~__unbuffered_p0_EAX~0_13) (= 0 v_~weak$$choice0~0_8) (= v_~z$w_buff0_used~0_109 0) (= v_~main$tmp_guard0~0_7 0) (= v_~z~0_24 0) (= 0 v_~z$r_buff1_thd0~0_21) (= v_~z$r_buff0_thd2~0_79 0) (= 0 v_~z$flush_delayed~0_13) (= 0 v_~y~0_7) (= 0 v_~z$r_buff1_thd1~0_18) (= 0 v_~x~0_7) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~z$r_buff0_thd1~0_24 0) (= 0 v_~z$mem_tmp~0_9) (= |v_#valid_48| (store .cse0 |v_ULTIMATE.start_main_~#t897~0.base_27| 1)) (= (select .cse0 |v_ULTIMATE.start_main_~#t897~0.base_27|) 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t897~0.base_27| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t897~0.base_27|) |v_ULTIMATE.start_main_~#t897~0.offset_20| 0)) |v_#memory_int_15|) (= v_~z$r_buff0_thd0~0_18 0) (= 0 v_~weak$$choice2~0_35) (= |v_#NULL.offset_5| 0) (= 0 v_~z$w_buff0~0_28) (= 0 v_~z$w_buff1_used~0_69) (= v_~__unbuffered_p1_EBX~0_13 0) (= v_~main$tmp_guard1~0_13 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t897~0.base_27|) (= |v_ULTIMATE.start_main_~#t897~0.offset_20| 0) (= 0 v_~z$w_buff1~0_26) (= 0 v_~z$r_buff1_thd2~0_50) (= 0 |v_#NULL.base_5|) (= 0 v_~__unbuffered_cnt~0_16) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t898~0.offset=|v_ULTIMATE.start_main_~#t898~0.offset_16|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_50, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_26, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_11|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_22|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_11|, ULTIMATE.start_main_~#t898~0.base=|v_ULTIMATE.start_main_~#t898~0.base_19|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_13, ULTIMATE.start_main_~#t897~0.offset=|v_ULTIMATE.start_main_~#t897~0.offset_20|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_13, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_21, #length=|v_#length_15|, ~y~0=v_~y~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_79, ~z$mem_tmp~0=v_~z$mem_tmp~0_9, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_13, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_109, ~z$w_buff0~0=v_~z$w_buff0~0_28, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_69, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, #NULL.base=|v_#NULL.base_5|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_48|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_18, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ULTIMATE.start_main_~#t897~0.base=|v_ULTIMATE.start_main_~#t897~0.base_27|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_9|, ~z~0=v_~z~0_24, ~weak$$choice2~0=v_~weak$$choice2~0_35, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_24, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t898~0.offset, ~z$r_buff1_thd2~0, ~z$read_delayed~0, ~z$w_buff1~0, #NULL.offset, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t898~0.base, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t897~0.offset, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, #length, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#res, #valid, ~z$r_buff1_thd1~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~z$read_delayed_var~0.base, ULTIMATE.start_main_~#t897~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-18 21:11:04,278 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L804-1-->L806: Formula: (and (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t898~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t898~0.base_13|) |v_ULTIMATE.start_main_~#t898~0.offset_11| 1))) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t898~0.base_13| 1)) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t898~0.base_13|) 0) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t898~0.base_13| 4)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t898~0.base_13|) (= |v_ULTIMATE.start_main_~#t898~0.offset_11| 0) (not (= 0 |v_ULTIMATE.start_main_~#t898~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t898~0.base=|v_ULTIMATE.start_main_~#t898~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t898~0.offset=|v_ULTIMATE.start_main_~#t898~0.offset_11|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t898~0.base, ULTIMATE.start_main_~#t898~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-18 21:11:04,279 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] P0ENTRY-->L4-3: Formula: (and (= ~z$w_buff0_used~0_In89228861 ~z$w_buff1_used~0_Out89228861) (= |P0Thread1of1ForFork0_#in~arg.offset_In89228861| P0Thread1of1ForFork0_~arg.offset_Out89228861) (= ~z$w_buff0~0_Out89228861 1) (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out89228861 |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out89228861|) (= 1 ~z$w_buff0_used~0_Out89228861) (= |P0Thread1of1ForFork0_#in~arg.base_In89228861| P0Thread1of1ForFork0_~arg.base_Out89228861) (= 0 (mod ~z$w_buff1_used~0_Out89228861 256)) (= 1 |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out89228861|) (= ~z$w_buff0~0_In89228861 ~z$w_buff1~0_Out89228861)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In89228861|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In89228861, ~z$w_buff0~0=~z$w_buff0~0_In89228861, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In89228861|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In89228861|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out89228861, ~z$w_buff0~0=~z$w_buff0~0_Out89228861, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out89228861, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out89228861, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In89228861|, ~z$w_buff1~0=~z$w_buff1~0_Out89228861, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out89228861, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out89228861|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out89228861} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 21:11:04,294 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L773-->L773-8: Formula: (let ((.cse3 (= (mod ~weak$$choice2~0_In-829694223 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-829694223 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd2~0_In-829694223 256) 0)) (.cse4 (= (mod ~z$w_buff1_used~0_In-829694223 256) 0)) (.cse6 (= 0 (mod ~z$r_buff0_thd2~0_In-829694223 256))) (.cse5 (= |P1Thread1of1ForFork1_#t~ite24_Out-829694223| |P1Thread1of1ForFork1_#t~ite23_Out-829694223|))) (or (let ((.cse1 (not .cse6))) (and (or (not .cse0) .cse1) (not .cse2) (= |P1Thread1of1ForFork1_#t~ite22_Out-829694223| |P1Thread1of1ForFork1_#t~ite23_Out-829694223|) .cse3 (or (not .cse4) .cse1) (= |P1Thread1of1ForFork1_#t~ite22_Out-829694223| 0) .cse5)) (and (or (and (= |P1Thread1of1ForFork1_#t~ite23_In-829694223| |P1Thread1of1ForFork1_#t~ite23_Out-829694223|) (not .cse3) (= |P1Thread1of1ForFork1_#t~ite24_Out-829694223| ~z$w_buff1_used~0_In-829694223)) (and .cse3 (= ~z$w_buff1_used~0_In-829694223 |P1Thread1of1ForFork1_#t~ite23_Out-829694223|) (or .cse2 (and .cse0 .cse6) (and .cse4 .cse6)) .cse5)) (= |P1Thread1of1ForFork1_#t~ite22_In-829694223| |P1Thread1of1ForFork1_#t~ite22_Out-829694223|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-829694223, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-829694223, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-829694223, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-829694223|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In-829694223|, ~weak$$choice2~0=~weak$$choice2~0_In-829694223, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-829694223} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-829694223, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-829694223, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-829694223|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-829694223, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-829694223|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out-829694223|, ~weak$$choice2~0=~weak$$choice2~0_In-829694223, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-829694223} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-18 21:11:04,296 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L774-->L775: Formula: (and (= v_~z$r_buff0_thd2~0_64 v_~z$r_buff0_thd2~0_63) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~weak$$choice2~0=v_~weak$$choice2~0_23, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_64} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_8|, ~weak$$choice2~0=v_~weak$$choice2~0_23, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_63, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_9|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_10|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~z$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-18 21:11:04,296 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L775-->L775-8: Formula: (let ((.cse4 (= (mod ~z$r_buff1_thd2~0_In1587027070 256) 0)) (.cse5 (= (mod ~z$w_buff0_used~0_In1587027070 256) 0)) (.cse0 (= |P1Thread1of1ForFork1_#t~ite30_Out1587027070| |P1Thread1of1ForFork1_#t~ite29_Out1587027070|)) (.cse1 (= 0 (mod ~weak$$choice2~0_In1587027070 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1587027070 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In1587027070 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite28_In1587027070| |P1Thread1of1ForFork1_#t~ite28_Out1587027070|) (or (and .cse0 .cse1 (or (and .cse2 .cse3) (and .cse4 .cse3) .cse5) (= ~z$r_buff1_thd2~0_In1587027070 |P1Thread1of1ForFork1_#t~ite29_Out1587027070|)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite29_In1587027070| |P1Thread1of1ForFork1_#t~ite29_Out1587027070|) (= |P1Thread1of1ForFork1_#t~ite30_Out1587027070| ~z$r_buff1_thd2~0_In1587027070)))) (let ((.cse6 (not .cse3))) (and (or (not .cse4) .cse6) (not .cse5) .cse0 .cse1 (= |P1Thread1of1ForFork1_#t~ite28_Out1587027070| |P1Thread1of1ForFork1_#t~ite29_Out1587027070|) (or .cse6 (not .cse2)) (= 0 |P1Thread1of1ForFork1_#t~ite28_Out1587027070|))))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In1587027070|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1587027070, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1587027070, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1587027070, ~weak$$choice2~0=~weak$$choice2~0_In1587027070, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1587027070, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_In1587027070|} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1587027070|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1587027070|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1587027070, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1587027070, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1587027070, ~weak$$choice2~0=~weak$$choice2~0_In1587027070, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1587027070, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out1587027070|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-18 21:11:04,298 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L777-->L781: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_17 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_17} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 21:11:04,300 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L743-->L743-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In441263931 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In441263931 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In441263931 |P0Thread1of1ForFork0_#t~ite5_Out441263931|)) (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out441263931|) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In441263931, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In441263931} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out441263931|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In441263931, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In441263931} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 21:11:04,302 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L744-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-1292879365 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd1~0_In-1292879365 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In-1292879365 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-1292879365 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out-1292879365| 0)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite6_Out-1292879365| ~z$w_buff1_used~0_In-1292879365)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1292879365, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1292879365, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1292879365, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1292879365} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1292879365|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1292879365, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1292879365, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1292879365, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1292879365} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 21:11:04,303 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L745-->L746: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In-357080492 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-357080492 256) 0))) (or (and (not .cse0) (= ~z$r_buff0_thd1~0_Out-357080492 0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd1~0_Out-357080492 ~z$r_buff0_thd1~0_In-357080492)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-357080492, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-357080492} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-357080492, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-357080492|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-357080492} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 21:11:04,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L746-->L746-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd1~0_In-614821463 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-614821463 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-614821463 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd1~0_In-614821463 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-614821463| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd1~0_In-614821463 |P0Thread1of1ForFork0_#t~ite8_Out-614821463|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-614821463, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-614821463, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-614821463, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-614821463} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-614821463, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-614821463|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-614821463, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-614821463, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-614821463} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 21:11:04,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L781-2-->L781-5: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd2~0_In-461885700 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-461885700 256))) (.cse2 (= |P1Thread1of1ForFork1_#t~ite33_Out-461885700| |P1Thread1of1ForFork1_#t~ite32_Out-461885700|))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In-461885700 |P1Thread1of1ForFork1_#t~ite32_Out-461885700|) .cse2) (and (or .cse1 .cse0) (= ~z~0_In-461885700 |P1Thread1of1ForFork1_#t~ite32_Out-461885700|) .cse2))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-461885700, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-461885700, ~z$w_buff1~0=~z$w_buff1~0_In-461885700, ~z~0=~z~0_In-461885700} OutVars{~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-461885700, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-461885700, ~z$w_buff1~0=~z$w_buff1~0_In-461885700, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-461885700|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out-461885700|, ~z~0=~z~0_In-461885700} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-18 21:11:04,307 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L782-->L782-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In732417283 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In732417283 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out732417283|) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out732417283| ~z$w_buff0_used~0_In732417283)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In732417283, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In732417283} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In732417283, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out732417283|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In732417283} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 21:11:04,308 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L783-->L783-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-2141999549 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-2141999549 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-2141999549 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd2~0_In-2141999549 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite35_Out-2141999549| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork1_#t~ite35_Out-2141999549| ~z$w_buff1_used~0_In-2141999549) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2141999549, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2141999549, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2141999549, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2141999549} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2141999549, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2141999549, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2141999549, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-2141999549|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2141999549} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 21:11:04,309 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L784-->L784-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1310697039 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1310697039 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite36_Out1310697039| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd2~0_In1310697039 |P1Thread1of1ForFork1_#t~ite36_Out1310697039|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1310697039, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1310697039} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1310697039, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1310697039, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1310697039|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 21:11:04,310 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L785-->L785-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In-590329606 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-590329606 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-590329606 256))) (.cse1 (= (mod ~z$r_buff1_thd2~0_In-590329606 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite37_Out-590329606| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite37_Out-590329606| ~z$r_buff1_thd2~0_In-590329606) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-590329606, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-590329606, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-590329606, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-590329606} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-590329606, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-590329606, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-590329606, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-590329606, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-590329606|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 21:11:04,310 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L785-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_40 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_40, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 21:11:04,310 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L746-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~z$r_buff1_thd1~0_13) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_13, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 21:11:04,311 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-1-->L812: Formula: (and (= v_~__unbuffered_cnt~0_8 2) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-18 21:11:04,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L812-2-->L812-4: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-1160421239 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-1160421239 256) 0))) (or (and (= ~z$w_buff1~0_In-1160421239 |ULTIMATE.start_main_#t~ite40_Out-1160421239|) (not .cse0) (not .cse1)) (and (= ~z~0_In-1160421239 |ULTIMATE.start_main_#t~ite40_Out-1160421239|) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1160421239, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1160421239, ~z$w_buff1~0=~z$w_buff1~0_In-1160421239, ~z~0=~z~0_In-1160421239} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1160421239|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1160421239, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1160421239, ~z$w_buff1~0=~z$w_buff1~0_In-1160421239, ~z~0=~z~0_In-1160421239} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 21:11:04,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L812-4-->L813: Formula: (= v_~z~0_15 |v_ULTIMATE.start_main_#t~ite40_7|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_6|, ~z~0=v_~z~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~z~0] because there is no mapped edge [2019-12-18 21:11:04,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L813-->L813-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In466925225 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In466925225 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out466925225| 0)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In466925225 |ULTIMATE.start_main_#t~ite42_Out466925225|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In466925225, ~z$w_buff0_used~0=~z$w_buff0_used~0_In466925225} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In466925225, ~z$w_buff0_used~0=~z$w_buff0_used~0_In466925225, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out466925225|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 21:11:04,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L814-->L814-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd0~0_In1581560590 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1581560590 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1581560590 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1581560590 256)))) (or (and (= ~z$w_buff1_used~0_In1581560590 |ULTIMATE.start_main_#t~ite43_Out1581560590|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite43_Out1581560590|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1581560590, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1581560590, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1581560590, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1581560590} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1581560590, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1581560590, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1581560590, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1581560590, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1581560590|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 21:11:04,314 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L815-->L815-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1880090472 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1880090472 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite44_Out-1880090472|) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In-1880090472 |ULTIMATE.start_main_#t~ite44_Out-1880090472|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1880090472, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1880090472} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1880090472, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1880090472, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1880090472|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 21:11:04,315 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L816-->L816-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-826362251 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-826362251 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-826362251 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-826362251 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite45_Out-826362251|)) (and (= ~z$r_buff1_thd0~0_In-826362251 |ULTIMATE.start_main_#t~ite45_Out-826362251|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-826362251, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-826362251, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-826362251, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-826362251} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-826362251, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-826362251, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-826362251, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-826362251, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-826362251|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 21:11:04,315 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L816-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p0_EAX~0_8 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= 1 v_~__unbuffered_p1_EAX~0_8) (= 0 v_~__unbuffered_p1_EBX~0_8) (= v_~main$tmp_guard1~0_7 0) (= |v_ULTIMATE.start_main_#t~ite45_12| v_~z$r_buff1_thd0~0_14) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_12|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_14, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 21:11:04,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:11:04 BasicIcfg [2019-12-18 21:11:04,452 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:11:04,455 INFO L168 Benchmark]: Toolchain (without parser) took 11091.14 ms. Allocated memory was 144.7 MB in the beginning and 383.8 MB in the end (delta: 239.1 MB). Free memory was 101.0 MB in the beginning and 123.1 MB in the end (delta: -22.1 MB). Peak memory consumption was 217.0 MB. Max. memory is 7.1 GB. [2019-12-18 21:11:04,457 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 144.7 MB. Free memory is still 120.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 21:11:04,458 INFO L168 Benchmark]: CACSL2BoogieTranslator took 753.06 ms. Allocated memory was 144.7 MB in the beginning and 204.5 MB in the end (delta: 59.8 MB). Free memory was 100.6 MB in the beginning and 159.0 MB in the end (delta: -58.5 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. [2019-12-18 21:11:04,459 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.44 ms. Allocated memory is still 204.5 MB. Free memory was 159.0 MB in the beginning and 156.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-18 21:11:04,464 INFO L168 Benchmark]: Boogie Preprocessor took 38.28 ms. Allocated memory is still 204.5 MB. Free memory was 156.1 MB in the beginning and 154.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 21:11:04,465 INFO L168 Benchmark]: RCFGBuilder took 758.69 ms. Allocated memory is still 204.5 MB. Free memory was 154.2 MB in the beginning and 109.0 MB in the end (delta: 45.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 7.1 GB. [2019-12-18 21:11:04,465 INFO L168 Benchmark]: TraceAbstraction took 9475.53 ms. Allocated memory was 204.5 MB in the beginning and 383.8 MB in the end (delta: 179.3 MB). Free memory was 109.0 MB in the beginning and 123.1 MB in the end (delta: -14.1 MB). Peak memory consumption was 165.2 MB. Max. memory is 7.1 GB. [2019-12-18 21:11:04,474 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 144.7 MB. Free memory is still 120.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 753.06 ms. Allocated memory was 144.7 MB in the beginning and 204.5 MB in the end (delta: 59.8 MB). Free memory was 100.6 MB in the beginning and 159.0 MB in the end (delta: -58.5 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.44 ms. Allocated memory is still 204.5 MB. Free memory was 159.0 MB in the beginning and 156.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.28 ms. Allocated memory is still 204.5 MB. Free memory was 156.1 MB in the beginning and 154.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 758.69 ms. Allocated memory is still 204.5 MB. Free memory was 154.2 MB in the beginning and 109.0 MB in the end (delta: 45.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9475.53 ms. Allocated memory was 204.5 MB in the beginning and 383.8 MB in the end (delta: 179.3 MB). Free memory was 109.0 MB in the beginning and 123.1 MB in the end (delta: -14.1 MB). Peak memory consumption was 165.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.8s, 149 ProgramPointsBefore, 74 ProgramPointsAfterwards, 183 TransitionsBefore, 83 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 29 ConcurrentYvCompositions, 28 ChoiceCompositions, 4346 VarBasedMoverChecksPositive, 182 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 49761 CheckedPairsTotal, 105 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L804] FCALL, FORK 0 pthread_create(&t897, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L806] FCALL, FORK 0 pthread_create(&t898, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L733] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L734] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L735] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L736] 1 z$r_buff0_thd1 = (_Bool)1 [L739] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 2 x = 1 [L759] 2 y = 1 [L762] 2 __unbuffered_p1_EAX = y [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 z$flush_delayed = weak$$choice2 [L768] 2 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __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=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __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=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L770] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __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 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L771] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __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 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L772] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __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 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L773] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L775] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __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=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L743] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L744] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __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=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L781] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L782] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L783] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L784] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L812] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __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=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L813] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L814] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L815] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 143 locations, 2 error locations. Result: UNSAFE, OverallTime: 9.1s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1347 SDtfs, 881 SDslu, 2394 SDs, 0 SdLazy, 951 SolverSat, 38 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 19 SyntacticMatches, 6 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8010occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 12 MinimizatonAttempts, 2699 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 392 NumberOfCodeBlocks, 392 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 327 ConstructedInterpolants, 0 QuantifiedInterpolants, 57359 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...