/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/rfi004_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 07:08:35,078 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 07:08:35,080 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 07:08:35,092 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 07:08:35,093 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 07:08:35,094 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 07:08:35,095 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 07:08:35,097 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 07:08:35,100 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 07:08:35,107 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 07:08:35,108 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 07:08:35,109 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 07:08:35,109 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 07:08:35,110 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 07:08:35,111 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 07:08:35,112 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 07:08:35,113 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 07:08:35,114 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 07:08:35,116 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 07:08:35,118 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 07:08:35,119 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 07:08:35,120 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 07:08:35,121 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 07:08:35,122 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 07:08:35,126 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 07:08:35,126 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 07:08:35,127 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 07:08:35,127 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 07:08:35,130 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 07:08:35,131 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 07:08:35,131 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 07:08:35,132 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 07:08:35,135 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 07:08:35,135 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 07:08:35,137 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 07:08:35,138 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 07:08:35,138 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 07:08:35,139 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 07:08:35,142 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 07:08:35,143 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 07:08:35,146 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 07:08:35,147 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-27 07:08:35,170 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 07:08:35,171 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 07:08:35,172 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 07:08:35,173 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 07:08:35,173 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 07:08:35,173 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 07:08:35,174 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 07:08:35,174 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 07:08:35,174 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 07:08:35,174 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 07:08:35,175 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 07:08:35,176 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 07:08:35,176 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 07:08:35,176 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 07:08:35,177 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 07:08:35,177 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 07:08:35,177 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 07:08:35,177 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 07:08:35,177 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 07:08:35,178 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 07:08:35,178 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 07:08:35,178 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:08:35,178 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 07:08:35,179 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 07:08:35,179 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 07:08:35,179 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 07:08:35,179 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 07:08:35,179 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 07:08:35,180 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 07:08:35,180 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 07:08:35,492 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 07:08:35,511 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 07:08:35,515 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 07:08:35,517 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 07:08:35,517 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 07:08:35,518 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi004_rmo.opt.i [2019-12-27 07:08:35,581 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09304d27a/97ea1c5a3bb6426bb3ecc12dea7c6dd4/FLAG076a2d4dc [2019-12-27 07:08:36,124 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 07:08:36,125 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi004_rmo.opt.i [2019-12-27 07:08:36,148 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09304d27a/97ea1c5a3bb6426bb3ecc12dea7c6dd4/FLAG076a2d4dc [2019-12-27 07:08:36,435 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09304d27a/97ea1c5a3bb6426bb3ecc12dea7c6dd4 [2019-12-27 07:08:36,443 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 07:08:36,445 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 07:08:36,446 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 07:08:36,448 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 07:08:36,452 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 07:08:36,453 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:08:36" (1/1) ... [2019-12-27 07:08:36,456 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76f1d1d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:36, skipping insertion in model container [2019-12-27 07:08:36,457 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:08:36" (1/1) ... [2019-12-27 07:08:36,465 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 07:08:36,516 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 07:08:37,093 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:08:37,111 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 07:08:37,200 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:08:37,274 INFO L208 MainTranslator]: Completed translation [2019-12-27 07:08:37,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:37 WrapperNode [2019-12-27 07:08:37,275 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 07:08:37,276 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 07:08:37,276 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 07:08:37,276 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 07:08:37,285 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:37" (1/1) ... [2019-12-27 07:08:37,304 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:37" (1/1) ... [2019-12-27 07:08:37,336 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 07:08:37,337 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 07:08:37,337 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 07:08:37,337 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 07:08:37,346 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:37" (1/1) ... [2019-12-27 07:08:37,346 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:37" (1/1) ... [2019-12-27 07:08:37,350 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:37" (1/1) ... [2019-12-27 07:08:37,351 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:37" (1/1) ... [2019-12-27 07:08:37,360 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:37" (1/1) ... [2019-12-27 07:08:37,364 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:37" (1/1) ... [2019-12-27 07:08:37,368 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:37" (1/1) ... [2019-12-27 07:08:37,374 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 07:08:37,374 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 07:08:37,375 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 07:08:37,375 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 07:08:37,376 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:37" (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-27 07:08:37,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 07:08:37,450 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 07:08:37,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 07:08:37,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 07:08:37,451 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 07:08:37,451 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 07:08:37,451 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 07:08:37,451 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 07:08:37,452 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 07:08:37,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 07:08:37,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 07:08:37,454 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 07:08:38,121 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 07:08:38,122 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 07:08:38,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:08:38 BoogieIcfgContainer [2019-12-27 07:08:38,124 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 07:08:38,125 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 07:08:38,125 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 07:08:38,129 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 07:08:38,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:08:36" (1/3) ... [2019-12-27 07:08:38,131 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c7650ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:08:38, skipping insertion in model container [2019-12-27 07:08:38,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:37" (2/3) ... [2019-12-27 07:08:38,132 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c7650ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:08:38, skipping insertion in model container [2019-12-27 07:08:38,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:08:38" (3/3) ... [2019-12-27 07:08:38,133 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi004_rmo.opt.i [2019-12-27 07:08:38,141 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 07:08:38,141 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 07:08:38,148 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 07:08:38,149 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 07:08:38,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,191 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,192 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,198 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,198 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,199 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,199 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,199 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,220 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,220 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,220 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,220 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,220 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,221 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,230 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,231 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,231 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,231 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,232 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,256 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,257 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,257 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,264 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,265 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,266 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:38,290 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 07:08:38,314 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 07:08:38,315 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 07:08:38,315 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 07:08:38,316 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 07:08:38,317 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 07:08:38,317 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 07:08:38,318 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 07:08:38,318 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 07:08:38,359 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 165 transitions [2019-12-27 07:08:38,361 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 137 places, 165 transitions [2019-12-27 07:08:38,442 INFO L132 PetriNetUnfolder]: 35/163 cut-off events. [2019-12-27 07:08:38,442 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:08:38,457 INFO L76 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 163 events. 35/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 339 event pairs. 0/126 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-27 07:08:38,474 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 137 places, 165 transitions [2019-12-27 07:08:38,517 INFO L132 PetriNetUnfolder]: 35/163 cut-off events. [2019-12-27 07:08:38,517 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:08:38,523 INFO L76 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 163 events. 35/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 339 event pairs. 0/126 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-27 07:08:38,535 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-12-27 07:08:38,536 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 07:08:41,297 WARN L192 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 07:08:41,423 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 07:08:41,463 INFO L206 etLargeBlockEncoding]: Checked pairs total: 41237 [2019-12-27 07:08:41,463 INFO L214 etLargeBlockEncoding]: Total number of compositions: 97 [2019-12-27 07:08:41,467 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 69 places, 81 transitions [2019-12-27 07:08:41,817 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 7504 states. [2019-12-27 07:08:41,819 INFO L276 IsEmpty]: Start isEmpty. Operand 7504 states. [2019-12-27 07:08:41,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 07:08:41,826 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:41,826 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 07:08:41,827 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:41,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:41,833 INFO L82 PathProgramCache]: Analyzing trace with hash 676926397, now seen corresponding path program 1 times [2019-12-27 07:08:41,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:41,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751409356] [2019-12-27 07:08:41,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:41,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:08:42,087 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-27 07:08:42,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751409356] [2019-12-27 07:08:42,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:08:42,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:08:42,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517139067] [2019-12-27 07:08:42,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:08:42,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:08:42,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:08:42,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:08:42,112 INFO L87 Difference]: Start difference. First operand 7504 states. Second operand 3 states. [2019-12-27 07:08:42,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:08:42,379 INFO L93 Difference]: Finished difference Result 6863 states and 23135 transitions. [2019-12-27 07:08:42,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:08:42,381 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 07:08:42,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:08:42,454 INFO L225 Difference]: With dead ends: 6863 [2019-12-27 07:08:42,454 INFO L226 Difference]: Without dead ends: 6460 [2019-12-27 07:08:42,456 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-27 07:08:42,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6460 states. [2019-12-27 07:08:42,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6460 to 6460. [2019-12-27 07:08:42,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6460 states. [2019-12-27 07:08:42,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6460 states to 6460 states and 21739 transitions. [2019-12-27 07:08:42,942 INFO L78 Accepts]: Start accepts. Automaton has 6460 states and 21739 transitions. Word has length 5 [2019-12-27 07:08:42,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:08:42,943 INFO L462 AbstractCegarLoop]: Abstraction has 6460 states and 21739 transitions. [2019-12-27 07:08:42,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:08:42,943 INFO L276 IsEmpty]: Start isEmpty. Operand 6460 states and 21739 transitions. [2019-12-27 07:08:42,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 07:08:42,947 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:42,947 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:08:42,947 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:42,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:42,948 INFO L82 PathProgramCache]: Analyzing trace with hash 982245482, now seen corresponding path program 1 times [2019-12-27 07:08:42,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:42,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428132307] [2019-12-27 07:08:42,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:42,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:08:43,025 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-27 07:08:43,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428132307] [2019-12-27 07:08:43,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:08:43,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:08:43,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710874104] [2019-12-27 07:08:43,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:08:43,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:08:43,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:08:43,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:08:43,029 INFO L87 Difference]: Start difference. First operand 6460 states and 21739 transitions. Second operand 4 states. [2019-12-27 07:08:43,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:08:43,374 INFO L93 Difference]: Finished difference Result 9760 states and 31457 transitions. [2019-12-27 07:08:43,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:08:43,375 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 07:08:43,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:08:43,469 INFO L225 Difference]: With dead ends: 9760 [2019-12-27 07:08:43,469 INFO L226 Difference]: Without dead ends: 9746 [2019-12-27 07:08:43,470 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-27 07:08:43,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9746 states. [2019-12-27 07:08:43,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9746 to 8836. [2019-12-27 07:08:43,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8836 states. [2019-12-27 07:08:43,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8836 states to 8836 states and 28954 transitions. [2019-12-27 07:08:43,963 INFO L78 Accepts]: Start accepts. Automaton has 8836 states and 28954 transitions. Word has length 11 [2019-12-27 07:08:43,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:08:43,964 INFO L462 AbstractCegarLoop]: Abstraction has 8836 states and 28954 transitions. [2019-12-27 07:08:43,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:08:43,964 INFO L276 IsEmpty]: Start isEmpty. Operand 8836 states and 28954 transitions. [2019-12-27 07:08:43,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 07:08:43,969 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:43,969 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:08:43,969 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:43,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:43,970 INFO L82 PathProgramCache]: Analyzing trace with hash -2066710524, now seen corresponding path program 1 times [2019-12-27 07:08:43,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:43,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427028207] [2019-12-27 07:08:43,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:43,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:08:44,030 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-27 07:08:44,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427028207] [2019-12-27 07:08:44,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:08:44,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:08:44,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254510923] [2019-12-27 07:08:44,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:08:44,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:08:44,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:08:44,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:08:44,034 INFO L87 Difference]: Start difference. First operand 8836 states and 28954 transitions. Second operand 3 states. [2019-12-27 07:08:44,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:08:44,234 INFO L93 Difference]: Finished difference Result 12018 states and 39361 transitions. [2019-12-27 07:08:44,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:08:44,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-27 07:08:44,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:08:44,305 INFO L225 Difference]: With dead ends: 12018 [2019-12-27 07:08:44,306 INFO L226 Difference]: Without dead ends: 12018 [2019-12-27 07:08:44,306 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-27 07:08:44,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12018 states. [2019-12-27 07:08:45,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12018 to 11066. [2019-12-27 07:08:45,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11066 states. [2019-12-27 07:08:45,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11066 states to 11066 states and 36521 transitions. [2019-12-27 07:08:45,424 INFO L78 Accepts]: Start accepts. Automaton has 11066 states and 36521 transitions. Word has length 14 [2019-12-27 07:08:45,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:08:45,427 INFO L462 AbstractCegarLoop]: Abstraction has 11066 states and 36521 transitions. [2019-12-27 07:08:45,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:08:45,428 INFO L276 IsEmpty]: Start isEmpty. Operand 11066 states and 36521 transitions. [2019-12-27 07:08:45,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 07:08:45,433 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:45,433 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:08:45,433 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:45,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:45,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1979542058, now seen corresponding path program 1 times [2019-12-27 07:08:45,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:45,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114679757] [2019-12-27 07:08:45,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:45,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:08:45,584 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-27 07:08:45,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114679757] [2019-12-27 07:08:45,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:08:45,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:08:45,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918071802] [2019-12-27 07:08:45,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:08:45,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:08:45,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:08:45,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:08:45,592 INFO L87 Difference]: Start difference. First operand 11066 states and 36521 transitions. Second operand 4 states. [2019-12-27 07:08:45,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:08:45,875 INFO L93 Difference]: Finished difference Result 13296 states and 42892 transitions. [2019-12-27 07:08:45,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:08:45,876 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 07:08:45,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:08:45,922 INFO L225 Difference]: With dead ends: 13296 [2019-12-27 07:08:45,922 INFO L226 Difference]: Without dead ends: 13285 [2019-12-27 07:08:45,923 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-27 07:08:46,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13285 states. [2019-12-27 07:08:46,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13285 to 12030. [2019-12-27 07:08:46,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12030 states. [2019-12-27 07:08:46,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12030 states to 12030 states and 39340 transitions. [2019-12-27 07:08:46,447 INFO L78 Accepts]: Start accepts. Automaton has 12030 states and 39340 transitions. Word has length 14 [2019-12-27 07:08:46,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:08:46,448 INFO L462 AbstractCegarLoop]: Abstraction has 12030 states and 39340 transitions. [2019-12-27 07:08:46,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:08:46,448 INFO L276 IsEmpty]: Start isEmpty. Operand 12030 states and 39340 transitions. [2019-12-27 07:08:46,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 07:08:46,451 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:46,451 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:08:46,451 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:46,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:46,452 INFO L82 PathProgramCache]: Analyzing trace with hash 952302064, now seen corresponding path program 1 times [2019-12-27 07:08:46,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:46,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369802478] [2019-12-27 07:08:46,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:46,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:08:46,512 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-27 07:08:46,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369802478] [2019-12-27 07:08:46,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:08:46,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:08:46,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294048739] [2019-12-27 07:08:46,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:08:46,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:08:46,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:08:46,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:08:46,515 INFO L87 Difference]: Start difference. First operand 12030 states and 39340 transitions. Second operand 4 states. [2019-12-27 07:08:46,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:08:46,726 INFO L93 Difference]: Finished difference Result 14351 states and 46280 transitions. [2019-12-27 07:08:46,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:08:46,728 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 07:08:46,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:08:46,781 INFO L225 Difference]: With dead ends: 14351 [2019-12-27 07:08:46,782 INFO L226 Difference]: Without dead ends: 14338 [2019-12-27 07:08:46,782 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-27 07:08:46,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14338 states. [2019-12-27 07:08:47,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14338 to 12371. [2019-12-27 07:08:47,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12371 states. [2019-12-27 07:08:47,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12371 states to 12371 states and 40477 transitions. [2019-12-27 07:08:47,247 INFO L78 Accepts]: Start accepts. Automaton has 12371 states and 40477 transitions. Word has length 14 [2019-12-27 07:08:47,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:08:47,248 INFO L462 AbstractCegarLoop]: Abstraction has 12371 states and 40477 transitions. [2019-12-27 07:08:47,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:08:47,248 INFO L276 IsEmpty]: Start isEmpty. Operand 12371 states and 40477 transitions. [2019-12-27 07:08:47,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 07:08:47,254 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:47,254 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:08:47,255 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:47,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:47,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1929456170, now seen corresponding path program 1 times [2019-12-27 07:08:47,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:47,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632127593] [2019-12-27 07:08:47,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:47,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:08:47,299 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-27 07:08:47,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632127593] [2019-12-27 07:08:47,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:08:47,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:08:47,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988081515] [2019-12-27 07:08:47,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:08:47,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:08:47,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:08:47,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:08:47,401 INFO L87 Difference]: Start difference. First operand 12371 states and 40477 transitions. Second operand 3 states. [2019-12-27 07:08:47,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:08:47,458 INFO L93 Difference]: Finished difference Result 12224 states and 39993 transitions. [2019-12-27 07:08:47,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:08:47,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 07:08:47,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:08:47,497 INFO L225 Difference]: With dead ends: 12224 [2019-12-27 07:08:47,497 INFO L226 Difference]: Without dead ends: 12224 [2019-12-27 07:08:47,498 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-27 07:08:47,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12224 states. [2019-12-27 07:08:47,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12224 to 12224. [2019-12-27 07:08:47,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12224 states. [2019-12-27 07:08:47,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12224 states to 12224 states and 39993 transitions. [2019-12-27 07:08:47,832 INFO L78 Accepts]: Start accepts. Automaton has 12224 states and 39993 transitions. Word has length 16 [2019-12-27 07:08:47,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:08:47,832 INFO L462 AbstractCegarLoop]: Abstraction has 12224 states and 39993 transitions. [2019-12-27 07:08:47,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:08:47,833 INFO L276 IsEmpty]: Start isEmpty. Operand 12224 states and 39993 transitions. [2019-12-27 07:08:47,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 07:08:47,839 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:47,839 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:08:47,839 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:47,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:47,840 INFO L82 PathProgramCache]: Analyzing trace with hash 324203655, now seen corresponding path program 1 times [2019-12-27 07:08:47,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:47,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585571479] [2019-12-27 07:08:47,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:47,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:08:47,914 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-27 07:08:47,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585571479] [2019-12-27 07:08:47,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:08:47,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:08:47,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231454304] [2019-12-27 07:08:47,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:08:47,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:08:47,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:08:47,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:08:47,917 INFO L87 Difference]: Start difference. First operand 12224 states and 39993 transitions. Second operand 4 states. [2019-12-27 07:08:47,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:08:47,955 INFO L93 Difference]: Finished difference Result 2579 states and 6836 transitions. [2019-12-27 07:08:47,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:08:47,955 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-27 07:08:47,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:08:47,961 INFO L225 Difference]: With dead ends: 2579 [2019-12-27 07:08:47,962 INFO L226 Difference]: Without dead ends: 1835 [2019-12-27 07:08:47,962 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-27 07:08:47,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2019-12-27 07:08:47,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1835. [2019-12-27 07:08:47,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1835 states. [2019-12-27 07:08:47,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1835 states to 1835 states and 4472 transitions. [2019-12-27 07:08:47,994 INFO L78 Accepts]: Start accepts. Automaton has 1835 states and 4472 transitions. Word has length 17 [2019-12-27 07:08:47,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:08:47,994 INFO L462 AbstractCegarLoop]: Abstraction has 1835 states and 4472 transitions. [2019-12-27 07:08:47,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:08:47,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1835 states and 4472 transitions. [2019-12-27 07:08:47,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 07:08:47,997 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:47,997 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-27 07:08:47,998 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:47,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:47,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1556475985, now seen corresponding path program 1 times [2019-12-27 07:08:47,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:47,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152424576] [2019-12-27 07:08:47,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:48,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:08:48,037 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-27 07:08:48,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152424576] [2019-12-27 07:08:48,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:08:48,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:08:48,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735087814] [2019-12-27 07:08:48,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:08:48,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:08:48,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:08:48,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:08:48,039 INFO L87 Difference]: Start difference. First operand 1835 states and 4472 transitions. Second operand 3 states. [2019-12-27 07:08:48,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:08:48,081 INFO L93 Difference]: Finished difference Result 2395 states and 5562 transitions. [2019-12-27 07:08:48,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:08:48,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-27 07:08:48,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:08:48,087 INFO L225 Difference]: With dead ends: 2395 [2019-12-27 07:08:48,087 INFO L226 Difference]: Without dead ends: 2395 [2019-12-27 07:08:48,088 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-27 07:08:48,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2395 states. [2019-12-27 07:08:48,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2395 to 1775. [2019-12-27 07:08:48,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1775 states. [2019-12-27 07:08:48,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 1775 states and 4059 transitions. [2019-12-27 07:08:48,119 INFO L78 Accepts]: Start accepts. Automaton has 1775 states and 4059 transitions. Word has length 26 [2019-12-27 07:08:48,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:08:48,119 INFO L462 AbstractCegarLoop]: Abstraction has 1775 states and 4059 transitions. [2019-12-27 07:08:48,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:08:48,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 4059 transitions. [2019-12-27 07:08:48,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 07:08:48,122 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:48,122 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-27 07:08:48,123 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:48,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:48,123 INFO L82 PathProgramCache]: Analyzing trace with hash 118725068, now seen corresponding path program 1 times [2019-12-27 07:08:48,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:48,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778883529] [2019-12-27 07:08:48,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:48,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:08:48,182 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-27 07:08:48,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778883529] [2019-12-27 07:08:48,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:08:48,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:08:48,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810794558] [2019-12-27 07:08:48,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:08:48,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:08:48,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:08:48,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:08:48,184 INFO L87 Difference]: Start difference. First operand 1775 states and 4059 transitions. Second operand 5 states. [2019-12-27 07:08:48,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:08:48,411 INFO L93 Difference]: Finished difference Result 2308 states and 5281 transitions. [2019-12-27 07:08:48,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 07:08:48,411 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 07:08:48,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:08:48,415 INFO L225 Difference]: With dead ends: 2308 [2019-12-27 07:08:48,415 INFO L226 Difference]: Without dead ends: 2306 [2019-12-27 07:08:48,416 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-27 07:08:48,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2306 states. [2019-12-27 07:08:48,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2306 to 1867. [2019-12-27 07:08:48,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1867 states. [2019-12-27 07:08:48,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1867 states to 1867 states and 4281 transitions. [2019-12-27 07:08:48,446 INFO L78 Accepts]: Start accepts. Automaton has 1867 states and 4281 transitions. Word has length 26 [2019-12-27 07:08:48,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:08:48,446 INFO L462 AbstractCegarLoop]: Abstraction has 1867 states and 4281 transitions. [2019-12-27 07:08:48,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:08:48,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1867 states and 4281 transitions. [2019-12-27 07:08:48,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 07:08:48,449 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:48,449 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-27 07:08:48,449 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:48,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:48,450 INFO L82 PathProgramCache]: Analyzing trace with hash -895166994, now seen corresponding path program 1 times [2019-12-27 07:08:48,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:48,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469650325] [2019-12-27 07:08:48,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:48,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:08:48,502 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-27 07:08:48,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469650325] [2019-12-27 07:08:48,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:08:48,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:08:48,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632205323] [2019-12-27 07:08:48,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:08:48,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:08:48,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:08:48,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:08:48,504 INFO L87 Difference]: Start difference. First operand 1867 states and 4281 transitions. Second operand 3 states. [2019-12-27 07:08:48,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:08:48,520 INFO L93 Difference]: Finished difference Result 1799 states and 4059 transitions. [2019-12-27 07:08:48,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:08:48,521 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-27 07:08:48,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:08:48,524 INFO L225 Difference]: With dead ends: 1799 [2019-12-27 07:08:48,524 INFO L226 Difference]: Without dead ends: 1799 [2019-12-27 07:08:48,524 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-27 07:08:48,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1799 states. [2019-12-27 07:08:48,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1799 to 1647. [2019-12-27 07:08:48,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1647 states. [2019-12-27 07:08:48,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1647 states and 3725 transitions. [2019-12-27 07:08:48,549 INFO L78 Accepts]: Start accepts. Automaton has 1647 states and 3725 transitions. Word has length 26 [2019-12-27 07:08:48,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:08:48,549 INFO L462 AbstractCegarLoop]: Abstraction has 1647 states and 3725 transitions. [2019-12-27 07:08:48,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:08:48,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 3725 transitions. [2019-12-27 07:08:48,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 07:08:48,552 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:48,552 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:08:48,552 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:48,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:48,553 INFO L82 PathProgramCache]: Analyzing trace with hash -945954291, now seen corresponding path program 1 times [2019-12-27 07:08:48,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:48,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826839491] [2019-12-27 07:08:48,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:48,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:08:48,619 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-27 07:08:48,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826839491] [2019-12-27 07:08:48,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:08:48,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:08:48,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982016793] [2019-12-27 07:08:48,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:08:48,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:08:48,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:08:48,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:08:48,622 INFO L87 Difference]: Start difference. First operand 1647 states and 3725 transitions. Second operand 5 states. [2019-12-27 07:08:48,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:08:48,799 INFO L93 Difference]: Finished difference Result 2085 states and 4728 transitions. [2019-12-27 07:08:48,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 07:08:48,799 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 07:08:48,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:08:48,803 INFO L225 Difference]: With dead ends: 2085 [2019-12-27 07:08:48,803 INFO L226 Difference]: Without dead ends: 2083 [2019-12-27 07:08:48,804 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-27 07:08:48,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2083 states. [2019-12-27 07:08:48,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2083 to 1574. [2019-12-27 07:08:48,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2019-12-27 07:08:48,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 3550 transitions. [2019-12-27 07:08:48,830 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 3550 transitions. Word has length 27 [2019-12-27 07:08:48,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:08:48,831 INFO L462 AbstractCegarLoop]: Abstraction has 1574 states and 3550 transitions. [2019-12-27 07:08:48,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:08:48,831 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 3550 transitions. [2019-12-27 07:08:48,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 07:08:48,835 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:48,835 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:08:48,835 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:48,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:48,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1929035231, now seen corresponding path program 1 times [2019-12-27 07:08:48,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:48,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961283592] [2019-12-27 07:08:48,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:48,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:08:48,936 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-27 07:08:48,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961283592] [2019-12-27 07:08:48,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:08:48,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:08:48,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314229517] [2019-12-27 07:08:48,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:08:48,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:08:48,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:08:48,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:08:48,939 INFO L87 Difference]: Start difference. First operand 1574 states and 3550 transitions. Second operand 5 states. [2019-12-27 07:08:48,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:08:48,981 INFO L93 Difference]: Finished difference Result 781 states and 1674 transitions. [2019-12-27 07:08:48,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:08:48,982 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 07:08:48,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:08:48,983 INFO L225 Difference]: With dead ends: 781 [2019-12-27 07:08:48,983 INFO L226 Difference]: Without dead ends: 707 [2019-12-27 07:08:48,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:08:48,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2019-12-27 07:08:48,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 707. [2019-12-27 07:08:48,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 707 states. [2019-12-27 07:08:48,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 1503 transitions. [2019-12-27 07:08:48,993 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 1503 transitions. Word has length 27 [2019-12-27 07:08:48,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:08:48,993 INFO L462 AbstractCegarLoop]: Abstraction has 707 states and 1503 transitions. [2019-12-27 07:08:48,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:08:48,994 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 1503 transitions. [2019-12-27 07:08:48,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 07:08:48,995 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:48,995 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] [2019-12-27 07:08:48,996 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:48,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:48,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1133197983, now seen corresponding path program 1 times [2019-12-27 07:08:48,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:48,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594752894] [2019-12-27 07:08:48,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:49,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:08:49,067 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-27 07:08:49,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594752894] [2019-12-27 07:08:49,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:08:49,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:08:49,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139593136] [2019-12-27 07:08:49,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:08:49,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:08:49,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:08:49,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:08:49,070 INFO L87 Difference]: Start difference. First operand 707 states and 1503 transitions. Second operand 4 states. [2019-12-27 07:08:49,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:08:49,093 INFO L93 Difference]: Finished difference Result 1173 states and 2520 transitions. [2019-12-27 07:08:49,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:08:49,093 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-27 07:08:49,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:08:49,095 INFO L225 Difference]: With dead ends: 1173 [2019-12-27 07:08:49,095 INFO L226 Difference]: Without dead ends: 486 [2019-12-27 07:08:49,095 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-27 07:08:49,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2019-12-27 07:08:49,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 486. [2019-12-27 07:08:49,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 486 states. [2019-12-27 07:08:49,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 1050 transitions. [2019-12-27 07:08:49,104 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 1050 transitions. Word has length 42 [2019-12-27 07:08:49,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:08:49,105 INFO L462 AbstractCegarLoop]: Abstraction has 486 states and 1050 transitions. [2019-12-27 07:08:49,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:08:49,105 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 1050 transitions. [2019-12-27 07:08:49,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 07:08:49,107 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:49,107 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] [2019-12-27 07:08:49,107 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:49,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:49,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1118913551, now seen corresponding path program 2 times [2019-12-27 07:08:49,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:49,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086433568] [2019-12-27 07:08:49,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:49,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:08:49,235 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-27 07:08:49,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086433568] [2019-12-27 07:08:49,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:08:49,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:08:49,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143710007] [2019-12-27 07:08:49,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:08:49,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:08:49,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:08:49,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:08:49,238 INFO L87 Difference]: Start difference. First operand 486 states and 1050 transitions. Second operand 7 states. [2019-12-27 07:08:49,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:08:49,456 INFO L93 Difference]: Finished difference Result 887 states and 1866 transitions. [2019-12-27 07:08:49,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 07:08:49,457 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2019-12-27 07:08:49,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:08:49,459 INFO L225 Difference]: With dead ends: 887 [2019-12-27 07:08:49,459 INFO L226 Difference]: Without dead ends: 593 [2019-12-27 07:08:49,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 07:08:49,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2019-12-27 07:08:49,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 527. [2019-12-27 07:08:49,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2019-12-27 07:08:49,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 1106 transitions. [2019-12-27 07:08:49,473 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 1106 transitions. Word has length 42 [2019-12-27 07:08:49,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:08:49,474 INFO L462 AbstractCegarLoop]: Abstraction has 527 states and 1106 transitions. [2019-12-27 07:08:49,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:08:49,474 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 1106 transitions. [2019-12-27 07:08:49,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 07:08:49,476 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:49,476 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:08:49,477 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:49,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:49,477 INFO L82 PathProgramCache]: Analyzing trace with hash -866328177, now seen corresponding path program 3 times [2019-12-27 07:08:49,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:49,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454934017] [2019-12-27 07:08:49,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:49,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:08:49,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:08:49,630 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 07:08:49,630 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 07:08:49,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] ULTIMATE.startENTRY-->L802: Formula: (let ((.cse0 (store |v_#valid_40| 0 0))) (and (= 0 v_~y$w_buff0~0_26) (= 0 v_~y$read_delayed_var~0.base_6) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~__unbuffered_p1_EAX~0_13) (= 0 v_~__unbuffered_p0_EAX~0_13) (< 0 |v_#StackHeapBarrier_12|) (= 0 v_~y$r_buff1_thd1~0_37) (= 0 v_~y$r_buff1_thd0~0_20) (= 0 v_~__unbuffered_cnt~0_15) (= |v_#NULL.offset_6| 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1659~0.base_19| 1) |v_#valid_38|) (= (select .cse0 |v_ULTIMATE.start_main_~#t1659~0.base_19|) 0) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1659~0.base_19|) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff0_thd2~0_26 0) (= 0 v_~y$w_buff0_used~0_93) (= v_~y$w_buff1_used~0_54 0) (= v_~x~0_10 0) (= 0 v_~y$w_buff1~0_21) (= v_~y$r_buff0_thd0~0_22 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1659~0.base_19| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1659~0.base_19|) |v_ULTIMATE.start_main_~#t1659~0.offset_17| 0)) |v_#memory_int_11|) (= 0 v_~y$flush_delayed~0_13) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= v_~y~0_22 0) (= 0 v_~weak$$choice0~0_7) (= v_~y$r_buff0_thd1~0_65 0) (= 0 v_~y$r_buff1_thd2~0_17) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1659~0.base_19| 4)) (= 0 v_~z~0_8) (= v_~y$mem_tmp~0_10 0) (= v_~__unbuffered_p1_EBX~0_13 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 |v_ULTIMATE.start_main_~#t1659~0.offset_17|) (= v_~main$tmp_guard1~0_12 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_93, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_7|, ULTIMATE.start_main_~#t1660~0.offset=|v_ULTIMATE.start_main_~#t1660~0.offset_17|, ULTIMATE.start_main_~#t1660~0.base=|v_ULTIMATE.start_main_~#t1660~0.base_22|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_37, ~y$mem_tmp~0=v_~y$mem_tmp~0_10, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_13, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_13, ~y$w_buff0~0=v_~y$w_buff0~0_26, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_65, ~y$flush_delayed~0=v_~y$flush_delayed~0_13, #length=|v_#length_13|, ~y~0=v_~y~0_22, ULTIMATE.start_main_~#t1659~0.offset=|v_ULTIMATE.start_main_~#t1659~0.offset_17|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_13, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_18|, ULTIMATE.start_main_~#t1659~0.base=|v_ULTIMATE.start_main_~#t1659~0.base_19|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_10|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_10|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_10|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_12|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_17, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ~y$w_buff1~0=v_~y$w_buff1~0_21, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_22, #valid=|v_#valid_38|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_26, #memory_int=|v_#memory_int_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~z~0=v_~z~0_8, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_20, ~x~0=v_~x~0_10, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_54} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t1660~0.offset, ULTIMATE.start_main_~#t1660~0.base, #NULL.offset, ~main$tmp_guard1~0, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t1659~0.offset, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t1659~0.base, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 07:08:49,635 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L802-1-->L804: Formula: (and (= (store |v_#valid_20| |v_ULTIMATE.start_main_~#t1660~0.base_9| 1) |v_#valid_19|) (= 0 (select |v_#valid_20| |v_ULTIMATE.start_main_~#t1660~0.base_9|)) (not (= 0 |v_ULTIMATE.start_main_~#t1660~0.base_9|)) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1660~0.base_9| 4) |v_#length_9|) (= |v_ULTIMATE.start_main_~#t1660~0.offset_8| 0) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1660~0.base_9|) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1660~0.base_9| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1660~0.base_9|) |v_ULTIMATE.start_main_~#t1660~0.offset_8| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_4|, ULTIMATE.start_main_~#t1660~0.offset=|v_ULTIMATE.start_main_~#t1660~0.offset_8|, ULTIMATE.start_main_~#t1660~0.base=|v_ULTIMATE.start_main_~#t1660~0.base_9|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1660~0.offset, ULTIMATE.start_main_~#t1660~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 07:08:49,636 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L5-->L779: Formula: (and (= v_~y$r_buff0_thd1~0_53 v_~y$r_buff1_thd1~0_28) (= v_~y$r_buff0_thd2~0_21 v_~y$r_buff1_thd2~0_11) (= v_~__unbuffered_p1_EBX~0_5 v_~x~0_5) (= v_~y$r_buff0_thd0~0_17 v_~y$r_buff1_thd0~0_11) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8)) (= v_~__unbuffered_p1_EAX~0_5 v_~z~0_4) (= 1 v_~z~0_4) (= v_~y$r_buff0_thd2~0_20 1)) InVars {P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_17, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_21, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_53, ~x~0=v_~x~0_5} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_11, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_28, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_5, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_5, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_17, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_20, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_53, ~z~0=v_~z~0_4, ~x~0=v_~x~0_5, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_11} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd2~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 07:08:49,640 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L780-->L780-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1609088724 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1609088724 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite28_Out1609088724| ~y$w_buff0_used~0_In1609088724) (or .cse0 .cse1)) (and (not .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out1609088724| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1609088724, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1609088724} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1609088724, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1609088724, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out1609088724|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 07:08:49,640 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L781-->L781-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In2070980941 256))) (.cse2 (= (mod ~y$r_buff0_thd2~0_In2070980941 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In2070980941 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In2070980941 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite29_Out2070980941| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite29_Out2070980941| ~y$w_buff1_used~0_In2070980941)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2070980941, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2070980941, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2070980941, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2070980941} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2070980941, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2070980941, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2070980941, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out2070980941|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2070980941} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 07:08:49,641 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L782-->L783: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1458193271 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1458193271 256)))) (or (and (= ~y$r_buff0_thd2~0_Out-1458193271 ~y$r_buff0_thd2~0_In-1458193271) (or .cse0 .cse1)) (and (not .cse0) (= 0 ~y$r_buff0_thd2~0_Out-1458193271) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1458193271, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1458193271} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1458193271, P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-1458193271|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-1458193271} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 07:08:49,645 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L742-->L742-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1718178871 256) 0))) (or (and (= ~y$w_buff1_used~0_In1718178871 |P0Thread1of1ForFork1_#t~ite17_Out1718178871|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In1718178871 256)))) (or (and (= (mod ~y$r_buff1_thd1~0_In1718178871 256) 0) .cse0) (and (= 0 (mod ~y$w_buff1_used~0_In1718178871 256)) .cse0) (= (mod ~y$w_buff0_used~0_In1718178871 256) 0))) .cse1 (= |P0Thread1of1ForFork1_#t~ite18_Out1718178871| |P0Thread1of1ForFork1_#t~ite17_Out1718178871|)) (and (= |P0Thread1of1ForFork1_#t~ite17_In1718178871| |P0Thread1of1ForFork1_#t~ite17_Out1718178871|) (not .cse1) (= |P0Thread1of1ForFork1_#t~ite18_Out1718178871| ~y$w_buff1_used~0_In1718178871)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1718178871, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1718178871, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1718178871, P0Thread1of1ForFork1_#t~ite17=|P0Thread1of1ForFork1_#t~ite17_In1718178871|, ~weak$$choice2~0=~weak$$choice2~0_In1718178871, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1718178871} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1718178871, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1718178871, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1718178871, P0Thread1of1ForFork1_#t~ite18=|P0Thread1of1ForFork1_#t~ite18_Out1718178871|, P0Thread1of1ForFork1_#t~ite17=|P0Thread1of1ForFork1_#t~ite17_Out1718178871|, ~weak$$choice2~0=~weak$$choice2~0_In1718178871, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1718178871} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite18, P0Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-27 07:08:49,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [609] [609] L743-->L744: Formula: (and (= v_~y$r_buff0_thd1~0_47 v_~y$r_buff0_thd1~0_46) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_47, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_7|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_10|, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_9|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_46, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, P0Thread1of1ForFork1_#t~ite19, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 07:08:49,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [599] [599] L746-->L754: Formula: (and (= 0 v_~y$flush_delayed~0_6) (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= v_~y~0_16 v_~y$mem_tmp~0_4) (= v_~__unbuffered_cnt~0_8 (+ v_~__unbuffered_cnt~0_9 1))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_4, P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8, ~y~0=v_~y~0_16} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-27 07:08:49,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L783-->L783-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1310600717 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1310600717 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In1310600717 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1310600717 256)))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite31_Out1310600717|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~y$r_buff1_thd2~0_In1310600717 |P1Thread1of1ForFork0_#t~ite31_Out1310600717|) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1310600717, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1310600717, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1310600717, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1310600717} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1310600717, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1310600717, P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out1310600717|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1310600717, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1310600717} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 07:08:49,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L783-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork0_#t~ite31_8|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_13, P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork0_#t~ite31, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 07:08:49,648 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [581] [581] L808-->L810-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_5 256))) (or (= 0 (mod v_~y$w_buff0_used~0_62 256)) (= (mod v_~y$r_buff0_thd0~0_15 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_62, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_62, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 07:08:49,648 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L810-2-->L810-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-2070199276 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-2070199276 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite34_Out-2070199276| ~y$w_buff1~0_In-2070199276)) (and (= |ULTIMATE.start_main_#t~ite34_Out-2070199276| ~y~0_In-2070199276) (or .cse0 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-2070199276, ~y~0=~y~0_In-2070199276, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2070199276, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2070199276} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-2070199276, ~y~0=~y~0_In-2070199276, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2070199276, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-2070199276|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2070199276} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-27 07:08:49,648 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [569] [569] L810-4-->L811: Formula: (= v_~y~0_13 |v_ULTIMATE.start_main_#t~ite34_7|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_7|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_6|, ~y~0=v_~y~0_13, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~y~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-27 07:08:49,649 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [635] [635] L811-->L811-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1199624468 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1199624468 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite36_Out1199624468| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite36_Out1199624468| ~y$w_buff0_used~0_In1199624468) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1199624468, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1199624468} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1199624468, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1199624468, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out1199624468|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-27 07:08:49,649 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] L812-->L812-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In-1955429862 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-1955429862 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-1955429862 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1955429862 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite37_Out-1955429862| 0)) (and (= |ULTIMATE.start_main_#t~ite37_Out-1955429862| ~y$w_buff1_used~0_In-1955429862) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1955429862, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1955429862, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1955429862, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1955429862} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1955429862, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1955429862, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1955429862|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1955429862, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1955429862} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 07:08:49,650 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L813-->L813-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In761673765 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In761673765 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite38_Out761673765| 0)) (and (= |ULTIMATE.start_main_#t~ite38_Out761673765| ~y$r_buff0_thd0~0_In761673765) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In761673765, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In761673765} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In761673765, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In761673765, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out761673765|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 07:08:49,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L814-->L814-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In-1989563306 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1989563306 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1989563306 256))) (.cse3 (= (mod ~y$r_buff0_thd0~0_In-1989563306 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite39_Out-1989563306| 0)) (and (= ~y$r_buff1_thd0~0_In-1989563306 |ULTIMATE.start_main_#t~ite39_Out-1989563306|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1989563306, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1989563306, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1989563306, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1989563306} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1989563306, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1989563306|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1989563306, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1989563306, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1989563306} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 07:08:49,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L814-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~__unbuffered_p0_EAX~0_9 0) (= v_~main$tmp_guard1~0_8 0) (= |v_ULTIMATE.start_main_#t~ite39_12| v_~y$r_buff1_thd0~0_15) (= 1 v_~__unbuffered_p1_EAX~0_9) (= 0 v_~__unbuffered_p1_EBX~0_9)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_12|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_15, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 07:08:49,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:08:49 BasicIcfg [2019-12-27 07:08:49,718 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 07:08:49,721 INFO L168 Benchmark]: Toolchain (without parser) took 13275.98 ms. Allocated memory was 143.7 MB in the beginning and 660.6 MB in the end (delta: 516.9 MB). Free memory was 99.8 MB in the beginning and 295.5 MB in the end (delta: -195.8 MB). Peak memory consumption was 321.2 MB. Max. memory is 7.1 GB. [2019-12-27 07:08:49,721 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 143.7 MB. Free memory is still 119.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 07:08:49,722 INFO L168 Benchmark]: CACSL2BoogieTranslator took 829.15 ms. Allocated memory was 143.7 MB in the beginning and 199.2 MB in the end (delta: 55.6 MB). Free memory was 99.3 MB in the beginning and 152.2 MB in the end (delta: -52.8 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. [2019-12-27 07:08:49,723 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.68 ms. Allocated memory is still 199.2 MB. Free memory was 151.2 MB in the beginning and 149.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 07:08:49,723 INFO L168 Benchmark]: Boogie Preprocessor took 37.09 ms. Allocated memory is still 199.2 MB. Free memory was 149.1 MB in the beginning and 147.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 07:08:49,724 INFO L168 Benchmark]: RCFGBuilder took 749.59 ms. Allocated memory is still 199.2 MB. Free memory was 147.1 MB in the beginning and 105.5 MB in the end (delta: 41.6 MB). Peak memory consumption was 41.6 MB. Max. memory is 7.1 GB. [2019-12-27 07:08:49,724 INFO L168 Benchmark]: TraceAbstraction took 11593.22 ms. Allocated memory was 199.2 MB in the beginning and 660.6 MB in the end (delta: 461.4 MB). Free memory was 104.5 MB in the beginning and 295.5 MB in the end (delta: -191.0 MB). Peak memory consumption was 270.3 MB. Max. memory is 7.1 GB. [2019-12-27 07:08:49,733 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.46 ms. Allocated memory is still 143.7 MB. Free memory is still 119.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 829.15 ms. Allocated memory was 143.7 MB in the beginning and 199.2 MB in the end (delta: 55.6 MB). Free memory was 99.3 MB in the beginning and 152.2 MB in the end (delta: -52.8 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.68 ms. Allocated memory is still 199.2 MB. Free memory was 151.2 MB in the beginning and 149.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.09 ms. Allocated memory is still 199.2 MB. Free memory was 149.1 MB in the beginning and 147.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 749.59 ms. Allocated memory is still 199.2 MB. Free memory was 147.1 MB in the beginning and 105.5 MB in the end (delta: 41.6 MB). Peak memory consumption was 41.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11593.22 ms. Allocated memory was 199.2 MB in the beginning and 660.6 MB in the end (delta: 461.4 MB). Free memory was 104.5 MB in the beginning and 295.5 MB in the end (delta: -191.0 MB). Peak memory consumption was 270.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.1s, 137 ProgramPointsBefore, 69 ProgramPointsAfterwards, 165 TransitionsBefore, 81 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 27 ConcurrentYvCompositions, 19 ChoiceCompositions, 4208 VarBasedMoverChecksPositive, 150 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 41237 CheckedPairsTotal, 97 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L802] FCALL, FORK 0 pthread_create(&t1659, ((void *)0), P0, ((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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] FCALL, FORK 0 pthread_create(&t1660, ((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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L759] 2 y$w_buff1 = y$w_buff0 [L760] 2 y$w_buff0 = 1 [L761] 2 y$w_buff1_used = y$w_buff0_used [L762] 2 y$w_buff0_used = (_Bool)1 [L779] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] 1 x = 1 [L734] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L735] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L736] 1 y$flush_delayed = weak$$choice2 [L737] 1 y$mem_tmp = y 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=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L738] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$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=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L779] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L780] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L781] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L738] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L739] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$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 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L739] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L740] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$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 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L740] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L741] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$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 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L741] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L742] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) 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 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 __unbuffered_p0_EAX = y 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=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L806] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L813] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 131 locations, 2 error locations. Result: UNSAFE, OverallTime: 11.3s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1466 SDtfs, 1344 SDslu, 2162 SDs, 0 SdLazy, 892 SolverSat, 77 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12371occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.5s AutomataMinimizationTime, 14 MinimizatonAttempts, 6870 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 349 NumberOfCodeBlocks, 349 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 293 ConstructedInterpolants, 0 QuantifiedInterpolants, 21776 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...