/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-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe024_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 22:44:58,256 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 22:44:58,258 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 22:44:58,270 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 22:44:58,271 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 22:44:58,272 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 22:44:58,273 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 22:44:58,275 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 22:44:58,277 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 22:44:58,278 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 22:44:58,278 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 22:44:58,280 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 22:44:58,280 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 22:44:58,281 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 22:44:58,282 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 22:44:58,283 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 22:44:58,284 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 22:44:58,284 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 22:44:58,286 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 22:44:58,288 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 22:44:58,290 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 22:44:58,291 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 22:44:58,292 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 22:44:58,293 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 22:44:58,295 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 22:44:58,295 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 22:44:58,295 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 22:44:58,296 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 22:44:58,296 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 22:44:58,297 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 22:44:58,298 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 22:44:58,298 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 22:44:58,299 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 22:44:58,300 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 22:44:58,301 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 22:44:58,301 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 22:44:58,302 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 22:44:58,302 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 22:44:58,302 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 22:44:58,303 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 22:44:58,303 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 22:44:58,304 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-MCR.epf [2019-12-27 22:44:58,318 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 22:44:58,318 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 22:44:58,320 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 22:44:58,320 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 22:44:58,320 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 22:44:58,320 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 22:44:58,320 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 22:44:58,321 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 22:44:58,321 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 22:44:58,321 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 22:44:58,321 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 22:44:58,321 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 22:44:58,321 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 22:44:58,322 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 22:44:58,322 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 22:44:58,322 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 22:44:58,322 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 22:44:58,322 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 22:44:58,323 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 22:44:58,323 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 22:44:58,323 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 22:44:58,323 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 22:44:58,323 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 22:44:58,324 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 22:44:58,324 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 22:44:58,324 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 22:44:58,324 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 22:44:58,324 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 22:44:58,324 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 22:44:58,325 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 22:44:58,325 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 22:44:58,325 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 22:44:58,602 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 22:44:58,614 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 22:44:58,618 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 22:44:58,619 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 22:44:58,620 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 22:44:58,620 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe024_pso.oepc.i [2019-12-27 22:44:58,678 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19439fa95/a2ff0016de264db0b1aa097383ed6312/FLAGcff0e207c [2019-12-27 22:44:59,263 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 22:44:59,264 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe024_pso.oepc.i [2019-12-27 22:44:59,279 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19439fa95/a2ff0016de264db0b1aa097383ed6312/FLAGcff0e207c [2019-12-27 22:44:59,520 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19439fa95/a2ff0016de264db0b1aa097383ed6312 [2019-12-27 22:44:59,530 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 22:44:59,532 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 22:44:59,534 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 22:44:59,535 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 22:44:59,541 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 22:44:59,542 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:44:59" (1/1) ... [2019-12-27 22:44:59,547 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c883f5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:44:59, skipping insertion in model container [2019-12-27 22:44:59,547 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:44:59" (1/1) ... [2019-12-27 22:44:59,555 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 22:44:59,626 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 22:45:00,097 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:45:00,110 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 22:45:00,201 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:45:00,280 INFO L208 MainTranslator]: Completed translation [2019-12-27 22:45:00,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:45:00 WrapperNode [2019-12-27 22:45:00,281 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 22:45:00,282 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 22:45:00,282 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 22:45:00,282 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 22:45:00,290 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:45:00" (1/1) ... [2019-12-27 22:45:00,314 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:45:00" (1/1) ... [2019-12-27 22:45:00,356 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 22:45:00,357 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 22:45:00,357 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 22:45:00,357 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 22:45:00,366 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:45:00" (1/1) ... [2019-12-27 22:45:00,367 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:45:00" (1/1) ... [2019-12-27 22:45:00,371 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:45:00" (1/1) ... [2019-12-27 22:45:00,372 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:45:00" (1/1) ... [2019-12-27 22:45:00,382 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:45:00" (1/1) ... [2019-12-27 22:45:00,386 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:45:00" (1/1) ... [2019-12-27 22:45:00,390 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:45:00" (1/1) ... [2019-12-27 22:45:00,394 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 22:45:00,395 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 22:45:00,395 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 22:45:00,395 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 22:45:00,396 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:45:00" (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 22:45:00,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 22:45:00,473 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 22:45:00,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 22:45:00,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 22:45:00,474 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 22:45:00,474 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 22:45:00,474 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 22:45:00,474 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 22:45:00,474 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 22:45:00,474 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 22:45:00,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 22:45:00,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 22:45:00,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 22:45:00,477 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 22:45:01,235 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 22:45:01,235 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 22:45:01,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:45:01 BoogieIcfgContainer [2019-12-27 22:45:01,237 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 22:45:01,238 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 22:45:01,238 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 22:45:01,242 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 22:45:01,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 10:44:59" (1/3) ... [2019-12-27 22:45:01,243 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@652c0ebe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:45:01, skipping insertion in model container [2019-12-27 22:45:01,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:45:00" (2/3) ... [2019-12-27 22:45:01,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@652c0ebe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:45:01, skipping insertion in model container [2019-12-27 22:45:01,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:45:01" (3/3) ... [2019-12-27 22:45:01,247 INFO L109 eAbstractionObserver]: Analyzing ICFG safe024_pso.oepc.i [2019-12-27 22:45:01,257 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 22:45:01,257 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 22:45:01,265 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 22:45:01,266 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 22:45:01,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,311 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,312 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,318 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,318 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,319 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,319 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,319 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,320 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,320 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,320 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,320 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,321 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,321 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,321 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,321 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,321 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,323 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,323 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,323 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,323 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,323 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,324 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,324 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,324 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,324 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,327 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,327 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,327 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,327 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,328 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,328 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,328 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,328 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,328 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,329 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,329 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,329 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,340 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,340 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,341 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,341 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,341 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,364 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,365 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,373 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,374 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,374 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,379 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,380 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,383 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,384 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:45:01,402 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 22:45:01,423 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 22:45:01,423 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 22:45:01,423 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 22:45:01,424 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 22:45:01,424 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 22:45:01,424 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 22:45:01,424 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 22:45:01,424 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 22:45:01,442 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-27 22:45:01,444 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-27 22:45:01,547 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-27 22:45:01,547 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:45:01,563 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 449 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 22:45:01,587 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-27 22:45:01,658 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-27 22:45:01,658 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:45:01,669 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 449 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 22:45:01,691 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 22:45:01,693 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 22:45:05,441 WARN L192 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 22:45:05,584 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 22:45:05,620 INFO L206 etLargeBlockEncoding]: Checked pairs total: 75034 [2019-12-27 22:45:05,621 INFO L214 etLargeBlockEncoding]: Total number of compositions: 108 [2019-12-27 22:45:05,624 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 87 transitions [2019-12-27 22:45:17,547 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 85916 states. [2019-12-27 22:45:17,550 INFO L276 IsEmpty]: Start isEmpty. Operand 85916 states. [2019-12-27 22:45:17,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 22:45:17,556 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:45:17,556 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 22:45:17,557 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:45:17,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:45:17,562 INFO L82 PathProgramCache]: Analyzing trace with hash 797474655, now seen corresponding path program 1 times [2019-12-27 22:45:17,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:45:17,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286781745] [2019-12-27 22:45:17,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:45:17,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:45:17,842 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 22:45:17,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286781745] [2019-12-27 22:45:17,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:45:17,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 22:45:17,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [285541377] [2019-12-27 22:45:17,845 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:45:17,848 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:45:17,858 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 22:45:17,859 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:45:17,863 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:45:17,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:45:17,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:45:17,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:45:17,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:45:17,881 INFO L87 Difference]: Start difference. First operand 85916 states. Second operand 3 states. [2019-12-27 22:45:21,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:45:21,540 INFO L93 Difference]: Finished difference Result 84652 states and 359098 transitions. [2019-12-27 22:45:21,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:45:21,542 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 22:45:21,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:45:22,176 INFO L225 Difference]: With dead ends: 84652 [2019-12-27 22:45:22,177 INFO L226 Difference]: Without dead ends: 79738 [2019-12-27 22:45:22,181 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 22:45:26,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79738 states. [2019-12-27 22:45:28,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79738 to 79738. [2019-12-27 22:45:28,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79738 states. [2019-12-27 22:45:32,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79738 states to 79738 states and 337790 transitions. [2019-12-27 22:45:32,046 INFO L78 Accepts]: Start accepts. Automaton has 79738 states and 337790 transitions. Word has length 5 [2019-12-27 22:45:32,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:45:32,046 INFO L462 AbstractCegarLoop]: Abstraction has 79738 states and 337790 transitions. [2019-12-27 22:45:32,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:45:32,046 INFO L276 IsEmpty]: Start isEmpty. Operand 79738 states and 337790 transitions. [2019-12-27 22:45:32,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 22:45:32,055 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:45:32,055 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:45:32,056 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:45:32,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:45:32,056 INFO L82 PathProgramCache]: Analyzing trace with hash 334215787, now seen corresponding path program 1 times [2019-12-27 22:45:32,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:45:32,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500654842] [2019-12-27 22:45:32,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:45:32,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:45:32,208 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 22:45:32,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500654842] [2019-12-27 22:45:32,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:45:32,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:45:32,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1903289509] [2019-12-27 22:45:32,210 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:45:32,212 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:45:32,217 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 22:45:32,217 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:45:32,217 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:45:32,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:45:32,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:45:32,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:45:32,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:45:32,220 INFO L87 Difference]: Start difference. First operand 79738 states and 337790 transitions. Second operand 4 states. [2019-12-27 22:45:33,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:45:33,156 INFO L93 Difference]: Finished difference Result 122590 states and 499694 transitions. [2019-12-27 22:45:33,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:45:33,157 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 22:45:33,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:45:34,370 INFO L225 Difference]: With dead ends: 122590 [2019-12-27 22:45:34,370 INFO L226 Difference]: Without dead ends: 122513 [2019-12-27 22:45:34,371 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 22:45:41,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122513 states. [2019-12-27 22:45:43,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122513 to 111273. [2019-12-27 22:45:43,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111273 states. [2019-12-27 22:45:43,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111273 states to 111273 states and 458752 transitions. [2019-12-27 22:45:43,689 INFO L78 Accepts]: Start accepts. Automaton has 111273 states and 458752 transitions. Word has length 13 [2019-12-27 22:45:43,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:45:43,690 INFO L462 AbstractCegarLoop]: Abstraction has 111273 states and 458752 transitions. [2019-12-27 22:45:43,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:45:43,690 INFO L276 IsEmpty]: Start isEmpty. Operand 111273 states and 458752 transitions. [2019-12-27 22:45:43,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 22:45:43,694 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:45:43,694 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:45:43,695 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:45:43,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:45:43,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1013985611, now seen corresponding path program 1 times [2019-12-27 22:45:43,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:45:43,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044876768] [2019-12-27 22:45:43,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:45:43,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:45:43,739 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 22:45:43,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044876768] [2019-12-27 22:45:43,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:45:43,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:45:43,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1136548737] [2019-12-27 22:45:43,741 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:45:43,742 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:45:43,744 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 22:45:43,744 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:45:43,744 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:45:43,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:45:43,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:45:43,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:45:43,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:45:43,745 INFO L87 Difference]: Start difference. First operand 111273 states and 458752 transitions. Second operand 3 states. [2019-12-27 22:45:43,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:45:43,863 INFO L93 Difference]: Finished difference Result 27590 states and 92015 transitions. [2019-12-27 22:45:43,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:45:43,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 22:45:43,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:45:47,328 INFO L225 Difference]: With dead ends: 27590 [2019-12-27 22:45:47,329 INFO L226 Difference]: Without dead ends: 27590 [2019-12-27 22:45:47,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:45:47,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27590 states. [2019-12-27 22:45:47,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27590 to 27590. [2019-12-27 22:45:47,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27590 states. [2019-12-27 22:45:47,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27590 states to 27590 states and 92015 transitions. [2019-12-27 22:45:47,876 INFO L78 Accepts]: Start accepts. Automaton has 27590 states and 92015 transitions. Word has length 13 [2019-12-27 22:45:47,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:45:47,876 INFO L462 AbstractCegarLoop]: Abstraction has 27590 states and 92015 transitions. [2019-12-27 22:45:47,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:45:47,876 INFO L276 IsEmpty]: Start isEmpty. Operand 27590 states and 92015 transitions. [2019-12-27 22:45:47,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 22:45:47,879 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:45:47,879 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:45:47,879 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:45:47,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:45:47,880 INFO L82 PathProgramCache]: Analyzing trace with hash -569288949, now seen corresponding path program 1 times [2019-12-27 22:45:47,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:45:47,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759981886] [2019-12-27 22:45:47,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:45:47,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:45:47,961 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 22:45:47,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759981886] [2019-12-27 22:45:47,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:45:47,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:45:47,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1847976361] [2019-12-27 22:45:47,965 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:45:47,967 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:45:47,971 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 22:45:47,972 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:45:47,974 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:45:47,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:45:47,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:45:47,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:45:47,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:45:47,976 INFO L87 Difference]: Start difference. First operand 27590 states and 92015 transitions. Second operand 5 states. [2019-12-27 22:45:48,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:45:48,445 INFO L93 Difference]: Finished difference Result 40899 states and 133989 transitions. [2019-12-27 22:45:48,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 22:45:48,446 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 22:45:48,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:45:48,517 INFO L225 Difference]: With dead ends: 40899 [2019-12-27 22:45:48,517 INFO L226 Difference]: Without dead ends: 40883 [2019-12-27 22:45:48,518 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 22:45:48,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40883 states. [2019-12-27 22:45:49,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40883 to 30763. [2019-12-27 22:45:49,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30763 states. [2019-12-27 22:45:49,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30763 states to 30763 states and 102099 transitions. [2019-12-27 22:45:49,400 INFO L78 Accepts]: Start accepts. Automaton has 30763 states and 102099 transitions. Word has length 14 [2019-12-27 22:45:49,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:45:49,400 INFO L462 AbstractCegarLoop]: Abstraction has 30763 states and 102099 transitions. [2019-12-27 22:45:49,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:45:49,400 INFO L276 IsEmpty]: Start isEmpty. Operand 30763 states and 102099 transitions. [2019-12-27 22:45:49,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 22:45:49,411 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:45:49,411 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] [2019-12-27 22:45:49,411 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:45:49,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:45:49,412 INFO L82 PathProgramCache]: Analyzing trace with hash -777509353, now seen corresponding path program 1 times [2019-12-27 22:45:49,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:45:49,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643150858] [2019-12-27 22:45:49,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:45:49,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:45:49,505 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 22:45:49,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643150858] [2019-12-27 22:45:49,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:45:49,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:45:49,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1522964572] [2019-12-27 22:45:49,507 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:45:49,511 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:45:49,524 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 67 states and 110 transitions. [2019-12-27 22:45:49,525 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:45:49,525 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:45:49,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:45:49,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:45:49,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:45:49,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:45:49,526 INFO L87 Difference]: Start difference. First operand 30763 states and 102099 transitions. Second operand 6 states. [2019-12-27 22:45:50,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:45:50,534 INFO L93 Difference]: Finished difference Result 48043 states and 156144 transitions. [2019-12-27 22:45:50,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 22:45:50,535 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 22:45:50,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:45:50,656 INFO L225 Difference]: With dead ends: 48043 [2019-12-27 22:45:50,656 INFO L226 Difference]: Without dead ends: 48015 [2019-12-27 22:45:50,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 22:45:50,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48015 states. [2019-12-27 22:45:51,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48015 to 32442. [2019-12-27 22:45:51,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32442 states. [2019-12-27 22:45:51,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32442 states to 32442 states and 106747 transitions. [2019-12-27 22:45:51,344 INFO L78 Accepts]: Start accepts. Automaton has 32442 states and 106747 transitions. Word has length 22 [2019-12-27 22:45:51,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:45:51,345 INFO L462 AbstractCegarLoop]: Abstraction has 32442 states and 106747 transitions. [2019-12-27 22:45:51,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:45:51,345 INFO L276 IsEmpty]: Start isEmpty. Operand 32442 states and 106747 transitions. [2019-12-27 22:45:51,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 22:45:51,362 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:45:51,362 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:45:51,363 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:45:51,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:45:51,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1832050688, now seen corresponding path program 1 times [2019-12-27 22:45:51,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:45:51,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166351652] [2019-12-27 22:45:51,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:45:51,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:45:51,430 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 22:45:51,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166351652] [2019-12-27 22:45:51,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:45:51,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:45:51,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [29353662] [2019-12-27 22:45:51,431 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:45:51,436 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:45:51,442 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 22:45:51,442 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:45:51,442 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:45:51,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:45:51,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:45:51,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:45:51,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:45:51,443 INFO L87 Difference]: Start difference. First operand 32442 states and 106747 transitions. Second operand 4 states. [2019-12-27 22:45:51,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:45:51,655 INFO L93 Difference]: Finished difference Result 12531 states and 37988 transitions. [2019-12-27 22:45:51,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 22:45:51,656 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 22:45:51,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:45:51,673 INFO L225 Difference]: With dead ends: 12531 [2019-12-27 22:45:51,673 INFO L226 Difference]: Without dead ends: 12531 [2019-12-27 22:45:51,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:45:51,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12531 states. [2019-12-27 22:45:51,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12531 to 12391. [2019-12-27 22:45:51,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12391 states. [2019-12-27 22:45:51,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12391 states to 12391 states and 37578 transitions. [2019-12-27 22:45:51,856 INFO L78 Accepts]: Start accepts. Automaton has 12391 states and 37578 transitions. Word has length 25 [2019-12-27 22:45:51,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:45:51,857 INFO L462 AbstractCegarLoop]: Abstraction has 12391 states and 37578 transitions. [2019-12-27 22:45:51,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:45:51,857 INFO L276 IsEmpty]: Start isEmpty. Operand 12391 states and 37578 transitions. [2019-12-27 22:45:51,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 22:45:51,875 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:45:51,875 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] [2019-12-27 22:45:51,875 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:45:51,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:45:51,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1562204347, now seen corresponding path program 1 times [2019-12-27 22:45:51,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:45:51,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716829770] [2019-12-27 22:45:51,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:45:51,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:45:52,028 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 22:45:52,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716829770] [2019-12-27 22:45:52,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:45:52,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:45:52,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1056568724] [2019-12-27 22:45:52,030 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:45:52,037 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:45:52,071 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 92 states and 143 transitions. [2019-12-27 22:45:52,071 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:45:52,201 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 22:45:52,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 22:45:52,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:45:52,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 22:45:52,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 22:45:52,202 INFO L87 Difference]: Start difference. First operand 12391 states and 37578 transitions. Second operand 8 states. [2019-12-27 22:45:53,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:45:53,120 INFO L93 Difference]: Finished difference Result 17659 states and 53000 transitions. [2019-12-27 22:45:53,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 22:45:53,121 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2019-12-27 22:45:53,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:45:53,156 INFO L225 Difference]: With dead ends: 17659 [2019-12-27 22:45:53,156 INFO L226 Difference]: Without dead ends: 17659 [2019-12-27 22:45:53,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:45:53,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17659 states. [2019-12-27 22:45:53,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17659 to 16146. [2019-12-27 22:45:53,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16146 states. [2019-12-27 22:45:53,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16146 states to 16146 states and 48801 transitions. [2019-12-27 22:45:53,544 INFO L78 Accepts]: Start accepts. Automaton has 16146 states and 48801 transitions. Word has length 39 [2019-12-27 22:45:53,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:45:53,545 INFO L462 AbstractCegarLoop]: Abstraction has 16146 states and 48801 transitions. [2019-12-27 22:45:53,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 22:45:53,545 INFO L276 IsEmpty]: Start isEmpty. Operand 16146 states and 48801 transitions. [2019-12-27 22:45:53,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 22:45:53,578 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:45:53,578 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] [2019-12-27 22:45:53,578 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:45:53,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:45:53,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1354690859, now seen corresponding path program 2 times [2019-12-27 22:45:53,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:45:53,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873778536] [2019-12-27 22:45:53,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:45:53,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:45:53,676 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 22:45:53,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873778536] [2019-12-27 22:45:53,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:45:53,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:45:53,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [233500210] [2019-12-27 22:45:53,677 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:45:53,684 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:45:53,706 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 69 states and 96 transitions. [2019-12-27 22:45:53,706 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:45:53,780 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 22:45:53,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 22:45:53,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:45:53,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 22:45:53,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:45:53,782 INFO L87 Difference]: Start difference. First operand 16146 states and 48801 transitions. Second operand 9 states. [2019-12-27 22:45:55,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:45:55,812 INFO L93 Difference]: Finished difference Result 43656 states and 129377 transitions. [2019-12-27 22:45:55,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 22:45:55,812 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2019-12-27 22:45:55,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:45:55,874 INFO L225 Difference]: With dead ends: 43656 [2019-12-27 22:45:55,874 INFO L226 Difference]: Without dead ends: 43656 [2019-12-27 22:45:55,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2019-12-27 22:45:55,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43656 states. [2019-12-27 22:45:56,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43656 to 17915. [2019-12-27 22:45:56,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17915 states. [2019-12-27 22:45:56,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17915 states to 17915 states and 54314 transitions. [2019-12-27 22:45:56,291 INFO L78 Accepts]: Start accepts. Automaton has 17915 states and 54314 transitions. Word has length 39 [2019-12-27 22:45:56,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:45:56,291 INFO L462 AbstractCegarLoop]: Abstraction has 17915 states and 54314 transitions. [2019-12-27 22:45:56,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 22:45:56,292 INFO L276 IsEmpty]: Start isEmpty. Operand 17915 states and 54314 transitions. [2019-12-27 22:45:56,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 22:45:56,317 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:45:56,317 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] [2019-12-27 22:45:56,317 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:45:56,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:45:56,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1850486613, now seen corresponding path program 3 times [2019-12-27 22:45:56,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:45:56,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501414501] [2019-12-27 22:45:56,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:45:56,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:45:56,398 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 22:45:56,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501414501] [2019-12-27 22:45:56,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:45:56,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:45:56,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [677020490] [2019-12-27 22:45:56,399 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:45:56,406 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:45:56,427 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 76 states and 111 transitions. [2019-12-27 22:45:56,427 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:45:56,432 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 22:45:56,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:45:56,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:45:56,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:45:56,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:45:56,433 INFO L87 Difference]: Start difference. First operand 17915 states and 54314 transitions. Second operand 5 states. [2019-12-27 22:45:56,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:45:56,506 INFO L93 Difference]: Finished difference Result 16542 states and 50779 transitions. [2019-12-27 22:45:56,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:45:56,506 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-27 22:45:56,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:45:56,531 INFO L225 Difference]: With dead ends: 16542 [2019-12-27 22:45:56,531 INFO L226 Difference]: Without dead ends: 16542 [2019-12-27 22:45:56,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:45:56,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16542 states. [2019-12-27 22:45:56,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16542 to 15708. [2019-12-27 22:45:56,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15708 states. [2019-12-27 22:45:56,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15708 states to 15708 states and 48426 transitions. [2019-12-27 22:45:56,763 INFO L78 Accepts]: Start accepts. Automaton has 15708 states and 48426 transitions. Word has length 39 [2019-12-27 22:45:56,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:45:56,763 INFO L462 AbstractCegarLoop]: Abstraction has 15708 states and 48426 transitions. [2019-12-27 22:45:56,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:45:56,764 INFO L276 IsEmpty]: Start isEmpty. Operand 15708 states and 48426 transitions. [2019-12-27 22:45:56,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:45:56,783 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:45:56,784 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:45:56,784 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:45:56,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:45:56,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1166865475, now seen corresponding path program 1 times [2019-12-27 22:45:56,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:45:56,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475651793] [2019-12-27 22:45:56,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:45:56,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:45:56,866 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 22:45:56,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475651793] [2019-12-27 22:45:56,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:45:56,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:45:56,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1120742585] [2019-12-27 22:45:56,867 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:45:56,883 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:45:57,018 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 212 states and 404 transitions. [2019-12-27 22:45:57,018 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:45:57,068 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 22:45:57,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 22:45:57,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:45:57,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 22:45:57,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:45:57,069 INFO L87 Difference]: Start difference. First operand 15708 states and 48426 transitions. Second operand 7 states. [2019-12-27 22:45:57,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:45:57,615 INFO L93 Difference]: Finished difference Result 34527 states and 105791 transitions. [2019-12-27 22:45:57,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 22:45:57,616 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 22:45:57,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:45:57,644 INFO L225 Difference]: With dead ends: 34527 [2019-12-27 22:45:57,644 INFO L226 Difference]: Without dead ends: 18959 [2019-12-27 22:45:57,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-12-27 22:45:57,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18959 states. [2019-12-27 22:45:57,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18959 to 13424. [2019-12-27 22:45:57,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13424 states. [2019-12-27 22:45:57,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13424 states to 13424 states and 41260 transitions. [2019-12-27 22:45:57,882 INFO L78 Accepts]: Start accepts. Automaton has 13424 states and 41260 transitions. Word has length 54 [2019-12-27 22:45:57,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:45:57,883 INFO L462 AbstractCegarLoop]: Abstraction has 13424 states and 41260 transitions. [2019-12-27 22:45:57,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 22:45:57,883 INFO L276 IsEmpty]: Start isEmpty. Operand 13424 states and 41260 transitions. [2019-12-27 22:45:57,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:45:57,898 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:45:57,898 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:45:57,898 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:45:57,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:45:57,899 INFO L82 PathProgramCache]: Analyzing trace with hash 2026182027, now seen corresponding path program 2 times [2019-12-27 22:45:57,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:45:57,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593205910] [2019-12-27 22:45:57,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:45:57,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:45:58,001 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 22:45:58,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593205910] [2019-12-27 22:45:58,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:45:58,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:45:58,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [551307347] [2019-12-27 22:45:58,002 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:45:58,019 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:45:58,233 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 190 states and 313 transitions. [2019-12-27 22:45:58,233 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:45:58,342 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-27 22:45:58,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 22:45:58,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:45:58,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 22:45:58,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:45:58,343 INFO L87 Difference]: Start difference. First operand 13424 states and 41260 transitions. Second operand 9 states. [2019-12-27 22:45:59,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:45:59,794 INFO L93 Difference]: Finished difference Result 45287 states and 136014 transitions. [2019-12-27 22:45:59,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 22:45:59,794 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-27 22:45:59,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:45:59,845 INFO L225 Difference]: With dead ends: 45287 [2019-12-27 22:45:59,846 INFO L226 Difference]: Without dead ends: 34494 [2019-12-27 22:45:59,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 10 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2019-12-27 22:45:59,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34494 states. [2019-12-27 22:46:00,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34494 to 15478. [2019-12-27 22:46:00,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15478 states. [2019-12-27 22:46:00,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15478 states to 15478 states and 47480 transitions. [2019-12-27 22:46:00,404 INFO L78 Accepts]: Start accepts. Automaton has 15478 states and 47480 transitions. Word has length 54 [2019-12-27 22:46:00,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:46:00,404 INFO L462 AbstractCegarLoop]: Abstraction has 15478 states and 47480 transitions. [2019-12-27 22:46:00,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 22:46:00,404 INFO L276 IsEmpty]: Start isEmpty. Operand 15478 states and 47480 transitions. [2019-12-27 22:46:00,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:46:00,421 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:46:00,422 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:46:00,422 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:46:00,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:46:00,422 INFO L82 PathProgramCache]: Analyzing trace with hash -345709295, now seen corresponding path program 3 times [2019-12-27 22:46:00,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:46:00,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681677750] [2019-12-27 22:46:00,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:46:00,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:46:00,526 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 22:46:00,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681677750] [2019-12-27 22:46:00,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:46:00,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:46:00,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1500376307] [2019-12-27 22:46:00,527 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:46:00,543 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:46:00,725 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 217 states and 400 transitions. [2019-12-27 22:46:00,725 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:46:00,832 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 22:46:00,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 22:46:00,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:46:00,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 22:46:00,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:46:00,834 INFO L87 Difference]: Start difference. First operand 15478 states and 47480 transitions. Second operand 10 states. [2019-12-27 22:46:01,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:46:01,352 INFO L93 Difference]: Finished difference Result 36198 states and 108797 transitions. [2019-12-27 22:46:01,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 22:46:01,353 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-12-27 22:46:01,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:46:01,390 INFO L225 Difference]: With dead ends: 36198 [2019-12-27 22:46:01,391 INFO L226 Difference]: Without dead ends: 25734 [2019-12-27 22:46:01,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2019-12-27 22:46:01,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25734 states. [2019-12-27 22:46:01,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25734 to 17318. [2019-12-27 22:46:01,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17318 states. [2019-12-27 22:46:01,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17318 states to 17318 states and 52753 transitions. [2019-12-27 22:46:01,729 INFO L78 Accepts]: Start accepts. Automaton has 17318 states and 52753 transitions. Word has length 54 [2019-12-27 22:46:01,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:46:01,729 INFO L462 AbstractCegarLoop]: Abstraction has 17318 states and 52753 transitions. [2019-12-27 22:46:01,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 22:46:01,729 INFO L276 IsEmpty]: Start isEmpty. Operand 17318 states and 52753 transitions. [2019-12-27 22:46:01,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:46:01,757 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:46:01,757 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:46:01,757 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:46:01,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:46:01,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1893996223, now seen corresponding path program 4 times [2019-12-27 22:46:01,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:46:01,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753776486] [2019-12-27 22:46:01,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:46:01,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:46:01,848 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 22:46:01,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753776486] [2019-12-27 22:46:01,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:46:01,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:46:01,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [839023757] [2019-12-27 22:46:01,850 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:46:01,866 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:46:01,999 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 142 states and 230 transitions. [2019-12-27 22:46:02,000 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:46:02,244 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 22:46:02,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 22:46:02,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:46:02,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 22:46:02,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:46:02,246 INFO L87 Difference]: Start difference. First operand 17318 states and 52753 transitions. Second operand 10 states. [2019-12-27 22:46:04,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:46:04,280 INFO L93 Difference]: Finished difference Result 70254 states and 213798 transitions. [2019-12-27 22:46:04,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 22:46:04,281 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-12-27 22:46:04,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:46:04,371 INFO L225 Difference]: With dead ends: 70254 [2019-12-27 22:46:04,371 INFO L226 Difference]: Without dead ends: 54335 [2019-12-27 22:46:04,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 6 SyntacticMatches, 8 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=212, Invalid=718, Unknown=0, NotChecked=0, Total=930 [2019-12-27 22:46:04,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54335 states. [2019-12-27 22:46:04,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54335 to 20280. [2019-12-27 22:46:04,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20280 states. [2019-12-27 22:46:04,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20280 states to 20280 states and 62496 transitions. [2019-12-27 22:46:04,949 INFO L78 Accepts]: Start accepts. Automaton has 20280 states and 62496 transitions. Word has length 54 [2019-12-27 22:46:04,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:46:04,949 INFO L462 AbstractCegarLoop]: Abstraction has 20280 states and 62496 transitions. [2019-12-27 22:46:04,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 22:46:04,949 INFO L276 IsEmpty]: Start isEmpty. Operand 20280 states and 62496 transitions. [2019-12-27 22:46:04,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:46:04,976 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:46:04,976 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:46:04,976 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:46:04,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:46:04,977 INFO L82 PathProgramCache]: Analyzing trace with hash -763040279, now seen corresponding path program 1 times [2019-12-27 22:46:04,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:46:04,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386888563] [2019-12-27 22:46:04,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:46:04,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:46:05,038 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 22:46:05,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386888563] [2019-12-27 22:46:05,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:46:05,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:46:05,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [441694737] [2019-12-27 22:46:05,039 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:46:05,055 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:46:05,189 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 142 states and 230 transitions. [2019-12-27 22:46:05,190 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:46:05,195 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 22:46:05,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:46:05,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:46:05,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:46:05,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:46:05,197 INFO L87 Difference]: Start difference. First operand 20280 states and 62496 transitions. Second operand 3 states. [2019-12-27 22:46:05,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:46:05,381 INFO L93 Difference]: Finished difference Result 28526 states and 87523 transitions. [2019-12-27 22:46:05,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:46:05,381 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 22:46:05,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:46:05,447 INFO L225 Difference]: With dead ends: 28526 [2019-12-27 22:46:05,448 INFO L226 Difference]: Without dead ends: 28526 [2019-12-27 22:46:05,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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 22:46:05,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28526 states. [2019-12-27 22:46:06,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28526 to 25642. [2019-12-27 22:46:06,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25642 states. [2019-12-27 22:46:06,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25642 states to 25642 states and 79205 transitions. [2019-12-27 22:46:06,156 INFO L78 Accepts]: Start accepts. Automaton has 25642 states and 79205 transitions. Word has length 54 [2019-12-27 22:46:06,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:46:06,156 INFO L462 AbstractCegarLoop]: Abstraction has 25642 states and 79205 transitions. [2019-12-27 22:46:06,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:46:06,156 INFO L276 IsEmpty]: Start isEmpty. Operand 25642 states and 79205 transitions. [2019-12-27 22:46:06,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:46:06,184 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:46:06,184 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:46:06,185 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:46:06,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:46:06,185 INFO L82 PathProgramCache]: Analyzing trace with hash 709346415, now seen corresponding path program 5 times [2019-12-27 22:46:06,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:46:06,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496499909] [2019-12-27 22:46:06,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:46:06,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:46:06,302 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 22:46:06,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496499909] [2019-12-27 22:46:06,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:46:06,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 22:46:06,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1260297855] [2019-12-27 22:46:06,303 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:46:06,319 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:46:06,509 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 219 states and 378 transitions. [2019-12-27 22:46:06,509 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:46:06,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:46:06,711 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 22:46:06,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 22:46:06,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:46:06,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 22:46:06,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-27 22:46:06,712 INFO L87 Difference]: Start difference. First operand 25642 states and 79205 transitions. Second operand 11 states. [2019-12-27 22:46:08,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:46:08,879 INFO L93 Difference]: Finished difference Result 39927 states and 120648 transitions. [2019-12-27 22:46:08,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 22:46:08,880 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2019-12-27 22:46:08,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:46:08,941 INFO L225 Difference]: With dead ends: 39927 [2019-12-27 22:46:08,941 INFO L226 Difference]: Without dead ends: 39927 [2019-12-27 22:46:08,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 19 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=130, Invalid=470, Unknown=0, NotChecked=0, Total=600 [2019-12-27 22:46:09,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39927 states. [2019-12-27 22:46:09,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39927 to 27381. [2019-12-27 22:46:09,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27381 states. [2019-12-27 22:46:09,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27381 states to 27381 states and 84108 transitions. [2019-12-27 22:46:09,668 INFO L78 Accepts]: Start accepts. Automaton has 27381 states and 84108 transitions. Word has length 54 [2019-12-27 22:46:09,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:46:09,668 INFO L462 AbstractCegarLoop]: Abstraction has 27381 states and 84108 transitions. [2019-12-27 22:46:09,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 22:46:09,668 INFO L276 IsEmpty]: Start isEmpty. Operand 27381 states and 84108 transitions. [2019-12-27 22:46:09,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:46:09,701 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:46:09,701 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:46:09,702 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:46:09,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:46:09,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1752990847, now seen corresponding path program 6 times [2019-12-27 22:46:09,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:46:09,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624134059] [2019-12-27 22:46:09,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:46:09,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:46:09,821 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 22:46:09,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624134059] [2019-12-27 22:46:09,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:46:09,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 22:46:09,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1188058876] [2019-12-27 22:46:09,825 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:46:09,845 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:46:09,962 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 173 states and 299 transitions. [2019-12-27 22:46:09,963 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:46:10,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:46:10,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:46:10,193 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 22:46:10,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 22:46:10,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:46:10,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 22:46:10,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-12-27 22:46:10,194 INFO L87 Difference]: Start difference. First operand 27381 states and 84108 transitions. Second operand 13 states. [2019-12-27 22:46:14,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:46:14,402 INFO L93 Difference]: Finished difference Result 59090 states and 177179 transitions. [2019-12-27 22:46:14,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-27 22:46:14,402 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-27 22:46:14,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:46:14,495 INFO L225 Difference]: With dead ends: 59090 [2019-12-27 22:46:14,495 INFO L226 Difference]: Without dead ends: 59090 [2019-12-27 22:46:14,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 31 SyntacticMatches, 8 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 633 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=471, Invalid=1785, Unknown=0, NotChecked=0, Total=2256 [2019-12-27 22:46:14,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59090 states. [2019-12-27 22:46:15,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59090 to 25899. [2019-12-27 22:46:15,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25899 states. [2019-12-27 22:46:15,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25899 states to 25899 states and 79793 transitions. [2019-12-27 22:46:15,405 INFO L78 Accepts]: Start accepts. Automaton has 25899 states and 79793 transitions. Word has length 54 [2019-12-27 22:46:15,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:46:15,405 INFO L462 AbstractCegarLoop]: Abstraction has 25899 states and 79793 transitions. [2019-12-27 22:46:15,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 22:46:15,405 INFO L276 IsEmpty]: Start isEmpty. Operand 25899 states and 79793 transitions. [2019-12-27 22:46:15,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:46:15,435 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:46:15,435 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:46:15,435 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:46:15,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:46:15,435 INFO L82 PathProgramCache]: Analyzing trace with hash -931727569, now seen corresponding path program 7 times [2019-12-27 22:46:15,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:46:15,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710777606] [2019-12-27 22:46:15,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:46:15,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:46:15,493 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 22:46:15,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710777606] [2019-12-27 22:46:15,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:46:15,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:46:15,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [237490234] [2019-12-27 22:46:15,495 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:46:15,510 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:46:15,708 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 185 states and 305 transitions. [2019-12-27 22:46:15,708 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:46:15,719 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 22:46:15,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:46:15,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:46:15,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:46:15,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:46:15,721 INFO L87 Difference]: Start difference. First operand 25899 states and 79793 transitions. Second operand 4 states. [2019-12-27 22:46:16,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:46:16,122 INFO L93 Difference]: Finished difference Result 26122 states and 78344 transitions. [2019-12-27 22:46:16,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:46:16,123 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-27 22:46:16,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:46:16,187 INFO L225 Difference]: With dead ends: 26122 [2019-12-27 22:46:16,187 INFO L226 Difference]: Without dead ends: 26122 [2019-12-27 22:46:16,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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 22:46:16,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26122 states. [2019-12-27 22:46:16,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26122 to 19381. [2019-12-27 22:46:16,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19381 states. [2019-12-27 22:46:16,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19381 states to 19381 states and 58610 transitions. [2019-12-27 22:46:16,774 INFO L78 Accepts]: Start accepts. Automaton has 19381 states and 58610 transitions. Word has length 54 [2019-12-27 22:46:16,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:46:16,775 INFO L462 AbstractCegarLoop]: Abstraction has 19381 states and 58610 transitions. [2019-12-27 22:46:16,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:46:16,775 INFO L276 IsEmpty]: Start isEmpty. Operand 19381 states and 58610 transitions. [2019-12-27 22:46:16,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 22:46:16,807 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:46:16,808 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:46:16,808 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:46:16,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:46:16,808 INFO L82 PathProgramCache]: Analyzing trace with hash 2068351876, now seen corresponding path program 1 times [2019-12-27 22:46:16,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:46:16,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369783965] [2019-12-27 22:46:16,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:46:16,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:46:16,965 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 22:46:16,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369783965] [2019-12-27 22:46:16,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:46:16,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 22:46:16,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2080756629] [2019-12-27 22:46:16,966 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:46:16,989 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:46:17,249 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 189 states and 350 transitions. [2019-12-27 22:46:17,249 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:46:17,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:46:17,438 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 22:46:17,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 22:46:17,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:46:17,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 22:46:17,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-12-27 22:46:17,439 INFO L87 Difference]: Start difference. First operand 19381 states and 58610 transitions. Second operand 12 states. [2019-12-27 22:46:19,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:46:19,199 INFO L93 Difference]: Finished difference Result 27180 states and 80237 transitions. [2019-12-27 22:46:19,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 22:46:19,199 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-12-27 22:46:19,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:46:19,237 INFO L225 Difference]: With dead ends: 27180 [2019-12-27 22:46:19,237 INFO L226 Difference]: Without dead ends: 27044 [2019-12-27 22:46:19,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 10 SyntacticMatches, 9 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=425, Unknown=0, NotChecked=0, Total=552 [2019-12-27 22:46:19,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27044 states. [2019-12-27 22:46:19,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27044 to 21170. [2019-12-27 22:46:19,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21170 states. [2019-12-27 22:46:19,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21170 states to 21170 states and 63657 transitions. [2019-12-27 22:46:19,595 INFO L78 Accepts]: Start accepts. Automaton has 21170 states and 63657 transitions. Word has length 55 [2019-12-27 22:46:19,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:46:19,596 INFO L462 AbstractCegarLoop]: Abstraction has 21170 states and 63657 transitions. [2019-12-27 22:46:19,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 22:46:19,596 INFO L276 IsEmpty]: Start isEmpty. Operand 21170 states and 63657 transitions. [2019-12-27 22:46:19,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 22:46:19,620 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:46:19,620 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:46:19,620 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:46:19,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:46:19,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1084774030, now seen corresponding path program 2 times [2019-12-27 22:46:19,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:46:19,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473819993] [2019-12-27 22:46:19,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:46:19,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:46:19,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:46:19,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473819993] [2019-12-27 22:46:19,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:46:19,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 22:46:19,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [681067146] [2019-12-27 22:46:19,746 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:46:19,761 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:46:19,894 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 180 states and 332 transitions. [2019-12-27 22:46:19,894 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:46:19,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:46:20,104 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 22:46:20,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 22:46:20,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:46:20,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 22:46:20,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-27 22:46:20,105 INFO L87 Difference]: Start difference. First operand 21170 states and 63657 transitions. Second operand 13 states. [2019-12-27 22:46:23,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:46:23,083 INFO L93 Difference]: Finished difference Result 27747 states and 81861 transitions. [2019-12-27 22:46:23,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-27 22:46:23,084 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2019-12-27 22:46:23,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:46:23,123 INFO L225 Difference]: With dead ends: 27747 [2019-12-27 22:46:23,123 INFO L226 Difference]: Without dead ends: 27747 [2019-12-27 22:46:23,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 16 SyntacticMatches, 8 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=255, Invalid=1227, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 22:46:23,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27747 states. [2019-12-27 22:46:23,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27747 to 19122. [2019-12-27 22:46:23,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19122 states. [2019-12-27 22:46:23,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19122 states to 19122 states and 57824 transitions. [2019-12-27 22:46:23,471 INFO L78 Accepts]: Start accepts. Automaton has 19122 states and 57824 transitions. Word has length 55 [2019-12-27 22:46:23,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:46:23,471 INFO L462 AbstractCegarLoop]: Abstraction has 19122 states and 57824 transitions. [2019-12-27 22:46:23,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 22:46:23,471 INFO L276 IsEmpty]: Start isEmpty. Operand 19122 states and 57824 transitions. [2019-12-27 22:46:23,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 22:46:23,496 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:46:23,497 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:46:23,497 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:46:23,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:46:23,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1247506214, now seen corresponding path program 3 times [2019-12-27 22:46:23,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:46:23,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639709454] [2019-12-27 22:46:23,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:46:23,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:46:23,600 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 22:46:23,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639709454] [2019-12-27 22:46:23,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:46:23,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 22:46:23,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [192170102] [2019-12-27 22:46:23,601 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:46:23,616 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:46:23,755 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 139 states and 226 transitions. [2019-12-27 22:46:23,756 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:46:23,991 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 22:46:23,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 22:46:23,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:46:23,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 22:46:23,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-27 22:46:23,993 INFO L87 Difference]: Start difference. First operand 19122 states and 57824 transitions. Second operand 12 states. [2019-12-27 22:46:25,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:46:25,705 INFO L93 Difference]: Finished difference Result 34481 states and 103535 transitions. [2019-12-27 22:46:25,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 22:46:25,705 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-12-27 22:46:25,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:46:25,745 INFO L225 Difference]: With dead ends: 34481 [2019-12-27 22:46:25,745 INFO L226 Difference]: Without dead ends: 27074 [2019-12-27 22:46:25,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2019-12-27 22:46:25,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27074 states. [2019-12-27 22:46:26,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27074 to 19586. [2019-12-27 22:46:26,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19586 states. [2019-12-27 22:46:26,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19586 states to 19586 states and 58787 transitions. [2019-12-27 22:46:26,093 INFO L78 Accepts]: Start accepts. Automaton has 19586 states and 58787 transitions. Word has length 55 [2019-12-27 22:46:26,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:46:26,094 INFO L462 AbstractCegarLoop]: Abstraction has 19586 states and 58787 transitions. [2019-12-27 22:46:26,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 22:46:26,094 INFO L276 IsEmpty]: Start isEmpty. Operand 19586 states and 58787 transitions. [2019-12-27 22:46:26,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 22:46:26,115 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:46:26,115 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:46:26,115 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:46:26,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:46:26,116 INFO L82 PathProgramCache]: Analyzing trace with hash -653717204, now seen corresponding path program 4 times [2019-12-27 22:46:26,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:46:26,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723737482] [2019-12-27 22:46:26,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:46:26,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:46:26,264 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 22:46:26,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723737482] [2019-12-27 22:46:26,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:46:26,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 22:46:26,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [964522393] [2019-12-27 22:46:26,266 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:46:26,281 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:46:26,528 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 136 states and 227 transitions. [2019-12-27 22:46:26,529 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:46:26,871 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 22:46:26,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 22:46:26,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:46:26,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 22:46:26,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2019-12-27 22:46:26,873 INFO L87 Difference]: Start difference. First operand 19586 states and 58787 transitions. Second operand 19 states. [2019-12-27 22:46:36,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:46:36,946 INFO L93 Difference]: Finished difference Result 73435 states and 215570 transitions. [2019-12-27 22:46:36,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2019-12-27 22:46:36,947 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 55 [2019-12-27 22:46:36,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:46:37,044 INFO L225 Difference]: With dead ends: 73435 [2019-12-27 22:46:37,045 INFO L226 Difference]: Without dead ends: 65685 [2019-12-27 22:46:37,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 16 SyntacticMatches, 8 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7660 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=2687, Invalid=17335, Unknown=0, NotChecked=0, Total=20022 [2019-12-27 22:46:37,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65685 states. [2019-12-27 22:46:37,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65685 to 27565. [2019-12-27 22:46:37,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27565 states. [2019-12-27 22:46:37,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27565 states to 27565 states and 82234 transitions. [2019-12-27 22:46:37,708 INFO L78 Accepts]: Start accepts. Automaton has 27565 states and 82234 transitions. Word has length 55 [2019-12-27 22:46:37,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:46:37,709 INFO L462 AbstractCegarLoop]: Abstraction has 27565 states and 82234 transitions. [2019-12-27 22:46:37,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 22:46:37,709 INFO L276 IsEmpty]: Start isEmpty. Operand 27565 states and 82234 transitions. [2019-12-27 22:46:37,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 22:46:37,740 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:46:37,740 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:46:37,741 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:46:37,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:46:37,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1458558076, now seen corresponding path program 5 times [2019-12-27 22:46:37,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:46:37,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514203951] [2019-12-27 22:46:37,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:46:37,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:46:37,789 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 22:46:37,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514203951] [2019-12-27 22:46:37,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:46:37,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:46:37,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [706393548] [2019-12-27 22:46:37,790 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:46:37,805 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:46:37,969 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 167 states and 285 transitions. [2019-12-27 22:46:37,970 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:46:37,970 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:46:37,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:46:37,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:46:37,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:46:37,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:46:37,971 INFO L87 Difference]: Start difference. First operand 27565 states and 82234 transitions. Second operand 3 states. [2019-12-27 22:46:38,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:46:38,096 INFO L93 Difference]: Finished difference Result 27563 states and 82229 transitions. [2019-12-27 22:46:38,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:46:38,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 22:46:38,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:46:38,136 INFO L225 Difference]: With dead ends: 27563 [2019-12-27 22:46:38,136 INFO L226 Difference]: Without dead ends: 27563 [2019-12-27 22:46:38,136 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 22:46:38,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27563 states. [2019-12-27 22:46:38,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27563 to 25159. [2019-12-27 22:46:38,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25159 states. [2019-12-27 22:46:38,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25159 states to 25159 states and 75745 transitions. [2019-12-27 22:46:38,714 INFO L78 Accepts]: Start accepts. Automaton has 25159 states and 75745 transitions. Word has length 55 [2019-12-27 22:46:38,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:46:38,714 INFO L462 AbstractCegarLoop]: Abstraction has 25159 states and 75745 transitions. [2019-12-27 22:46:38,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:46:38,714 INFO L276 IsEmpty]: Start isEmpty. Operand 25159 states and 75745 transitions. [2019-12-27 22:46:38,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 22:46:38,743 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:46:38,744 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:46:38,744 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:46:38,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:46:38,744 INFO L82 PathProgramCache]: Analyzing trace with hash 794171059, now seen corresponding path program 1 times [2019-12-27 22:46:38,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:46:38,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964594740] [2019-12-27 22:46:38,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:46:38,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:46:39,213 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 22:46:39,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964594740] [2019-12-27 22:46:39,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:46:39,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 22:46:39,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [856647243] [2019-12-27 22:46:39,214 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:46:39,230 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:46:39,483 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 218 states and 420 transitions. [2019-12-27 22:46:39,483 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:46:40,455 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 29 times. [2019-12-27 22:46:40,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 22:46:40,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:46:40,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 22:46:40,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2019-12-27 22:46:40,456 INFO L87 Difference]: Start difference. First operand 25159 states and 75745 transitions. Second operand 24 states. [2019-12-27 22:46:46,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:46:46,483 INFO L93 Difference]: Finished difference Result 37977 states and 112190 transitions. [2019-12-27 22:46:46,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-27 22:46:46,483 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 56 [2019-12-27 22:46:46,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:46:46,535 INFO L225 Difference]: With dead ends: 37977 [2019-12-27 22:46:46,535 INFO L226 Difference]: Without dead ends: 35261 [2019-12-27 22:46:46,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 11 SyntacticMatches, 14 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 717 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=460, Invalid=2192, Unknown=0, NotChecked=0, Total=2652 [2019-12-27 22:46:46,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35261 states. [2019-12-27 22:46:46,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35261 to 25615. [2019-12-27 22:46:46,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25615 states. [2019-12-27 22:46:46,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25615 states to 25615 states and 76802 transitions. [2019-12-27 22:46:46,971 INFO L78 Accepts]: Start accepts. Automaton has 25615 states and 76802 transitions. Word has length 56 [2019-12-27 22:46:46,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:46:46,971 INFO L462 AbstractCegarLoop]: Abstraction has 25615 states and 76802 transitions. [2019-12-27 22:46:46,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 22:46:46,971 INFO L276 IsEmpty]: Start isEmpty. Operand 25615 states and 76802 transitions. [2019-12-27 22:46:46,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 22:46:46,997 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:46:46,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, 1, 1, 1, 1, 1, 1, 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 22:46:46,998 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:46:46,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:46:46,998 INFO L82 PathProgramCache]: Analyzing trace with hash 379887659, now seen corresponding path program 2 times [2019-12-27 22:46:46,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:46:46,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614064322] [2019-12-27 22:46:46,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:46:47,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:46:47,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:46:47,136 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 22:46:47,137 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 22:46:47,141 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_53| 0 0))) (and (= 0 v_~x$w_buff1~0_24) (= v_~main$tmp_guard0~0_10 0) (= 0 |v_ULTIMATE.start_main_~#t2351~0.offset_15|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t2351~0.base_19| 4)) (= v_~x$r_buff1_thd1~0_42 0) (= 0 v_~x$r_buff0_thd2~0_24) (= 0 v_~x$r_buff0_thd0~0_20) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t2351~0.base_19|) (= v_~__unbuffered_p2_EBX~0_14 0) (= 0 v_~weak$$choice0~0_5) (= v_~z~0_10 0) (= 0 v_~__unbuffered_p0_EAX~0_14) (= 0 v_~x$read_delayed_var~0.base_8) (= v_~x$w_buff1_used~0_67 0) (< 0 |v_#StackHeapBarrier_14|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~x$read_delayed~0_8) (= 0 v_~x$read_delayed_var~0.offset_8) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2351~0.base_19|)) (= v_~x$flush_delayed~0_14 0) (= 0 v_~x$r_buff0_thd1~0_71) (= v_~x$r_buff1_thd2~0_16 0) (= 0 v_~x$w_buff0_used~0_110) (= |v_#NULL.offset_5| 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t2351~0.base_19| 1) |v_#valid_51|) (= v_~main$tmp_guard1~0_15 0) (= 0 v_~__unbuffered_cnt~0_22) (= v_~x$mem_tmp~0_11 0) (= v_~x~0_25 0) (= 0 v_~x$r_buff0_thd3~0_19) (= v_~y~0_10 0) (= 0 v_~__unbuffered_p2_EAX~0_14) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2351~0.base_19| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2351~0.base_19|) |v_ULTIMATE.start_main_~#t2351~0.offset_15| 0)) |v_#memory_int_21|) (= v_~x$r_buff1_thd0~0_19 0) (= 0 v_~x$w_buff0~0_29) (= 0 |v_#NULL.base_5|) (= v_~x$r_buff1_thd3~0_16 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_22|, #length=|v_#length_22|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_29, ULTIMATE.start_main_~#t2352~0.offset=|v_ULTIMATE.start_main_~#t2352~0.offset_16|, ~x$flush_delayed~0=v_~x$flush_delayed~0_14, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_42, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_19, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_9|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_9|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_14, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ~x$w_buff1~0=v_~x$w_buff1~0_24, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_67, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ULTIMATE.start_main_~#t2353~0.base=|v_ULTIMATE.start_main_~#t2353~0.base_21|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_8, ULTIMATE.start_main_~#t2353~0.offset=|v_ULTIMATE.start_main_~#t2353~0.offset_16|, ~weak$$choice0~0=v_~weak$$choice0~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~x~0=v_~x~0_25, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_71, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_17|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_9|, ULTIMATE.start_main_~#t2352~0.base=|v_ULTIMATE.start_main_~#t2352~0.base_21|, ULTIMATE.start_main_~#t2351~0.offset=|v_ULTIMATE.start_main_~#t2351~0.offset_15|, ~y~0=v_~y~0_10, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_7|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_19, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_24, #NULL.base=|v_#NULL.base_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_110, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_11|, ULTIMATE.start_main_~#t2351~0.base=|v_ULTIMATE.start_main_~#t2351~0.base_19|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_8, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_7|, ~z~0=v_~z~0_10, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~x$read_delayed~0=v_~x$read_delayed~0_8} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_~#t2352~0.offset, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t2353~0.base, ~x$read_delayed_var~0.base, ULTIMATE.start_main_~#t2353~0.offset, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t2352~0.base, ULTIMATE.start_main_~#t2351~0.offset, ~y~0, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t2351~0.base, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 22:46:47,142 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L820-1-->L822: Formula: (and (not (= |v_ULTIMATE.start_main_~#t2352~0.base_13| 0)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t2352~0.base_13| 1)) (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t2352~0.base_13|) 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2352~0.base_13|) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2352~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2352~0.base_13|) |v_ULTIMATE.start_main_~#t2352~0.offset_11| 1))) (= 0 |v_ULTIMATE.start_main_~#t2352~0.offset_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2352~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t2352~0.offset=|v_ULTIMATE.start_main_~#t2352~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2352~0.base=|v_ULTIMATE.start_main_~#t2352~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2352~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2352~0.base] because there is no mapped edge [2019-12-27 22:46:47,142 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L822-1-->L824: Formula: (and (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t2353~0.base_13| 1) |v_#valid_38|) (not (= 0 |v_ULTIMATE.start_main_~#t2353~0.base_13|)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t2353~0.base_13| 4) |v_#length_17|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2353~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2353~0.base_13|) |v_ULTIMATE.start_main_~#t2353~0.offset_11| 2)) |v_#memory_int_17|) (= (select |v_#valid_39| |v_ULTIMATE.start_main_~#t2353~0.base_13|) 0) (= 0 |v_ULTIMATE.start_main_~#t2353~0.offset_11|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2353~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2353~0.offset=|v_ULTIMATE.start_main_~#t2353~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_17|, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t2353~0.base=|v_ULTIMATE.start_main_~#t2353~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2353~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t2353~0.base] because there is no mapped edge [2019-12-27 22:46:47,143 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] P1ENTRY-->L5-3: Formula: (and (= P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out1962883890 |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1962883890|) (= 1 ~x$w_buff0~0_Out1962883890) (= 1 |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1962883890|) (= (mod ~x$w_buff1_used~0_Out1962883890 256) 0) (= P1Thread1of1ForFork0_~arg.offset_Out1962883890 |P1Thread1of1ForFork0_#in~arg.offset_In1962883890|) (= ~x$w_buff0_used~0_Out1962883890 1) (= ~x$w_buff0_used~0_In1962883890 ~x$w_buff1_used~0_Out1962883890) (= P1Thread1of1ForFork0_~arg.base_Out1962883890 |P1Thread1of1ForFork0_#in~arg.base_In1962883890|) (= ~x$w_buff1~0_Out1962883890 ~x$w_buff0~0_In1962883890)) InVars {~x$w_buff0~0=~x$w_buff0~0_In1962883890, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In1962883890|, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In1962883890|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1962883890} OutVars{~x$w_buff0~0=~x$w_buff0~0_Out1962883890, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out1962883890, P1Thread1of1ForFork0_~arg.offset=P1Thread1of1ForFork0_~arg.offset_Out1962883890, P1Thread1of1ForFork0_~arg.base=P1Thread1of1ForFork0_~arg.base_Out1962883890, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1962883890|, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In1962883890|, ~x$w_buff1~0=~x$w_buff1~0_Out1962883890, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In1962883890|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out1962883890, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out1962883890} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 22:46:47,145 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L797-2-->L797-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In236542268 256))) (.cse0 (= (mod ~x$r_buff1_thd3~0_In236542268 256) 0))) (or (and (= ~x$w_buff1~0_In236542268 |P2Thread1of1ForFork1_#t~ite32_Out236542268|) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite32_Out236542268| ~x~0_In236542268) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In236542268, ~x$w_buff1_used~0=~x$w_buff1_used~0_In236542268, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In236542268, ~x~0=~x~0_In236542268} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out236542268|, ~x$w_buff1~0=~x$w_buff1~0_In236542268, ~x$w_buff1_used~0=~x$w_buff1_used~0_In236542268, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In236542268, ~x~0=~x~0_In236542268} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 22:46:47,146 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L797-4-->L798: Formula: (= v_~x~0_19 |v_P2Thread1of1ForFork1_#t~ite32_8|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_8|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_7|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_7|, ~x~0=v_~x~0_19} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-27 22:46:47,146 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L798-->L798-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1287647499 256))) (.cse1 (= (mod ~x$r_buff0_thd3~0_In-1287647499 256) 0))) (or (and (= ~x$w_buff0_used~0_In-1287647499 |P2Thread1of1ForFork1_#t~ite34_Out-1287647499|) (or .cse0 .cse1)) (and (= 0 |P2Thread1of1ForFork1_#t~ite34_Out-1287647499|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1287647499, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1287647499} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-1287647499|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1287647499, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1287647499} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 22:46:47,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1751802716 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1751802716 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite28_Out1751802716| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork0_#t~ite28_Out1751802716| ~x$w_buff0_used~0_In1751802716) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1751802716, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1751802716} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1751802716, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out1751802716|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1751802716} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 22:46:47,148 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L779-->L779-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1537155013 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1537155013 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In-1537155013 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1537155013 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite29_Out-1537155013| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P1Thread1of1ForFork0_#t~ite29_Out-1537155013| ~x$w_buff1_used~0_In-1537155013)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1537155013, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1537155013, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1537155013, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1537155013} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1537155013, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1537155013, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1537155013, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-1537155013|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1537155013} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 22:46:47,149 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L780-->L781: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-1720169155 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-1720169155 256) 0))) (or (and (= ~x$r_buff0_thd2~0_Out-1720169155 ~x$r_buff0_thd2~0_In-1720169155) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= ~x$r_buff0_thd2~0_Out-1720169155 0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1720169155, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1720169155} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-1720169155|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1720169155, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1720169155} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 22:46:47,149 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L781-->L781-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In1908150494 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In1908150494 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In1908150494 256))) (.cse3 (= (mod ~x$r_buff0_thd2~0_In1908150494 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite31_Out1908150494| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite31_Out1908150494| ~x$r_buff1_thd2~0_In1908150494) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1908150494, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1908150494, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1908150494, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1908150494} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out1908150494|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1908150494, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1908150494, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1908150494, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1908150494} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 22:46:47,149 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L781-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= v_~x$r_buff1_thd2~0_11 |v_P1Thread1of1ForFork0_#t~ite31_8|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_7|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_11, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 22:46:47,151 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L743-->L743-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In483577880 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite12_Out483577880| |P0Thread1of1ForFork2_#t~ite11_Out483577880|) (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In483577880 256)))) (or (= (mod ~x$w_buff0_used~0_In483577880 256) 0) (and (= (mod ~x$r_buff1_thd1~0_In483577880 256) 0) .cse0) (and (= (mod ~x$w_buff1_used~0_In483577880 256) 0) .cse0))) .cse1 (= |P0Thread1of1ForFork2_#t~ite11_Out483577880| ~x$w_buff1~0_In483577880)) (and (= |P0Thread1of1ForFork2_#t~ite12_Out483577880| ~x$w_buff1~0_In483577880) (= |P0Thread1of1ForFork2_#t~ite11_In483577880| |P0Thread1of1ForFork2_#t~ite11_Out483577880|) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In483577880, ~x$w_buff1~0=~x$w_buff1~0_In483577880, ~x$w_buff1_used~0=~x$w_buff1_used~0_In483577880, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In483577880, ~weak$$choice2~0=~weak$$choice2~0_In483577880, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In483577880|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In483577880} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In483577880, ~x$w_buff1~0=~x$w_buff1~0_In483577880, ~x$w_buff1_used~0=~x$w_buff1_used~0_In483577880, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In483577880, ~weak$$choice2~0=~weak$$choice2~0_In483577880, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out483577880|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out483577880|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In483577880} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 22:46:47,152 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L744-->L744-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1807378787 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite15_Out1807378787| ~x$w_buff0_used~0_In1807378787) (= |P0Thread1of1ForFork2_#t~ite14_In1807378787| |P0Thread1of1ForFork2_#t~ite14_Out1807378787|) (not .cse0)) (and (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1807378787 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In1807378787 256)) (and .cse1 (= (mod ~x$w_buff1_used~0_In1807378787 256) 0)) (and (= (mod ~x$r_buff1_thd1~0_In1807378787 256) 0) .cse1))) (= ~x$w_buff0_used~0_In1807378787 |P0Thread1of1ForFork2_#t~ite14_Out1807378787|) .cse0 (= |P0Thread1of1ForFork2_#t~ite15_Out1807378787| |P0Thread1of1ForFork2_#t~ite14_Out1807378787|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1807378787, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1807378787, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1807378787, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In1807378787|, ~weak$$choice2~0=~weak$$choice2~0_In1807378787, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1807378787} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1807378787, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1807378787, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out1807378787|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1807378787, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out1807378787|, ~weak$$choice2~0=~weak$$choice2~0_In1807378787, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1807378787} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 22:46:47,152 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L745-->L745-8: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd1~0_In1386428330 256) 0)) (.cse4 (= (mod ~x$w_buff1_used~0_In1386428330 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1386428330 256))) (.cse5 (= |P0Thread1of1ForFork2_#t~ite18_Out1386428330| |P0Thread1of1ForFork2_#t~ite17_Out1386428330|)) (.cse0 (= (mod ~weak$$choice2~0_In1386428330 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd1~0_In1386428330 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite16_In1386428330| |P0Thread1of1ForFork2_#t~ite16_Out1386428330|) (or (and (= |P0Thread1of1ForFork2_#t~ite18_Out1386428330| ~x$w_buff1_used~0_In1386428330) (= |P0Thread1of1ForFork2_#t~ite17_In1386428330| |P0Thread1of1ForFork2_#t~ite17_Out1386428330|) (not .cse0)) (and (= ~x$w_buff1_used~0_In1386428330 |P0Thread1of1ForFork2_#t~ite17_Out1386428330|) (or .cse1 (and .cse2 .cse3) (and .cse3 .cse4)) .cse5 .cse0))) (let ((.cse6 (not .cse3))) (and (or .cse6 (not .cse2)) (or (not .cse4) .cse6) (= 0 |P0Thread1of1ForFork2_#t~ite16_Out1386428330|) (= |P0Thread1of1ForFork2_#t~ite16_Out1386428330| |P0Thread1of1ForFork2_#t~ite17_Out1386428330|) (not .cse1) .cse5 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1386428330, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In1386428330|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1386428330, P0Thread1of1ForFork2_#t~ite16=|P0Thread1of1ForFork2_#t~ite16_In1386428330|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1386428330, ~weak$$choice2~0=~weak$$choice2~0_In1386428330, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1386428330} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1386428330, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out1386428330|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out1386428330|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1386428330, P0Thread1of1ForFork2_#t~ite16=|P0Thread1of1ForFork2_#t~ite16_Out1386428330|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1386428330, ~weak$$choice2~0=~weak$$choice2~0_In1386428330, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1386428330} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17, P0Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-27 22:46:47,153 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L746-->L747: Formula: (and (not (= (mod v_~weak$$choice2~0_19 256) 0)) (= v_~x$r_buff0_thd1~0_44 v_~x$r_buff0_thd1~0_43)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_44, ~weak$$choice2~0=v_~weak$$choice2~0_19} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_8|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_43, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_7|, ~weak$$choice2~0=v_~weak$$choice2~0_19, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-27 22:46:47,153 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] L747-->L747-8: Formula: (let ((.cse3 (= (mod ~weak$$choice2~0_In1479256769 256) 0)) (.cse4 (= |P0Thread1of1ForFork2_#t~ite23_Out1479256769| |P0Thread1of1ForFork2_#t~ite24_Out1479256769|)) (.cse2 (= (mod ~x$w_buff1_used~0_In1479256769 256) 0)) (.cse6 (= 0 (mod ~x$r_buff0_thd1~0_In1479256769 256))) (.cse1 (= (mod ~x$r_buff1_thd1~0_In1479256769 256) 0)) (.cse5 (= (mod ~x$w_buff0_used~0_In1479256769 256) 0))) (or (let ((.cse0 (not .cse6))) (and (or .cse0 (not .cse1)) (= |P0Thread1of1ForFork2_#t~ite23_Out1479256769| |P0Thread1of1ForFork2_#t~ite22_Out1479256769|) (or .cse0 (not .cse2)) .cse3 .cse4 (not .cse5) (= 0 |P0Thread1of1ForFork2_#t~ite22_Out1479256769|))) (and (= |P0Thread1of1ForFork2_#t~ite22_In1479256769| |P0Thread1of1ForFork2_#t~ite22_Out1479256769|) (or (and (= |P0Thread1of1ForFork2_#t~ite23_Out1479256769| |P0Thread1of1ForFork2_#t~ite23_In1479256769|) (= |P0Thread1of1ForFork2_#t~ite24_Out1479256769| ~x$r_buff1_thd1~0_In1479256769) (not .cse3)) (and .cse3 .cse4 (= |P0Thread1of1ForFork2_#t~ite23_Out1479256769| ~x$r_buff1_thd1~0_In1479256769) (or (and .cse6 .cse2) (and .cse6 .cse1) .cse5)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1479256769, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1479256769, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1479256769, ~weak$$choice2~0=~weak$$choice2~0_In1479256769, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In1479256769|, P0Thread1of1ForFork2_#t~ite22=|P0Thread1of1ForFork2_#t~ite22_In1479256769|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1479256769} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1479256769, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1479256769, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1479256769, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out1479256769|, ~weak$$choice2~0=~weak$$choice2~0_In1479256769, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out1479256769|, P0Thread1of1ForFork2_#t~ite22=|P0Thread1of1ForFork2_#t~ite22_Out1479256769|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1479256769} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23, P0Thread1of1ForFork2_#t~ite22] because there is no mapped edge [2019-12-27 22:46:47,154 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L749-->L757: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~x$mem_tmp~0_5 v_~x~0_18) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_18} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 22:46:47,155 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L799-->L799-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In309752417 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In309752417 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In309752417 256))) (.cse3 (= (mod ~x$r_buff1_thd3~0_In309752417 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite35_Out309752417| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P2Thread1of1ForFork1_#t~ite35_Out309752417| ~x$w_buff1_used~0_In309752417)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In309752417, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In309752417, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In309752417, ~x$w_buff0_used~0=~x$w_buff0_used~0_In309752417} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out309752417|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In309752417, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In309752417, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In309752417, ~x$w_buff0_used~0=~x$w_buff0_used~0_In309752417} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 22:46:47,155 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L800-->L800-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In1131983529 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In1131983529 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite36_Out1131983529| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite36_Out1131983529| ~x$r_buff0_thd3~0_In1131983529)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1131983529, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1131983529} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out1131983529|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1131983529, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1131983529} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 22:46:47,156 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L801-->L801-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd3~0_In464651503 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In464651503 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In464651503 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In464651503 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite37_Out464651503|)) (and (or .cse2 .cse3) (= ~x$r_buff1_thd3~0_In464651503 |P2Thread1of1ForFork1_#t~ite37_Out464651503|) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In464651503, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In464651503, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In464651503, ~x$w_buff0_used~0=~x$w_buff0_used~0_In464651503} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out464651503|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In464651503, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In464651503, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In464651503, ~x$w_buff0_used~0=~x$w_buff0_used~0_In464651503} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 22:46:47,156 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L801-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd3~0_12 |v_P2Thread1of1ForFork1_#t~ite37_8|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 22:46:47,156 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L824-1-->L830: Formula: (and (= v_~__unbuffered_cnt~0_9 3) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 22:46:47,157 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L830-2-->L830-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-87235709 256))) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-87235709 256) 0))) (or (and (or .cse0 .cse1) (= ~x~0_In-87235709 |ULTIMATE.start_main_#t~ite41_Out-87235709|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite41_Out-87235709| ~x$w_buff1~0_In-87235709) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-87235709, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-87235709, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-87235709, ~x~0=~x~0_In-87235709} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-87235709|, ~x$w_buff1~0=~x$w_buff1~0_In-87235709, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-87235709, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-87235709, ~x~0=~x~0_In-87235709} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 22:46:47,157 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L830-4-->L831: Formula: (= v_~x~0_14 |v_ULTIMATE.start_main_#t~ite41_8|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_7|, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-27 22:46:47,157 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L831-->L831-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-45057210 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-45057210 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-45057210| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite43_Out-45057210| ~x$w_buff0_used~0_In-45057210)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-45057210, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-45057210} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-45057210, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-45057210|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-45057210} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 22:46:47,158 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L832-->L832-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In355577671 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In355577671 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In355577671 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In355577671 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite44_Out355577671|)) (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In355577671 |ULTIMATE.start_main_#t~ite44_Out355577671|) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In355577671, ~x$w_buff1_used~0=~x$w_buff1_used~0_In355577671, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In355577671, ~x$w_buff0_used~0=~x$w_buff0_used~0_In355577671} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In355577671, ~x$w_buff1_used~0=~x$w_buff1_used~0_In355577671, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In355577671, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out355577671|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In355577671} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 22:46:47,159 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L833-->L833-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1727178441 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In1727178441 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out1727178441| ~x$r_buff0_thd0~0_In1727178441) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite45_Out1727178441| 0) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1727178441, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1727178441} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1727178441, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1727178441|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1727178441} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 22:46:47,160 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L834-->L834-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-1180156115 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1180156115 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1180156115 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1180156115 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite46_Out-1180156115| ~x$r_buff1_thd0~0_In-1180156115) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite46_Out-1180156115| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1180156115, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1180156115, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1180156115, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1180156115} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1180156115, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1180156115|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1180156115, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1180156115, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1180156115} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 22:46:47,160 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_8 1) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~main$tmp_guard1~0_9 0) (= v_~__unbuffered_p0_EAX~0_8 0) (= v_~x$r_buff1_thd0~0_13 |v_ULTIMATE.start_main_#t~ite46_11|) (= v_~__unbuffered_p2_EBX~0_8 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_9 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_11|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_10|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_13, 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~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 22:46:47,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 10:46:47 BasicIcfg [2019-12-27 22:46:47,259 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 22:46:47,261 INFO L168 Benchmark]: Toolchain (without parser) took 107728.92 ms. Allocated memory was 144.7 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 99.4 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-27 22:46:47,262 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 144.7 MB. Free memory was 119.8 MB in the beginning and 119.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 22:46:47,263 INFO L168 Benchmark]: CACSL2BoogieTranslator took 746.76 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 99.0 MB in the beginning and 155.7 MB in the end (delta: -56.8 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2019-12-27 22:46:47,263 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.07 ms. Allocated memory is still 201.9 MB. Free memory was 155.1 MB in the beginning and 153.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 22:46:47,264 INFO L168 Benchmark]: Boogie Preprocessor took 37.79 ms. Allocated memory is still 201.9 MB. Free memory was 153.1 MB in the beginning and 150.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 22:46:47,266 INFO L168 Benchmark]: RCFGBuilder took 842.44 ms. Allocated memory is still 201.9 MB. Free memory was 150.5 MB in the beginning and 103.9 MB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 7.1 GB. [2019-12-27 22:46:47,267 INFO L168 Benchmark]: TraceAbstraction took 106020.42 ms. Allocated memory was 201.9 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 103.2 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-27 22:46:47,273 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.20 ms. Allocated memory is still 144.7 MB. Free memory was 119.8 MB in the beginning and 119.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 746.76 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 99.0 MB in the beginning and 155.7 MB in the end (delta: -56.8 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 75.07 ms. Allocated memory is still 201.9 MB. Free memory was 155.1 MB in the beginning and 153.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.79 ms. Allocated memory is still 201.9 MB. Free memory was 153.1 MB in the beginning and 150.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 842.44 ms. Allocated memory is still 201.9 MB. Free memory was 150.5 MB in the beginning and 103.9 MB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 106020.42 ms. Allocated memory was 201.9 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 103.2 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.1s, 164 ProgramPointsBefore, 82 ProgramPointsAfterwards, 195 TransitionsBefore, 87 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 8 FixpointIterations, 33 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 25 ConcurrentYvCompositions, 30 ChoiceCompositions, 6629 VarBasedMoverChecksPositive, 194 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 75034 CheckedPairsTotal, 108 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t2351, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L822] FCALL, FORK 0 pthread_create(&t2352, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L767] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L768] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L769] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L770] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L771] 2 x$r_buff0_thd2 = (_Bool)1 [L774] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L824] FCALL, FORK 0 pthread_create(&t2353, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L791] 3 __unbuffered_p2_EAX = y [L794] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L797] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L732] 1 z = 1 [L737] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L738] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L739] 1 x$flush_delayed = weak$$choice2 [L740] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L741] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L777] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L741] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L742] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L742] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L743] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L744] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L745] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L747] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L748] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L798] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L799] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L800] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L831] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L832] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L833] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 155 locations, 2 error locations. Result: UNSAFE, OverallTime: 105.7s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 50.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5243 SDtfs, 9370 SDslu, 23740 SDs, 0 SdLazy, 23402 SolverSat, 592 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 736 GetRequests, 169 SyntacticMatches, 94 SemanticMatches, 473 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10146 ImplicationChecksByTransitivity, 11.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111273occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 29.8s AutomataMinimizationTime, 23 MinimizatonAttempts, 259702 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1028 NumberOfCodeBlocks, 1028 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 949 ConstructedInterpolants, 0 QuantifiedInterpolants, 167344 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...