/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix028_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 16:36:23,299 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 16:36:23,302 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 16:36:23,315 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 16:36:23,315 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 16:36:23,316 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 16:36:23,318 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 16:36:23,319 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 16:36:23,321 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 16:36:23,322 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 16:36:23,323 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 16:36:23,324 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 16:36:23,324 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 16:36:23,325 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 16:36:23,326 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 16:36:23,327 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 16:36:23,328 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 16:36:23,329 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 16:36:23,330 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 16:36:23,332 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 16:36:23,334 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 16:36:23,335 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 16:36:23,336 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 16:36:23,336 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 16:36:23,338 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 16:36:23,339 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 16:36:23,339 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 16:36:23,340 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 16:36:23,340 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 16:36:23,341 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 16:36:23,341 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 16:36:23,342 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 16:36:23,343 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 16:36:23,343 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 16:36:23,344 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 16:36:23,345 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 16:36:23,345 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 16:36:23,345 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 16:36:23,346 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 16:36:23,347 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 16:36:23,347 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 16:36:23,348 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 16:36:23,362 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 16:36:23,362 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 16:36:23,364 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 16:36:23,364 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 16:36:23,364 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 16:36:23,364 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 16:36:23,364 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 16:36:23,365 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 16:36:23,365 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 16:36:23,365 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 16:36:23,365 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 16:36:23,365 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 16:36:23,366 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 16:36:23,366 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 16:36:23,366 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 16:36:23,366 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 16:36:23,366 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 16:36:23,367 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 16:36:23,367 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 16:36:23,367 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 16:36:23,367 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 16:36:23,367 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:36:23,368 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 16:36:23,368 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 16:36:23,368 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 16:36:23,368 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 16:36:23,369 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 16:36:23,369 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 16:36:23,369 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 16:36:23,369 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 16:36:23,369 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 16:36:23,677 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 16:36:23,691 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 16:36:23,694 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 16:36:23,696 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 16:36:23,696 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 16:36:23,697 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix028_rmo.oepc.i [2019-12-27 16:36:23,787 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4859fe970/bba29bbb89044ac8acb975a0ffa69eee/FLAG02d452b35 [2019-12-27 16:36:24,358 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 16:36:24,358 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_rmo.oepc.i [2019-12-27 16:36:24,375 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4859fe970/bba29bbb89044ac8acb975a0ffa69eee/FLAG02d452b35 [2019-12-27 16:36:24,597 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4859fe970/bba29bbb89044ac8acb975a0ffa69eee [2019-12-27 16:36:24,607 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 16:36:24,609 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 16:36:24,610 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 16:36:24,610 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 16:36:24,615 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 16:36:24,616 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:36:24" (1/1) ... [2019-12-27 16:36:24,620 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45b1d233 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:36:24, skipping insertion in model container [2019-12-27 16:36:24,620 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:36:24" (1/1) ... [2019-12-27 16:36:24,629 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 16:36:24,698 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 16:36:25,249 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:36:25,263 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 16:36:25,375 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:36:25,467 INFO L208 MainTranslator]: Completed translation [2019-12-27 16:36:25,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:36:25 WrapperNode [2019-12-27 16:36:25,467 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 16:36:25,468 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 16:36:25,468 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 16:36:25,468 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 16:36:25,475 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:36:25" (1/1) ... [2019-12-27 16:36:25,495 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:36:25" (1/1) ... [2019-12-27 16:36:25,525 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 16:36:25,525 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 16:36:25,526 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 16:36:25,526 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 16:36:25,533 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:36:25" (1/1) ... [2019-12-27 16:36:25,534 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:36:25" (1/1) ... [2019-12-27 16:36:25,539 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:36:25" (1/1) ... [2019-12-27 16:36:25,539 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:36:25" (1/1) ... [2019-12-27 16:36:25,551 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:36:25" (1/1) ... [2019-12-27 16:36:25,556 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:36:25" (1/1) ... [2019-12-27 16:36:25,560 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:36:25" (1/1) ... [2019-12-27 16:36:25,565 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 16:36:25,566 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 16:36:25,566 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 16:36:25,566 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 16:36:25,567 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:36:25" (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 16:36:25,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 16:36:25,640 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 16:36:25,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 16:36:25,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 16:36:25,640 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 16:36:25,640 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 16:36:25,640 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 16:36:25,641 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 16:36:25,641 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 16:36:25,641 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 16:36:25,641 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 16:36:25,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 16:36:25,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 16:36:25,643 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 16:36:26,360 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 16:36:26,361 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 16:36:26,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:36:26 BoogieIcfgContainer [2019-12-27 16:36:26,362 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 16:36:26,364 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 16:36:26,364 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 16:36:26,367 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 16:36:26,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:36:24" (1/3) ... [2019-12-27 16:36:26,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@84b707b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:36:26, skipping insertion in model container [2019-12-27 16:36:26,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:36:25" (2/3) ... [2019-12-27 16:36:26,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@84b707b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:36:26, skipping insertion in model container [2019-12-27 16:36:26,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:36:26" (3/3) ... [2019-12-27 16:36:26,371 INFO L109 eAbstractionObserver]: Analyzing ICFG mix028_rmo.oepc.i [2019-12-27 16:36:26,381 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 16:36:26,381 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 16:36:26,389 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 16:36:26,390 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 16:36:26,433 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,433 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,434 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,435 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,435 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,435 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,436 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,436 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,436 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,437 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,437 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,437 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,437 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,438 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,438 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,438 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,439 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,439 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,439 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,439 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,440 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,440 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,440 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,440 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,441 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,441 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,441 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,444 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,444 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,447 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,447 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,463 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,463 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,487 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,525 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,525 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,527 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,527 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,527 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,530 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,530 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,535 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,537 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:36:26,562 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 16:36:26,582 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 16:36:26,583 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 16:36:26,583 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 16:36:26,583 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 16:36:26,583 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 16:36:26,583 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 16:36:26,583 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 16:36:26,584 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 16:36:26,599 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-27 16:36:26,601 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 16:36:26,715 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 16:36:26,715 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:36:26,733 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 16:36:26,756 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 16:36:26,850 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 16:36:26,851 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:36:26,859 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 16:36:26,881 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 16:36:26,883 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 16:36:29,751 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-12-27 16:36:32,823 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 16:36:32,959 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 16:36:32,989 INFO L206 etLargeBlockEncoding]: Checked pairs total: 87070 [2019-12-27 16:36:32,989 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-27 16:36:32,994 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 102 transitions [2019-12-27 16:36:50,285 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 115112 states. [2019-12-27 16:36:50,287 INFO L276 IsEmpty]: Start isEmpty. Operand 115112 states. [2019-12-27 16:36:50,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 16:36:50,293 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:36:50,294 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 16:36:50,294 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:36:50,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:36:50,300 INFO L82 PathProgramCache]: Analyzing trace with hash 911890, now seen corresponding path program 1 times [2019-12-27 16:36:50,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:36:50,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770821759] [2019-12-27 16:36:50,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:36:50,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:36:50,510 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 16:36:50,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770821759] [2019-12-27 16:36:50,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:36:50,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:36:50,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [336238365] [2019-12-27 16:36:50,514 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:36:50,518 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:36:50,530 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 16:36:50,531 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:36:50,534 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:36:50,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:36:50,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:36:50,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:36:50,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:36:50,552 INFO L87 Difference]: Start difference. First operand 115112 states. Second operand 3 states. [2019-12-27 16:36:54,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:36:54,974 INFO L93 Difference]: Finished difference Result 114158 states and 484836 transitions. [2019-12-27 16:36:54,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:36:54,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 16:36:54,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:36:55,775 INFO L225 Difference]: With dead ends: 114158 [2019-12-27 16:36:55,775 INFO L226 Difference]: Without dead ends: 107060 [2019-12-27 16:36:55,778 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 16:37:02,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107060 states. [2019-12-27 16:37:04,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107060 to 107060. [2019-12-27 16:37:04,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107060 states. [2019-12-27 16:37:08,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107060 states to 107060 states and 454078 transitions. [2019-12-27 16:37:08,880 INFO L78 Accepts]: Start accepts. Automaton has 107060 states and 454078 transitions. Word has length 3 [2019-12-27 16:37:08,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:37:08,880 INFO L462 AbstractCegarLoop]: Abstraction has 107060 states and 454078 transitions. [2019-12-27 16:37:08,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:37:08,880 INFO L276 IsEmpty]: Start isEmpty. Operand 107060 states and 454078 transitions. [2019-12-27 16:37:08,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 16:37:08,885 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:37:08,885 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:37:08,886 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:37:08,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:37:08,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1487504284, now seen corresponding path program 1 times [2019-12-27 16:37:08,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:37:08,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976279106] [2019-12-27 16:37:08,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:37:08,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:37:09,080 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 16:37:09,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976279106] [2019-12-27 16:37:09,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:37:09,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:37:09,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [815883632] [2019-12-27 16:37:09,082 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:37:09,083 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:37:09,086 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 16:37:09,087 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:37:09,087 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:37:09,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:37:09,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:37:09,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:37:09,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:37:09,089 INFO L87 Difference]: Start difference. First operand 107060 states and 454078 transitions. Second operand 4 states. [2019-12-27 16:37:10,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:37:10,297 INFO L93 Difference]: Finished difference Result 166396 states and 678148 transitions. [2019-12-27 16:37:10,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:37:10,298 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 16:37:10,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:37:15,387 INFO L225 Difference]: With dead ends: 166396 [2019-12-27 16:37:15,387 INFO L226 Difference]: Without dead ends: 166347 [2019-12-27 16:37:15,388 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 16:37:20,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166347 states. [2019-12-27 16:37:23,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166347 to 151934. [2019-12-27 16:37:23,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151934 states. [2019-12-27 16:37:24,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151934 states to 151934 states and 627001 transitions. [2019-12-27 16:37:24,684 INFO L78 Accepts]: Start accepts. Automaton has 151934 states and 627001 transitions. Word has length 11 [2019-12-27 16:37:24,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:37:24,684 INFO L462 AbstractCegarLoop]: Abstraction has 151934 states and 627001 transitions. [2019-12-27 16:37:24,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:37:24,684 INFO L276 IsEmpty]: Start isEmpty. Operand 151934 states and 627001 transitions. [2019-12-27 16:37:24,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 16:37:24,691 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:37:24,691 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:37:24,692 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:37:24,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:37:24,692 INFO L82 PathProgramCache]: Analyzing trace with hash 881606285, now seen corresponding path program 1 times [2019-12-27 16:37:24,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:37:24,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630630891] [2019-12-27 16:37:24,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:37:24,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:37:24,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 16:37:24,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630630891] [2019-12-27 16:37:24,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:37:24,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:37:24,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [198603614] [2019-12-27 16:37:24,740 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:37:24,742 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:37:24,743 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 16:37:24,744 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:37:24,744 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:37:24,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:37:24,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:37:24,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:37:24,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:37:24,745 INFO L87 Difference]: Start difference. First operand 151934 states and 627001 transitions. Second operand 3 states. [2019-12-27 16:37:24,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:37:24,908 INFO L93 Difference]: Finished difference Result 33114 states and 107084 transitions. [2019-12-27 16:37:24,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:37:24,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 16:37:24,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:37:24,988 INFO L225 Difference]: With dead ends: 33114 [2019-12-27 16:37:24,988 INFO L226 Difference]: Without dead ends: 33114 [2019-12-27 16:37:24,989 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 16:37:25,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33114 states. [2019-12-27 16:37:25,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33114 to 33114. [2019-12-27 16:37:25,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33114 states. [2019-12-27 16:37:25,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33114 states to 33114 states and 107084 transitions. [2019-12-27 16:37:25,670 INFO L78 Accepts]: Start accepts. Automaton has 33114 states and 107084 transitions. Word has length 13 [2019-12-27 16:37:25,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:37:25,670 INFO L462 AbstractCegarLoop]: Abstraction has 33114 states and 107084 transitions. [2019-12-27 16:37:25,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:37:25,671 INFO L276 IsEmpty]: Start isEmpty. Operand 33114 states and 107084 transitions. [2019-12-27 16:37:25,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 16:37:25,674 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:37:25,674 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:37:25,675 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:37:25,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:37:25,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1702625862, now seen corresponding path program 1 times [2019-12-27 16:37:25,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:37:25,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624970792] [2019-12-27 16:37:25,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:37:25,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:37:25,779 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 16:37:25,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624970792] [2019-12-27 16:37:25,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:37:25,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:37:25,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1739339990] [2019-12-27 16:37:25,780 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:37:25,783 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:37:25,785 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 16:37:25,785 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:37:25,786 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:37:25,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:37:25,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:37:25,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:37:25,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:37:25,787 INFO L87 Difference]: Start difference. First operand 33114 states and 107084 transitions. Second operand 4 states. [2019-12-27 16:37:26,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:37:26,578 INFO L93 Difference]: Finished difference Result 41561 states and 133908 transitions. [2019-12-27 16:37:26,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:37:26,579 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 16:37:26,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:37:26,643 INFO L225 Difference]: With dead ends: 41561 [2019-12-27 16:37:26,644 INFO L226 Difference]: Without dead ends: 41561 [2019-12-27 16:37:26,644 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 16:37:26,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41561 states. [2019-12-27 16:37:27,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41561 to 37204. [2019-12-27 16:37:27,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37204 states. [2019-12-27 16:37:27,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37204 states to 37204 states and 120245 transitions. [2019-12-27 16:37:27,295 INFO L78 Accepts]: Start accepts. Automaton has 37204 states and 120245 transitions. Word has length 16 [2019-12-27 16:37:27,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:37:27,296 INFO L462 AbstractCegarLoop]: Abstraction has 37204 states and 120245 transitions. [2019-12-27 16:37:27,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:37:27,296 INFO L276 IsEmpty]: Start isEmpty. Operand 37204 states and 120245 transitions. [2019-12-27 16:37:27,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 16:37:27,306 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:37:27,306 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 16:37:27,306 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:37:27,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:37:27,307 INFO L82 PathProgramCache]: Analyzing trace with hash -989401703, now seen corresponding path program 1 times [2019-12-27 16:37:27,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:37:27,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494810542] [2019-12-27 16:37:27,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:37:27,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:37:27,429 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 16:37:27,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494810542] [2019-12-27 16:37:27,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:37:27,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:37:27,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [707899203] [2019-12-27 16:37:27,430 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:37:27,435 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:37:27,443 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 34 states and 44 transitions. [2019-12-27 16:37:27,443 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:37:27,444 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:37:27,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:37:27,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:37:27,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:37:27,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:37:27,445 INFO L87 Difference]: Start difference. First operand 37204 states and 120245 transitions. Second operand 5 states. [2019-12-27 16:37:28,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:37:28,080 INFO L93 Difference]: Finished difference Result 47941 states and 152440 transitions. [2019-12-27 16:37:28,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 16:37:28,081 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 16:37:28,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:37:28,154 INFO L225 Difference]: With dead ends: 47941 [2019-12-27 16:37:28,154 INFO L226 Difference]: Without dead ends: 47934 [2019-12-27 16:37:28,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:37:28,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47934 states. [2019-12-27 16:37:29,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47934 to 36849. [2019-12-27 16:37:29,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36849 states. [2019-12-27 16:37:29,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36849 states to 36849 states and 118974 transitions. [2019-12-27 16:37:29,188 INFO L78 Accepts]: Start accepts. Automaton has 36849 states and 118974 transitions. Word has length 22 [2019-12-27 16:37:29,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:37:29,188 INFO L462 AbstractCegarLoop]: Abstraction has 36849 states and 118974 transitions. [2019-12-27 16:37:29,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:37:29,188 INFO L276 IsEmpty]: Start isEmpty. Operand 36849 states and 118974 transitions. [2019-12-27 16:37:29,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 16:37:29,202 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:37:29,202 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 16:37:29,203 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:37:29,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:37:29,203 INFO L82 PathProgramCache]: Analyzing trace with hash -2090054503, now seen corresponding path program 1 times [2019-12-27 16:37:29,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:37:29,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111257788] [2019-12-27 16:37:29,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:37:29,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:37:29,265 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 16:37:29,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111257788] [2019-12-27 16:37:29,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:37:29,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:37:29,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2000261187] [2019-12-27 16:37:29,268 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:37:29,275 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:37:29,286 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 16:37:29,287 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:37:29,346 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:37:29,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:37:29,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:37:29,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:37:29,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:37:29,347 INFO L87 Difference]: Start difference. First operand 36849 states and 118974 transitions. Second operand 5 states. [2019-12-27 16:37:29,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:37:29,426 INFO L93 Difference]: Finished difference Result 15264 states and 46609 transitions. [2019-12-27 16:37:29,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:37:29,427 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 16:37:29,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:37:29,448 INFO L225 Difference]: With dead ends: 15264 [2019-12-27 16:37:29,448 INFO L226 Difference]: Without dead ends: 15264 [2019-12-27 16:37:29,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:37:29,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15264 states. [2019-12-27 16:37:29,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15264 to 14936. [2019-12-27 16:37:29,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14936 states. [2019-12-27 16:37:29,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14936 states to 14936 states and 45673 transitions. [2019-12-27 16:37:29,674 INFO L78 Accepts]: Start accepts. Automaton has 14936 states and 45673 transitions. Word has length 25 [2019-12-27 16:37:29,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:37:29,675 INFO L462 AbstractCegarLoop]: Abstraction has 14936 states and 45673 transitions. [2019-12-27 16:37:29,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:37:29,675 INFO L276 IsEmpty]: Start isEmpty. Operand 14936 states and 45673 transitions. [2019-12-27 16:37:29,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 16:37:29,685 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:37:29,685 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:37:29,685 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:37:29,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:37:29,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1906532401, now seen corresponding path program 1 times [2019-12-27 16:37:29,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:37:29,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620364735] [2019-12-27 16:37:29,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:37:29,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:37:29,733 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 16:37:29,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620364735] [2019-12-27 16:37:29,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:37:29,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:37:29,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [370398371] [2019-12-27 16:37:29,734 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:37:29,739 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:37:29,745 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 16:37:29,745 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:37:29,745 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:37:29,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:37:29,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:37:29,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:37:29,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:37:29,746 INFO L87 Difference]: Start difference. First operand 14936 states and 45673 transitions. Second operand 3 states. [2019-12-27 16:37:29,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:37:29,849 INFO L93 Difference]: Finished difference Result 21267 states and 63997 transitions. [2019-12-27 16:37:29,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:37:29,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 16:37:29,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:37:29,876 INFO L225 Difference]: With dead ends: 21267 [2019-12-27 16:37:29,877 INFO L226 Difference]: Without dead ends: 21267 [2019-12-27 16:37:29,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:37:29,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21267 states. [2019-12-27 16:37:30,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21267 to 15790. [2019-12-27 16:37:30,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15790 states. [2019-12-27 16:37:30,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15790 states to 15790 states and 48131 transitions. [2019-12-27 16:37:30,136 INFO L78 Accepts]: Start accepts. Automaton has 15790 states and 48131 transitions. Word has length 27 [2019-12-27 16:37:30,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:37:30,137 INFO L462 AbstractCegarLoop]: Abstraction has 15790 states and 48131 transitions. [2019-12-27 16:37:30,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:37:30,137 INFO L276 IsEmpty]: Start isEmpty. Operand 15790 states and 48131 transitions. [2019-12-27 16:37:30,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 16:37:30,147 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:37:30,147 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:37:30,148 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:37:30,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:37:30,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1466938041, now seen corresponding path program 1 times [2019-12-27 16:37:30,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:37:30,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339915301] [2019-12-27 16:37:30,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:37:30,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:37:30,268 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 16:37:30,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339915301] [2019-12-27 16:37:30,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:37:30,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:37:30,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [222271644] [2019-12-27 16:37:30,269 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:37:30,274 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:37:30,280 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 16:37:30,280 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:37:30,281 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:37:30,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:37:30,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:37:30,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:37:30,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:37:30,282 INFO L87 Difference]: Start difference. First operand 15790 states and 48131 transitions. Second operand 6 states. [2019-12-27 16:37:31,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:37:31,057 INFO L93 Difference]: Finished difference Result 40724 states and 122204 transitions. [2019-12-27 16:37:31,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 16:37:31,057 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 16:37:31,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:37:31,114 INFO L225 Difference]: With dead ends: 40724 [2019-12-27 16:37:31,114 INFO L226 Difference]: Without dead ends: 40724 [2019-12-27 16:37:31,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 16:37:31,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40724 states. [2019-12-27 16:37:31,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40724 to 22567. [2019-12-27 16:37:31,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22567 states. [2019-12-27 16:37:31,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22567 states to 22567 states and 69647 transitions. [2019-12-27 16:37:31,817 INFO L78 Accepts]: Start accepts. Automaton has 22567 states and 69647 transitions. Word has length 27 [2019-12-27 16:37:31,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:37:31,818 INFO L462 AbstractCegarLoop]: Abstraction has 22567 states and 69647 transitions. [2019-12-27 16:37:31,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:37:31,818 INFO L276 IsEmpty]: Start isEmpty. Operand 22567 states and 69647 transitions. [2019-12-27 16:37:31,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 16:37:31,835 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:37:31,836 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:37:31,836 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:37:31,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:37:31,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1177717026, now seen corresponding path program 1 times [2019-12-27 16:37:31,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:37:31,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874533017] [2019-12-27 16:37:31,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:37:31,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:37:31,944 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 16:37:31,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874533017] [2019-12-27 16:37:31,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:37:31,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:37:31,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1103190072] [2019-12-27 16:37:31,945 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:37:31,951 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:37:31,961 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 29 states and 28 transitions. [2019-12-27 16:37:31,961 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:37:31,962 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:37:31,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:37:31,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:37:31,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:37:31,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:37:31,964 INFO L87 Difference]: Start difference. First operand 22567 states and 69647 transitions. Second operand 5 states. [2019-12-27 16:37:32,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:37:32,162 INFO L93 Difference]: Finished difference Result 23708 states and 71203 transitions. [2019-12-27 16:37:32,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:37:32,162 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 16:37:32,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:37:32,207 INFO L225 Difference]: With dead ends: 23708 [2019-12-27 16:37:32,207 INFO L226 Difference]: Without dead ends: 23708 [2019-12-27 16:37:32,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:37:32,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23708 states. [2019-12-27 16:37:32,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23708 to 20875. [2019-12-27 16:37:32,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20875 states. [2019-12-27 16:37:32,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20875 states to 20875 states and 62374 transitions. [2019-12-27 16:37:32,603 INFO L78 Accepts]: Start accepts. Automaton has 20875 states and 62374 transitions. Word has length 28 [2019-12-27 16:37:32,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:37:32,603 INFO L462 AbstractCegarLoop]: Abstraction has 20875 states and 62374 transitions. [2019-12-27 16:37:32,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:37:32,604 INFO L276 IsEmpty]: Start isEmpty. Operand 20875 states and 62374 transitions. [2019-12-27 16:37:32,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 16:37:32,620 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:37:32,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] [2019-12-27 16:37:32,620 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:37:32,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:37:32,620 INFO L82 PathProgramCache]: Analyzing trace with hash 443754453, now seen corresponding path program 1 times [2019-12-27 16:37:32,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:37:32,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33650181] [2019-12-27 16:37:32,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:37:32,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:37:32,732 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 16:37:32,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33650181] [2019-12-27 16:37:32,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:37:32,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:37:32,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1391117123] [2019-12-27 16:37:32,733 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:37:32,739 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:37:32,746 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 30 states and 29 transitions. [2019-12-27 16:37:32,746 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:37:32,747 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:37:32,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:37:32,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:37:32,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:37:32,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:37:32,748 INFO L87 Difference]: Start difference. First operand 20875 states and 62374 transitions. Second operand 6 states. [2019-12-27 16:37:33,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:37:33,363 INFO L93 Difference]: Finished difference Result 31783 states and 93408 transitions. [2019-12-27 16:37:33,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 16:37:33,363 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-27 16:37:33,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:37:33,422 INFO L225 Difference]: With dead ends: 31783 [2019-12-27 16:37:33,422 INFO L226 Difference]: Without dead ends: 31783 [2019-12-27 16:37:33,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:37:33,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31783 states. [2019-12-27 16:37:33,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31783 to 20735. [2019-12-27 16:37:33,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20735 states. [2019-12-27 16:37:33,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20735 states to 20735 states and 61934 transitions. [2019-12-27 16:37:33,827 INFO L78 Accepts]: Start accepts. Automaton has 20735 states and 61934 transitions. Word has length 29 [2019-12-27 16:37:33,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:37:33,828 INFO L462 AbstractCegarLoop]: Abstraction has 20735 states and 61934 transitions. [2019-12-27 16:37:33,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:37:33,828 INFO L276 IsEmpty]: Start isEmpty. Operand 20735 states and 61934 transitions. [2019-12-27 16:37:33,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 16:37:33,849 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:37:33,849 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] [2019-12-27 16:37:33,850 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:37:33,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:37:33,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1088633804, now seen corresponding path program 1 times [2019-12-27 16:37:33,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:37:33,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44706920] [2019-12-27 16:37:33,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:37:33,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:37:33,975 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 16:37:33,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44706920] [2019-12-27 16:37:33,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:37:33,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:37:33,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1116106177] [2019-12-27 16:37:33,977 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:37:33,983 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:37:34,001 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 56 states and 77 transitions. [2019-12-27 16:37:34,001 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:37:34,001 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:37:34,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:37:34,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:37:34,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:37:34,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:37:34,003 INFO L87 Difference]: Start difference. First operand 20735 states and 61934 transitions. Second operand 7 states. [2019-12-27 16:37:35,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:37:35,666 INFO L93 Difference]: Finished difference Result 41886 states and 122219 transitions. [2019-12-27 16:37:35,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 16:37:35,667 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 16:37:35,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:37:35,723 INFO L225 Difference]: With dead ends: 41886 [2019-12-27 16:37:35,723 INFO L226 Difference]: Without dead ends: 41886 [2019-12-27 16:37:35,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-27 16:37:35,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41886 states. [2019-12-27 16:37:36,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41886 to 22758. [2019-12-27 16:37:36,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22758 states. [2019-12-27 16:37:36,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22758 states to 22758 states and 67949 transitions. [2019-12-27 16:37:36,189 INFO L78 Accepts]: Start accepts. Automaton has 22758 states and 67949 transitions. Word has length 33 [2019-12-27 16:37:36,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:37:36,189 INFO L462 AbstractCegarLoop]: Abstraction has 22758 states and 67949 transitions. [2019-12-27 16:37:36,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:37:36,190 INFO L276 IsEmpty]: Start isEmpty. Operand 22758 states and 67949 transitions. [2019-12-27 16:37:36,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 16:37:36,210 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:37:36,211 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] [2019-12-27 16:37:36,211 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:37:36,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:37:36,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1090977820, now seen corresponding path program 2 times [2019-12-27 16:37:36,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:37:36,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073758344] [2019-12-27 16:37:36,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:37:36,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:37:36,338 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 16:37:36,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073758344] [2019-12-27 16:37:36,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:37:36,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:37:36,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [459297561] [2019-12-27 16:37:36,340 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:37:36,347 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:37:36,370 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 64 states and 93 transitions. [2019-12-27 16:37:36,370 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:37:36,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:37:36,420 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 16:37:36,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 16:37:36,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:37:36,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 16:37:36,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:37:36,421 INFO L87 Difference]: Start difference. First operand 22758 states and 67949 transitions. Second operand 9 states. [2019-12-27 16:37:39,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:37:39,441 INFO L93 Difference]: Finished difference Result 63275 states and 182307 transitions. [2019-12-27 16:37:39,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-27 16:37:39,442 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-12-27 16:37:39,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:37:39,541 INFO L225 Difference]: With dead ends: 63275 [2019-12-27 16:37:39,542 INFO L226 Difference]: Without dead ends: 63275 [2019-12-27 16:37:39,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=327, Invalid=1079, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 16:37:40,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63275 states. [2019-12-27 16:37:40,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63275 to 25321. [2019-12-27 16:37:40,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25321 states. [2019-12-27 16:37:40,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25321 states to 25321 states and 75442 transitions. [2019-12-27 16:37:40,455 INFO L78 Accepts]: Start accepts. Automaton has 25321 states and 75442 transitions. Word has length 33 [2019-12-27 16:37:40,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:37:40,455 INFO L462 AbstractCegarLoop]: Abstraction has 25321 states and 75442 transitions. [2019-12-27 16:37:40,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 16:37:40,455 INFO L276 IsEmpty]: Start isEmpty. Operand 25321 states and 75442 transitions. [2019-12-27 16:37:40,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-27 16:37:40,477 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:37:40,477 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] [2019-12-27 16:37:40,478 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:37:40,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:37:40,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1352546088, now seen corresponding path program 1 times [2019-12-27 16:37:40,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:37:40,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335311761] [2019-12-27 16:37:40,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:37:40,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:37:40,606 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 16:37:40,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335311761] [2019-12-27 16:37:40,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:37:40,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:37:40,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1343563156] [2019-12-27 16:37:40,607 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:37:40,614 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:37:40,636 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 62 states and 87 transitions. [2019-12-27 16:37:40,636 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:37:40,663 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:37:40,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 16:37:40,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:37:40,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 16:37:40,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:37:40,664 INFO L87 Difference]: Start difference. First operand 25321 states and 75442 transitions. Second operand 8 states. [2019-12-27 16:37:43,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:37:43,297 INFO L93 Difference]: Finished difference Result 55410 states and 162917 transitions. [2019-12-27 16:37:43,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 16:37:43,298 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2019-12-27 16:37:43,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:37:43,428 INFO L225 Difference]: With dead ends: 55410 [2019-12-27 16:37:43,428 INFO L226 Difference]: Without dead ends: 55410 [2019-12-27 16:37:43,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2019-12-27 16:37:43,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55410 states. [2019-12-27 16:37:44,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55410 to 23687. [2019-12-27 16:37:44,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23687 states. [2019-12-27 16:37:44,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23687 states to 23687 states and 70762 transitions. [2019-12-27 16:37:44,854 INFO L78 Accepts]: Start accepts. Automaton has 23687 states and 70762 transitions. Word has length 35 [2019-12-27 16:37:44,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:37:44,855 INFO L462 AbstractCegarLoop]: Abstraction has 23687 states and 70762 transitions. [2019-12-27 16:37:44,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 16:37:44,855 INFO L276 IsEmpty]: Start isEmpty. Operand 23687 states and 70762 transitions. [2019-12-27 16:37:44,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 16:37:44,898 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:37:44,899 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 16:37:44,899 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:37:44,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:37:44,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1017444534, now seen corresponding path program 1 times [2019-12-27 16:37:44,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:37:44,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445603638] [2019-12-27 16:37:44,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:37:44,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:37:44,959 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 16:37:44,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445603638] [2019-12-27 16:37:44,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:37:44,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:37:44,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [323004998] [2019-12-27 16:37:44,960 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:37:44,973 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:37:45,050 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 172 states and 346 transitions. [2019-12-27 16:37:45,050 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:37:45,052 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:37:45,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:37:45,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:37:45,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:37:45,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:37:45,053 INFO L87 Difference]: Start difference. First operand 23687 states and 70762 transitions. Second operand 3 states. [2019-12-27 16:37:45,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:37:45,161 INFO L93 Difference]: Finished difference Result 23686 states and 70760 transitions. [2019-12-27 16:37:45,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:37:45,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 16:37:45,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:37:45,200 INFO L225 Difference]: With dead ends: 23686 [2019-12-27 16:37:45,200 INFO L226 Difference]: Without dead ends: 23686 [2019-12-27 16:37:45,201 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 16:37:45,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23686 states. [2019-12-27 16:37:45,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23686 to 23686. [2019-12-27 16:37:45,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23686 states. [2019-12-27 16:37:45,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23686 states to 23686 states and 70760 transitions. [2019-12-27 16:37:45,554 INFO L78 Accepts]: Start accepts. Automaton has 23686 states and 70760 transitions. Word has length 39 [2019-12-27 16:37:45,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:37:45,554 INFO L462 AbstractCegarLoop]: Abstraction has 23686 states and 70760 transitions. [2019-12-27 16:37:45,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:37:45,554 INFO L276 IsEmpty]: Start isEmpty. Operand 23686 states and 70760 transitions. [2019-12-27 16:37:45,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 16:37:45,581 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:37:45,581 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] [2019-12-27 16:37:45,582 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:37:45,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:37:45,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1228033379, now seen corresponding path program 1 times [2019-12-27 16:37:45,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:37:45,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623181667] [2019-12-27 16:37:45,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:37:45,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:37:45,622 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 16:37:45,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623181667] [2019-12-27 16:37:45,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:37:45,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:37:45,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1624583363] [2019-12-27 16:37:45,623 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:37:45,631 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:37:45,716 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 209 states and 382 transitions. [2019-12-27 16:37:45,717 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:37:45,722 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:37:45,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:37:45,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:37:45,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:37:45,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:37:45,724 INFO L87 Difference]: Start difference. First operand 23686 states and 70760 transitions. Second operand 3 states. [2019-12-27 16:37:45,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:37:45,874 INFO L93 Difference]: Finished difference Result 44964 states and 134419 transitions. [2019-12-27 16:37:45,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:37:45,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-27 16:37:45,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:37:45,908 INFO L225 Difference]: With dead ends: 44964 [2019-12-27 16:37:45,908 INFO L226 Difference]: Without dead ends: 24115 [2019-12-27 16:37:45,908 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 16:37:45,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24115 states. [2019-12-27 16:37:46,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24115 to 24049. [2019-12-27 16:37:46,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24049 states. [2019-12-27 16:37:46,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24049 states to 24049 states and 70487 transitions. [2019-12-27 16:37:46,278 INFO L78 Accepts]: Start accepts. Automaton has 24049 states and 70487 transitions. Word has length 40 [2019-12-27 16:37:46,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:37:46,279 INFO L462 AbstractCegarLoop]: Abstraction has 24049 states and 70487 transitions. [2019-12-27 16:37:46,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:37:46,279 INFO L276 IsEmpty]: Start isEmpty. Operand 24049 states and 70487 transitions. [2019-12-27 16:37:46,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 16:37:46,304 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:37:46,304 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] [2019-12-27 16:37:46,304 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:37:46,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:37:46,304 INFO L82 PathProgramCache]: Analyzing trace with hash 342200019, now seen corresponding path program 2 times [2019-12-27 16:37:46,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:37:46,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924168821] [2019-12-27 16:37:46,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:37:46,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:37:46,377 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 16:37:46,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924168821] [2019-12-27 16:37:46,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:37:46,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:37:46,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1302548098] [2019-12-27 16:37:46,378 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:37:46,386 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:37:46,468 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 209 states and 415 transitions. [2019-12-27 16:37:46,468 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:37:46,510 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 16:37:46,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:37:46,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:37:46,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:37:46,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:37:46,511 INFO L87 Difference]: Start difference. First operand 24049 states and 70487 transitions. Second operand 6 states. [2019-12-27 16:37:46,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:37:46,961 INFO L93 Difference]: Finished difference Result 28780 states and 82197 transitions. [2019-12-27 16:37:46,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:37:46,962 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-27 16:37:46,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:37:46,999 INFO L225 Difference]: With dead ends: 28780 [2019-12-27 16:37:46,999 INFO L226 Difference]: Without dead ends: 28780 [2019-12-27 16:37:46,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:37:47,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28780 states. [2019-12-27 16:37:47,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28780 to 19736. [2019-12-27 16:37:47,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19736 states. [2019-12-27 16:37:47,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19736 states to 19736 states and 56860 transitions. [2019-12-27 16:37:47,574 INFO L78 Accepts]: Start accepts. Automaton has 19736 states and 56860 transitions. Word has length 40 [2019-12-27 16:37:47,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:37:47,574 INFO L462 AbstractCegarLoop]: Abstraction has 19736 states and 56860 transitions. [2019-12-27 16:37:47,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:37:47,574 INFO L276 IsEmpty]: Start isEmpty. Operand 19736 states and 56860 transitions. [2019-12-27 16:37:47,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 16:37:47,592 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:37:47,593 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] [2019-12-27 16:37:47,593 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:37:47,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:37:47,593 INFO L82 PathProgramCache]: Analyzing trace with hash -2044650148, now seen corresponding path program 1 times [2019-12-27 16:37:47,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:37:47,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118511785] [2019-12-27 16:37:47,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:37:47,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:37:47,673 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 16:37:47,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118511785] [2019-12-27 16:37:47,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:37:47,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:37:47,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [752685575] [2019-12-27 16:37:47,674 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:37:47,683 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:37:47,762 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 186 states and 371 transitions. [2019-12-27 16:37:47,762 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:37:47,763 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:37:47,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:37:47,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:37:47,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:37:47,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:37:47,764 INFO L87 Difference]: Start difference. First operand 19736 states and 56860 transitions. Second operand 3 states. [2019-12-27 16:37:47,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:37:47,840 INFO L93 Difference]: Finished difference Result 19736 states and 56784 transitions. [2019-12-27 16:37:47,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:37:47,841 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-27 16:37:47,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:37:47,866 INFO L225 Difference]: With dead ends: 19736 [2019-12-27 16:37:47,866 INFO L226 Difference]: Without dead ends: 19736 [2019-12-27 16:37:47,867 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 16:37:47,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19736 states. [2019-12-27 16:37:48,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19736 to 16455. [2019-12-27 16:37:48,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16455 states. [2019-12-27 16:37:48,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16455 states to 16455 states and 47695 transitions. [2019-12-27 16:37:48,122 INFO L78 Accepts]: Start accepts. Automaton has 16455 states and 47695 transitions. Word has length 41 [2019-12-27 16:37:48,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:37:48,122 INFO L462 AbstractCegarLoop]: Abstraction has 16455 states and 47695 transitions. [2019-12-27 16:37:48,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:37:48,122 INFO L276 IsEmpty]: Start isEmpty. Operand 16455 states and 47695 transitions. [2019-12-27 16:37:48,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 16:37:48,138 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:37:48,138 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:37:48,138 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:37:48,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:37:48,139 INFO L82 PathProgramCache]: Analyzing trace with hash 884175412, now seen corresponding path program 1 times [2019-12-27 16:37:48,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:37:48,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57434261] [2019-12-27 16:37:48,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:37:48,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:37:48,192 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 16:37:48,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57434261] [2019-12-27 16:37:48,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:37:48,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:37:48,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1593780035] [2019-12-27 16:37:48,194 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:37:48,203 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:37:48,273 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 187 states and 372 transitions. [2019-12-27 16:37:48,273 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:37:48,320 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 16:37:48,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:37:48,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:37:48,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:37:48,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:37:48,321 INFO L87 Difference]: Start difference. First operand 16455 states and 47695 transitions. Second operand 7 states. [2019-12-27 16:37:48,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:37:48,402 INFO L93 Difference]: Finished difference Result 15262 states and 45144 transitions. [2019-12-27 16:37:48,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:37:48,403 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2019-12-27 16:37:48,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:37:48,421 INFO L225 Difference]: With dead ends: 15262 [2019-12-27 16:37:48,421 INFO L226 Difference]: Without dead ends: 14003 [2019-12-27 16:37:48,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:37:48,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14003 states. [2019-12-27 16:37:48,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14003 to 14003. [2019-12-27 16:37:48,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14003 states. [2019-12-27 16:37:48,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14003 states to 14003 states and 42458 transitions. [2019-12-27 16:37:48,613 INFO L78 Accepts]: Start accepts. Automaton has 14003 states and 42458 transitions. Word has length 42 [2019-12-27 16:37:48,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:37:48,613 INFO L462 AbstractCegarLoop]: Abstraction has 14003 states and 42458 transitions. [2019-12-27 16:37:48,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:37:48,613 INFO L276 IsEmpty]: Start isEmpty. Operand 14003 states and 42458 transitions. [2019-12-27 16:37:48,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:37:48,628 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:37:48,628 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:37:48,628 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:37:48,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:37:48,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1215626616, now seen corresponding path program 1 times [2019-12-27 16:37:48,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:37:48,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684458846] [2019-12-27 16:37:48,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:37:48,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:37:48,709 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 16:37:48,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684458846] [2019-12-27 16:37:48,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:37:48,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:37:48,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [249833337] [2019-12-27 16:37:48,710 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:37:48,754 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:37:49,112 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 286 states and 549 transitions. [2019-12-27 16:37:49,112 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:37:49,382 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 16:37:49,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 16:37:49,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:37:49,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 16:37:49,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-27 16:37:49,384 INFO L87 Difference]: Start difference. First operand 14003 states and 42458 transitions. Second operand 12 states. [2019-12-27 16:37:50,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:37:50,830 INFO L93 Difference]: Finished difference Result 41087 states and 122893 transitions. [2019-12-27 16:37:50,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 16:37:50,830 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-27 16:37:50,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:37:50,870 INFO L225 Difference]: With dead ends: 41087 [2019-12-27 16:37:50,870 INFO L226 Difference]: Without dead ends: 29327 [2019-12-27 16:37:50,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2019-12-27 16:37:50,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29327 states. [2019-12-27 16:37:51,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29327 to 16639. [2019-12-27 16:37:51,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16639 states. [2019-12-27 16:37:51,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16639 states to 16639 states and 50135 transitions. [2019-12-27 16:37:51,208 INFO L78 Accepts]: Start accepts. Automaton has 16639 states and 50135 transitions. Word has length 66 [2019-12-27 16:37:51,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:37:51,208 INFO L462 AbstractCegarLoop]: Abstraction has 16639 states and 50135 transitions. [2019-12-27 16:37:51,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 16:37:51,208 INFO L276 IsEmpty]: Start isEmpty. Operand 16639 states and 50135 transitions. [2019-12-27 16:37:51,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:37:51,225 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:37:51,225 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:37:51,225 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:37:51,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:37:51,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1961322332, now seen corresponding path program 2 times [2019-12-27 16:37:51,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:37:51,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599409700] [2019-12-27 16:37:51,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:37:51,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:37:51,339 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 16:37:51,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599409700] [2019-12-27 16:37:51,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:37:51,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 16:37:51,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1586145988] [2019-12-27 16:37:51,340 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:37:51,362 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:37:51,919 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 383 states and 807 transitions. [2019-12-27 16:37:51,920 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:37:52,225 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 21 times. [2019-12-27 16:37:52,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 16:37:52,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:37:52,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 16:37:52,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-12-27 16:37:52,227 INFO L87 Difference]: Start difference. First operand 16639 states and 50135 transitions. Second operand 14 states. [2019-12-27 16:37:57,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:37:57,183 INFO L93 Difference]: Finished difference Result 46393 states and 135288 transitions. [2019-12-27 16:37:57,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-27 16:37:57,183 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 66 [2019-12-27 16:37:57,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:37:57,241 INFO L225 Difference]: With dead ends: 46393 [2019-12-27 16:37:57,241 INFO L226 Difference]: Without dead ends: 46097 [2019-12-27 16:37:57,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 42 SyntacticMatches, 6 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 725 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=527, Invalid=2229, Unknown=0, NotChecked=0, Total=2756 [2019-12-27 16:37:57,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46097 states. [2019-12-27 16:37:57,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46097 to 22324. [2019-12-27 16:37:57,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22324 states. [2019-12-27 16:37:57,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22324 states to 22324 states and 66838 transitions. [2019-12-27 16:37:57,771 INFO L78 Accepts]: Start accepts. Automaton has 22324 states and 66838 transitions. Word has length 66 [2019-12-27 16:37:57,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:37:57,771 INFO L462 AbstractCegarLoop]: Abstraction has 22324 states and 66838 transitions. [2019-12-27 16:37:57,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 16:37:57,771 INFO L276 IsEmpty]: Start isEmpty. Operand 22324 states and 66838 transitions. [2019-12-27 16:37:57,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:37:57,798 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:37:57,798 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:37:57,798 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:37:57,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:37:57,799 INFO L82 PathProgramCache]: Analyzing trace with hash -178270044, now seen corresponding path program 3 times [2019-12-27 16:37:57,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:37:57,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283085850] [2019-12-27 16:37:57,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:37:57,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:37:57,909 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 16:37:57,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283085850] [2019-12-27 16:37:57,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:37:57,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 16:37:57,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1613440007] [2019-12-27 16:37:57,911 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:37:57,931 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:37:58,190 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 296 states and 586 transitions. [2019-12-27 16:37:58,190 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:37:58,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:37:58,581 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 31 times. [2019-12-27 16:37:58,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 16:37:58,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:37:58,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 16:37:58,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-12-27 16:37:58,582 INFO L87 Difference]: Start difference. First operand 22324 states and 66838 transitions. Second operand 14 states. [2019-12-27 16:38:02,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:38:02,189 INFO L93 Difference]: Finished difference Result 51882 states and 154698 transitions. [2019-12-27 16:38:02,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 16:38:02,194 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 66 [2019-12-27 16:38:02,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:38:02,252 INFO L225 Difference]: With dead ends: 51882 [2019-12-27 16:38:02,253 INFO L226 Difference]: Without dead ends: 43591 [2019-12-27 16:38:02,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 21 SyntacticMatches, 11 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=151, Invalid=605, Unknown=0, NotChecked=0, Total=756 [2019-12-27 16:38:02,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43591 states. [2019-12-27 16:38:02,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43591 to 23029. [2019-12-27 16:38:02,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23029 states. [2019-12-27 16:38:02,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23029 states to 23029 states and 68490 transitions. [2019-12-27 16:38:02,725 INFO L78 Accepts]: Start accepts. Automaton has 23029 states and 68490 transitions. Word has length 66 [2019-12-27 16:38:02,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:38:02,726 INFO L462 AbstractCegarLoop]: Abstraction has 23029 states and 68490 transitions. [2019-12-27 16:38:02,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 16:38:02,726 INFO L276 IsEmpty]: Start isEmpty. Operand 23029 states and 68490 transitions. [2019-12-27 16:38:02,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:38:02,749 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:38:02,750 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:38:02,750 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:38:02,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:38:02,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1109171142, now seen corresponding path program 4 times [2019-12-27 16:38:02,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:38:02,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174336413] [2019-12-27 16:38:02,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:38:02,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:38:02,855 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 16:38:02,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174336413] [2019-12-27 16:38:02,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:38:02,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 16:38:02,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1122667318] [2019-12-27 16:38:02,857 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:38:02,877 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:38:03,095 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 247 states and 479 transitions. [2019-12-27 16:38:03,095 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:38:03,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:38:03,350 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 16:38:03,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 16:38:03,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:38:03,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 16:38:03,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-27 16:38:03,352 INFO L87 Difference]: Start difference. First operand 23029 states and 68490 transitions. Second operand 14 states. [2019-12-27 16:38:05,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:38:05,186 INFO L93 Difference]: Finished difference Result 40306 states and 119732 transitions. [2019-12-27 16:38:05,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 16:38:05,187 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 66 [2019-12-27 16:38:05,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:38:05,233 INFO L225 Difference]: With dead ends: 40306 [2019-12-27 16:38:05,233 INFO L226 Difference]: Without dead ends: 33956 [2019-12-27 16:38:05,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2019-12-27 16:38:05,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33956 states. [2019-12-27 16:38:05,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33956 to 22805. [2019-12-27 16:38:05,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22805 states. [2019-12-27 16:38:05,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22805 states to 22805 states and 67778 transitions. [2019-12-27 16:38:05,945 INFO L78 Accepts]: Start accepts. Automaton has 22805 states and 67778 transitions. Word has length 66 [2019-12-27 16:38:05,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:38:05,945 INFO L462 AbstractCegarLoop]: Abstraction has 22805 states and 67778 transitions. [2019-12-27 16:38:05,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 16:38:05,945 INFO L276 IsEmpty]: Start isEmpty. Operand 22805 states and 67778 transitions. [2019-12-27 16:38:05,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:38:05,975 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:38:05,975 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:38:05,975 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:38:05,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:38:05,976 INFO L82 PathProgramCache]: Analyzing trace with hash 191706936, now seen corresponding path program 5 times [2019-12-27 16:38:05,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:38:05,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805975495] [2019-12-27 16:38:05,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:38:06,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:38:06,214 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 16:38:06,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805975495] [2019-12-27 16:38:06,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:38:06,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 16:38:06,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [88979258] [2019-12-27 16:38:06,215 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:38:06,234 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:38:06,507 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 293 states and 579 transitions. [2019-12-27 16:38:06,507 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:38:06,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 16:38:06,983 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 22 times. [2019-12-27 16:38:06,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 16:38:06,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:38:06,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 16:38:06,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-12-27 16:38:06,985 INFO L87 Difference]: Start difference. First operand 22805 states and 67778 transitions. Second operand 18 states. [2019-12-27 16:38:11,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:38:11,882 INFO L93 Difference]: Finished difference Result 60115 states and 178130 transitions. [2019-12-27 16:38:11,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-27 16:38:11,883 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 66 [2019-12-27 16:38:11,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:38:11,952 INFO L225 Difference]: With dead ends: 60115 [2019-12-27 16:38:11,953 INFO L226 Difference]: Without dead ends: 49790 [2019-12-27 16:38:11,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 10 SyntacticMatches, 7 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 627 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=446, Invalid=2206, Unknown=0, NotChecked=0, Total=2652 [2019-12-27 16:38:12,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49790 states. [2019-12-27 16:38:12,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49790 to 21963. [2019-12-27 16:38:12,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21963 states. [2019-12-27 16:38:12,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21963 states to 21963 states and 65285 transitions. [2019-12-27 16:38:12,781 INFO L78 Accepts]: Start accepts. Automaton has 21963 states and 65285 transitions. Word has length 66 [2019-12-27 16:38:12,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:38:12,781 INFO L462 AbstractCegarLoop]: Abstraction has 21963 states and 65285 transitions. [2019-12-27 16:38:12,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 16:38:12,781 INFO L276 IsEmpty]: Start isEmpty. Operand 21963 states and 65285 transitions. [2019-12-27 16:38:12,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:38:12,802 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:38:12,802 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:38:12,802 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:38:12,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:38:12,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1594558236, now seen corresponding path program 6 times [2019-12-27 16:38:12,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:38:12,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470473374] [2019-12-27 16:38:12,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:38:12,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:38:12,877 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 16:38:12,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470473374] [2019-12-27 16:38:12,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:38:12,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:38:12,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [697333676] [2019-12-27 16:38:12,878 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:38:12,899 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:38:13,218 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 299 states and 582 transitions. [2019-12-27 16:38:13,218 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:38:13,222 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 16:38:13,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:38:13,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:38:13,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:38:13,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:38:13,223 INFO L87 Difference]: Start difference. First operand 21963 states and 65285 transitions. Second operand 3 states. [2019-12-27 16:38:13,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:38:13,334 INFO L93 Difference]: Finished difference Result 24275 states and 72017 transitions. [2019-12-27 16:38:13,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:38:13,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 16:38:13,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:38:13,363 INFO L225 Difference]: With dead ends: 24275 [2019-12-27 16:38:13,363 INFO L226 Difference]: Without dead ends: 24275 [2019-12-27 16:38:13,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 4 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 16:38:13,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24275 states. [2019-12-27 16:38:13,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24275 to 20711. [2019-12-27 16:38:13,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20711 states. [2019-12-27 16:38:13,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20711 states to 20711 states and 61622 transitions. [2019-12-27 16:38:13,689 INFO L78 Accepts]: Start accepts. Automaton has 20711 states and 61622 transitions. Word has length 66 [2019-12-27 16:38:13,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:38:13,689 INFO L462 AbstractCegarLoop]: Abstraction has 20711 states and 61622 transitions. [2019-12-27 16:38:13,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:38:13,689 INFO L276 IsEmpty]: Start isEmpty. Operand 20711 states and 61622 transitions. [2019-12-27 16:38:13,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 16:38:13,709 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:38:13,709 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:38:13,709 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:38:13,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:38:13,709 INFO L82 PathProgramCache]: Analyzing trace with hash 765672949, now seen corresponding path program 1 times [2019-12-27 16:38:13,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:38:13,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834154732] [2019-12-27 16:38:13,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:38:13,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:38:14,008 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 16:38:14,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834154732] [2019-12-27 16:38:14,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:38:14,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 16:38:14,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1877990947] [2019-12-27 16:38:14,009 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:38:14,030 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:38:14,777 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 313 states and 626 transitions. [2019-12-27 16:38:14,777 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:38:15,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 16:38:15,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 16:38:15,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 16:38:15,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:38:16,085 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 37 times. [2019-12-27 16:38:16,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-27 16:38:16,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:38:16,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-27 16:38:16,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2019-12-27 16:38:16,087 INFO L87 Difference]: Start difference. First operand 20711 states and 61622 transitions. Second operand 25 states. [2019-12-27 16:38:19,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:38:19,386 INFO L93 Difference]: Finished difference Result 24475 states and 72501 transitions. [2019-12-27 16:38:19,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 16:38:19,387 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 67 [2019-12-27 16:38:19,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:38:19,419 INFO L225 Difference]: With dead ends: 24475 [2019-12-27 16:38:19,419 INFO L226 Difference]: Without dead ends: 24050 [2019-12-27 16:38:19,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 13 SyntacticMatches, 14 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=237, Invalid=1023, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 16:38:19,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24050 states. [2019-12-27 16:38:19,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24050 to 20457. [2019-12-27 16:38:19,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20457 states. [2019-12-27 16:38:19,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20457 states to 20457 states and 60978 transitions. [2019-12-27 16:38:19,731 INFO L78 Accepts]: Start accepts. Automaton has 20457 states and 60978 transitions. Word has length 67 [2019-12-27 16:38:19,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:38:19,731 INFO L462 AbstractCegarLoop]: Abstraction has 20457 states and 60978 transitions. [2019-12-27 16:38:19,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-27 16:38:19,731 INFO L276 IsEmpty]: Start isEmpty. Operand 20457 states and 60978 transitions. [2019-12-27 16:38:19,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 16:38:19,750 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:38:19,750 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:38:19,750 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:38:19,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:38:19,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1127178005, now seen corresponding path program 2 times [2019-12-27 16:38:19,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:38:19,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898556444] [2019-12-27 16:38:19,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:38:19,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:38:19,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:38:19,876 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 16:38:19,877 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 16:38:19,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [893] [893] ULTIMATE.startENTRY-->L823: Formula: (let ((.cse0 (store |v_#valid_82| 0 0))) (and (= 0 v_~z$r_buff1_thd3~0_333) (= 0 v_~__unbuffered_cnt~0_79) (= v_~z~0_222 0) (= 0 v_~x~0_150) (= 0 v_~z$flush_delayed~0_66) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t757~0.base_43| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t757~0.base_43|) |v_ULTIMATE.start_main_~#t757~0.offset_29| 0))) (= |v_ULTIMATE.start_main_~#t757~0.offset_29| 0) (= v_~__unbuffered_p2_EBX~0_70 0) (= |v_#valid_80| (store .cse0 |v_ULTIMATE.start_main_~#t757~0.base_43| 1)) (= v_~y~0_71 0) (= v_~z$read_delayed_var~0.base_8 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~z$r_buff0_thd1~0_186 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t757~0.base_43|) 0) (= v_~z$w_buff1_used~0_670 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t757~0.base_43|) (= v_~z$r_buff0_thd2~0_110 0) (= 0 v_~weak$$choice0~0_29) (= v_~z$w_buff0~0_701 0) (= v_~z$r_buff1_thd0~0_201 0) (= (store |v_#length_28| |v_ULTIMATE.start_main_~#t757~0.base_43| 4) |v_#length_27|) (= v_~z$read_delayed~0_7 0) (= 0 v_~z$r_buff0_thd3~0_363) (= 0 v_~__unbuffered_p2_EAX~0_62) (= |v_#NULL.offset_5| 0) (= v_~z$mem_tmp~0_43 0) (= v_~z$r_buff0_thd0~0_137 0) (= v_~weak$$choice2~0_160 0) (= v_~z$r_buff1_thd1~0_144 0) (= v_~z$r_buff1_thd2~0_165 0) (= v_~z$w_buff0_used~0_1072 0) (= v_~z$w_buff1~0_410 0) (= v_~main$tmp_guard0~0_24 0) (= v_~main$tmp_guard1~0_54 0) (= 0 |v_#NULL.base_5|) (= v_~z$read_delayed_var~0.offset_8 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_82|, #memory_int=|v_#memory_int_18|, #length=|v_#length_28|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_165, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_46|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_202|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_46|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_120|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_137, ULTIMATE.start_main_~#t759~0.offset=|v_ULTIMATE.start_main_~#t759~0.offset_21|, #length=|v_#length_27|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_62, ULTIMATE.start_main_~#t757~0.base=|v_ULTIMATE.start_main_~#t757~0.base_43|, ~z$mem_tmp~0=v_~z$mem_tmp~0_43, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_70, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_670, ~z$flush_delayed~0=v_~z$flush_delayed~0_66, ULTIMATE.start_main_~#t759~0.base=|v_ULTIMATE.start_main_~#t759~0.base_29|, ULTIMATE.start_main_~#t758~0.base=|v_ULTIMATE.start_main_~#t758~0.base_37|, ~weak$$choice0~0=v_~weak$$choice0~0_29, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_~#t757~0.offset=|v_ULTIMATE.start_main_~#t757~0.offset_29|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_144, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_363, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, ~x~0=v_~x~0_150, ULTIMATE.start_main_~#t758~0.offset=|v_ULTIMATE.start_main_~#t758~0.offset_22|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_410, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_54, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_74|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_34|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_201, ~y~0=v_~y~0_71, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_110, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_26|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1072, ~z$w_buff0~0=v_~z$w_buff0~0_701, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_10|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_333, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_80|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_222, ~weak$$choice2~0=v_~weak$$choice2~0_160, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_186} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_~#t758~0.offset, ULTIMATE.start_main_#t~ite47, ~z$read_delayed~0, #NULL.offset, ~z$w_buff1~0, ULTIMATE.start_main_#t~ite49, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t759~0.offset, #length, ~__unbuffered_p2_EAX~0, ~y~0, ULTIMATE.start_main_~#t757~0.base, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t759~0.base, #NULL.base, ULTIMATE.start_main_~#t758~0.base, ~weak$$choice0~0, ULTIMATE.start_main_~#t757~0.offset, ULTIMATE.start_main_#res, ~z$r_buff1_thd1~0, #valid, #memory_int, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 16:38:19,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] L823-1-->L825: Formula: (and (= |v_ULTIMATE.start_main_~#t758~0.offset_10| 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t758~0.base_11| 4)) (= (store |v_#valid_34| |v_ULTIMATE.start_main_~#t758~0.base_11| 1) |v_#valid_33|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t758~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t758~0.base_11|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t758~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t758~0.base_11|) |v_ULTIMATE.start_main_~#t758~0.offset_10| 1)) |v_#memory_int_13|) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t758~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t758~0.base=|v_ULTIMATE.start_main_~#t758~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, ULTIMATE.start_main_~#t758~0.offset=|v_ULTIMATE.start_main_~#t758~0.offset_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t758~0.base, ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_~#t758~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 16:38:19,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] P0ENTRY-->L4-3: Formula: (and (= v_P0Thread1of1ForFork0_~arg.offset_21 |v_P0Thread1of1ForFork0_#in~arg.offset_21|) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_21|) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_23 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_21|) (= v_~z$w_buff0_used~0_174 1) (= v_P0Thread1of1ForFork0_~arg.base_21 |v_P0Thread1of1ForFork0_#in~arg.base_21|) (= v_~z$w_buff0~0_53 v_~z$w_buff1~0_38) (= v_~z$w_buff0_used~0_175 v_~z$w_buff1_used~0_104) (= (mod v_~z$w_buff1_used~0_104 256) 0) (= 1 v_~z$w_buff0~0_52)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_21|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_175, ~z$w_buff0~0=v_~z$w_buff0~0_53, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_21|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_21|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_174, ~z$w_buff0~0=v_~z$w_buff0~0_52, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_23, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_104, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_21|, ~z$w_buff1~0=v_~z$w_buff1~0_38, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_21, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_21|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_21} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 16:38:19,884 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L825-1-->L827: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t759~0.offset_9|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t759~0.base_10|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t759~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t759~0.base_10|) |v_ULTIMATE.start_main_~#t759~0.offset_9| 2)) |v_#memory_int_11|) (= (store |v_#valid_30| |v_ULTIMATE.start_main_~#t759~0.base_10| 1) |v_#valid_29|) (not (= |v_ULTIMATE.start_main_~#t759~0.base_10| 0)) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t759~0.base_10|) 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t759~0.base_10| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t759~0.offset=|v_ULTIMATE.start_main_~#t759~0.offset_9|, #valid=|v_#valid_29|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t759~0.base=|v_ULTIMATE.start_main_~#t759~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t759~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t759~0.base] because there is no mapped edge [2019-12-27 16:38:19,888 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L764-2-->L764-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In352314653 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In352314653 256)))) (or (and (not .cse0) (= ~z$w_buff1~0_In352314653 |P1Thread1of1ForFork1_#t~ite9_Out352314653|) (not .cse1)) (and (or .cse1 .cse0) (= ~z~0_In352314653 |P1Thread1of1ForFork1_#t~ite9_Out352314653|)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In352314653, ~z$w_buff1_used~0=~z$w_buff1_used~0_In352314653, ~z$w_buff1~0=~z$w_buff1~0_In352314653, ~z~0=~z~0_In352314653} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out352314653|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In352314653, ~z$w_buff1_used~0=~z$w_buff1_used~0_In352314653, ~z$w_buff1~0=~z$w_buff1~0_In352314653, ~z~0=~z~0_In352314653} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-27 16:38:19,890 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L789-->L789-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1503316999 256)))) (or (and .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-1503316999 256) 0))) (or (and .cse1 (= (mod ~z$r_buff1_thd3~0_In-1503316999 256) 0)) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In-1503316999 256))) (= (mod ~z$w_buff0_used~0_In-1503316999 256) 0))) (= |P2Thread1of1ForFork2_#t~ite20_Out-1503316999| ~z$w_buff0~0_In-1503316999) (= |P2Thread1of1ForFork2_#t~ite21_Out-1503316999| |P2Thread1of1ForFork2_#t~ite20_Out-1503316999|)) (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite20_In-1503316999| |P2Thread1of1ForFork2_#t~ite20_Out-1503316999|) (= |P2Thread1of1ForFork2_#t~ite21_Out-1503316999| ~z$w_buff0~0_In-1503316999)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-1503316999, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1503316999, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_In-1503316999|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1503316999, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1503316999, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1503316999, ~weak$$choice2~0=~weak$$choice2~0_In-1503316999} OutVars{~z$w_buff0~0=~z$w_buff0~0_In-1503316999, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out-1503316999|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1503316999, P2Thread1of1ForFork2_#t~ite21=|P2Thread1of1ForFork2_#t~ite21_Out-1503316999|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1503316999, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1503316999, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1503316999, ~weak$$choice2~0=~weak$$choice2~0_In-1503316999} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, P2Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-27 16:38:19,891 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L745-->L745-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-321020768 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-321020768 256)))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-321020768| 0)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-321020768| ~z$w_buff0_used~0_In-321020768) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-321020768, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-321020768} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-321020768|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-321020768, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-321020768} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 16:38:19,892 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L746-->L746-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In-2108527698 256))) (.cse3 (= (mod ~z$r_buff0_thd1~0_In-2108527698 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-2108527698 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd1~0_In-2108527698 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite6_Out-2108527698| ~z$w_buff1_used~0_In-2108527698)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out-2108527698| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2108527698, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-2108527698, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2108527698, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2108527698} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-2108527698|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2108527698, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-2108527698, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2108527698, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2108527698} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 16:38:19,893 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L747-->L748: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1922287713 256))) (.cse0 (= (mod ~z$r_buff0_thd1~0_In-1922287713 256) 0))) (or (and (not .cse0) (= ~z$r_buff0_thd1~0_Out-1922287713 0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd1~0_In-1922287713 ~z$r_buff0_thd1~0_Out-1922287713)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1922287713, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1922287713} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1922287713, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1922287713|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1922287713} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 16:38:19,893 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L748-->L748-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd1~0_In1853646263 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In1853646263 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In1853646263 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1853646263 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1853646263|)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~z$r_buff1_thd1~0_In1853646263 |P0Thread1of1ForFork0_#t~ite8_Out1853646263|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1853646263, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1853646263, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1853646263, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1853646263} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1853646263, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1853646263|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1853646263, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1853646263, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1853646263} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 16:38:19,893 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L748-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_62 |v_P0Thread1of1ForFork0_#t~ite8_24|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_24|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_23|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_62, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 16:38:19,894 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L790-->L790-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In310797707 256)))) (or (and (not .cse0) (= ~z$w_buff1~0_In310797707 |P2Thread1of1ForFork2_#t~ite24_Out310797707|) (= |P2Thread1of1ForFork2_#t~ite23_In310797707| |P2Thread1of1ForFork2_#t~ite23_Out310797707|)) (and (= ~z$w_buff1~0_In310797707 |P2Thread1of1ForFork2_#t~ite23_Out310797707|) (= |P2Thread1of1ForFork2_#t~ite24_Out310797707| |P2Thread1of1ForFork2_#t~ite23_Out310797707|) .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In310797707 256) 0))) (or (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In310797707 256))) (= (mod ~z$w_buff0_used~0_In310797707 256) 0) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In310797707 256)))))))) InVars {P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_In310797707|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In310797707, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In310797707, ~z$w_buff1_used~0=~z$w_buff1_used~0_In310797707, ~z$w_buff1~0=~z$w_buff1~0_In310797707, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In310797707, ~weak$$choice2~0=~weak$$choice2~0_In310797707} OutVars{P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_Out310797707|, P2Thread1of1ForFork2_#t~ite24=|P2Thread1of1ForFork2_#t~ite24_Out310797707|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In310797707, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In310797707, ~z$w_buff1_used~0=~z$w_buff1_used~0_In310797707, ~z$w_buff1~0=~z$w_buff1~0_In310797707, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In310797707, ~weak$$choice2~0=~weak$$choice2~0_In310797707} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-27 16:38:19,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L791-->L791-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1599845806 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite27_Out1599845806| |P2Thread1of1ForFork2_#t~ite26_Out1599845806|) (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1599845806 256)))) (or (and (= 0 (mod ~z$r_buff1_thd3~0_In1599845806 256)) .cse0) (and .cse0 (= (mod ~z$w_buff1_used~0_In1599845806 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In1599845806 256)))) (= ~z$w_buff0_used~0_In1599845806 |P2Thread1of1ForFork2_#t~ite26_Out1599845806|) .cse1) (and (= |P2Thread1of1ForFork2_#t~ite27_Out1599845806| ~z$w_buff0_used~0_In1599845806) (= |P2Thread1of1ForFork2_#t~ite26_In1599845806| |P2Thread1of1ForFork2_#t~ite26_Out1599845806|) (not .cse1)))) InVars {P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_In1599845806|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1599845806, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1599845806, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1599845806, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1599845806, ~weak$$choice2~0=~weak$$choice2~0_In1599845806} OutVars{P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_Out1599845806|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1599845806, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1599845806, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1599845806, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1599845806, ~weak$$choice2~0=~weak$$choice2~0_In1599845806, P2Thread1of1ForFork2_#t~ite27=|P2Thread1of1ForFork2_#t~ite27_Out1599845806|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite26, P2Thread1of1ForFork2_#t~ite27] because there is no mapped edge [2019-12-27 16:38:19,898 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [812] [812] L793-->L794: Formula: (and (not (= (mod v_~weak$$choice2~0_37 256) 0)) (= v_~z$r_buff0_thd3~0_119 v_~z$r_buff0_thd3~0_118)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_119, ~weak$$choice2~0=v_~weak$$choice2~0_37} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_8|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_8|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_118, ~weak$$choice2~0=v_~weak$$choice2~0_37} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 16:38:19,900 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L764-4-->L765: Formula: (= |v_P1Thread1of1ForFork1_#t~ite9_8| v_~z~0_16) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_8|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_7|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_7|, ~z~0=v_~z~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~z~0] because there is no mapped edge [2019-12-27 16:38:19,901 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L765-->L765-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In176752721 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In176752721 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out176752721| 0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out176752721| ~z$w_buff0_used~0_In176752721) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In176752721, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In176752721} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In176752721, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out176752721|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In176752721} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 16:38:19,902 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [816] [816] L766-->L766-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In51158859 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In51158859 256))) (.cse3 (= (mod ~z$r_buff1_thd2~0_In51158859 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In51158859 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite12_Out51158859| ~z$w_buff1_used~0_In51158859) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite12_Out51158859| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In51158859, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In51158859, ~z$w_buff1_used~0=~z$w_buff1_used~0_In51158859, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In51158859} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In51158859, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In51158859, ~z$w_buff1_used~0=~z$w_buff1_used~0_In51158859, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out51158859|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In51158859} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 16:38:19,905 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L767-->L767-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1138249556 256))) (.cse0 (= (mod ~z$r_buff0_thd2~0_In1138249556 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd2~0_In1138249556 |P1Thread1of1ForFork1_#t~ite13_Out1138249556|)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite13_Out1138249556|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1138249556, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1138249556} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1138249556, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1138249556|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1138249556} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 16:38:19,906 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [811] [811] L796-->L800: Formula: (and (= v_~z~0_64 v_~z$mem_tmp~0_7) (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= 0 v_~z$flush_delayed~0_9)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_7, P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_64} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 16:38:19,907 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L800-2-->L800-5: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In473971681 256))) (.cse0 (= |P2Thread1of1ForFork2_#t~ite39_Out473971681| |P2Thread1of1ForFork2_#t~ite38_Out473971681|)) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In473971681 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite38_Out473971681| ~z~0_In473971681) .cse0 (or .cse1 .cse2)) (and (not .cse1) .cse0 (= |P2Thread1of1ForFork2_#t~ite38_Out473971681| ~z$w_buff1~0_In473971681) (not .cse2)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In473971681, ~z$w_buff1_used~0=~z$w_buff1_used~0_In473971681, ~z$w_buff1~0=~z$w_buff1~0_In473971681, ~z~0=~z~0_In473971681} OutVars{~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In473971681, ~z$w_buff1_used~0=~z$w_buff1_used~0_In473971681, ~z$w_buff1~0=~z$w_buff1~0_In473971681, ~z~0=~z~0_In473971681, P2Thread1of1ForFork2_#t~ite39=|P2Thread1of1ForFork2_#t~ite39_Out473971681|, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out473971681|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-27 16:38:19,909 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L801-->L801-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-1114573364 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1114573364 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite40_Out-1114573364| ~z$w_buff0_used~0_In-1114573364)) (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite40_Out-1114573364| 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1114573364, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1114573364} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1114573364, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1114573364, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out-1114573364|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-27 16:38:19,911 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L802-->L802-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In2080764905 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In2080764905 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In2080764905 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In2080764905 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In2080764905 |P2Thread1of1ForFork2_#t~ite41_Out2080764905|)) (and (= 0 |P2Thread1of1ForFork2_#t~ite41_Out2080764905|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2080764905, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2080764905, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2080764905, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2080764905} OutVars{P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out2080764905|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2080764905, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2080764905, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2080764905, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2080764905} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-27 16:38:19,912 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L768-->L768-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-182742799 256))) (.cse0 (= (mod ~z$r_buff0_thd2~0_In-182742799 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In-182742799 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-182742799 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite14_Out-182742799| ~z$r_buff1_thd2~0_In-182742799) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite14_Out-182742799| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-182742799, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-182742799, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-182742799, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-182742799} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-182742799, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-182742799, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-182742799, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-182742799|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-182742799} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 16:38:19,912 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite14_28| v_~z$r_buff1_thd2~0_70) (= v_~__unbuffered_cnt~0_49 (+ v_~__unbuffered_cnt~0_50 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_28|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_70, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_27|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 16:38:19,914 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L803-->L803-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1714178568 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1714178568 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite42_Out-1714178568| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite42_Out-1714178568| ~z$r_buff0_thd3~0_In-1714178568)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1714178568, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1714178568} OutVars{P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out-1714178568|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1714178568, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1714178568} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-27 16:38:19,915 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L804-->L804-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1831562174 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-1831562174 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-1831562174 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd3~0_In-1831562174 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite43_Out-1831562174| ~z$r_buff1_thd3~0_In-1831562174) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P2Thread1of1ForFork2_#t~ite43_Out-1831562174| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1831562174, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1831562174, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1831562174, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1831562174} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1831562174, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1831562174, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out-1831562174|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1831562174, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1831562174} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-27 16:38:19,915 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L804-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_44 1) v_~__unbuffered_cnt~0_43) (= v_~z$r_buff1_thd3~0_119 |v_P2Thread1of1ForFork2_#t~ite43_28|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_119, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_27|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 16:38:19,915 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L827-1-->L833: Formula: (and (= v_~main$tmp_guard0~0_9 1) (= 3 v_~__unbuffered_cnt~0_34)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 16:38:19,917 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L833-2-->L833-5: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1225323237 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite48_Out-1225323237| |ULTIMATE.start_main_#t~ite47_Out-1225323237|)) (.cse0 (= (mod ~z$w_buff1_used~0_In-1225323237 256) 0))) (or (and (or .cse0 .cse1) .cse2 (= ~z~0_In-1225323237 |ULTIMATE.start_main_#t~ite47_Out-1225323237|)) (and (not .cse1) .cse2 (= ~z$w_buff1~0_In-1225323237 |ULTIMATE.start_main_#t~ite47_Out-1225323237|) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1225323237, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1225323237, ~z$w_buff1~0=~z$w_buff1~0_In-1225323237, ~z~0=~z~0_In-1225323237} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1225323237, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1225323237|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1225323237, ~z$w_buff1~0=~z$w_buff1~0_In-1225323237, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-1225323237|, ~z~0=~z~0_In-1225323237} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 16:38:19,918 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L834-->L834-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In356232439 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In356232439 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite49_Out356232439|) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In356232439 |ULTIMATE.start_main_#t~ite49_Out356232439|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In356232439, ~z$w_buff0_used~0=~z$w_buff0_used~0_In356232439} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In356232439, ~z$w_buff0_used~0=~z$w_buff0_used~0_In356232439, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out356232439|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 16:38:19,919 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L835-->L835-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-24964262 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-24964262 256))) (.cse3 (= (mod ~z$r_buff1_thd0~0_In-24964262 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-24964262 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-24964262 |ULTIMATE.start_main_#t~ite50_Out-24964262|)) (and (= 0 |ULTIMATE.start_main_#t~ite50_Out-24964262|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-24964262, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-24964262, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-24964262, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-24964262} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-24964262|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-24964262, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-24964262, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-24964262, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-24964262} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 16:38:19,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L836-->L836-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1145677599 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1145677599 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite51_Out-1145677599|)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd0~0_In-1145677599 |ULTIMATE.start_main_#t~ite51_Out-1145677599|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1145677599, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1145677599} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1145677599, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1145677599|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1145677599} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 16:38:19,921 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [814] [814] L837-->L837-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In1355231797 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1355231797 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1355231797 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In1355231797 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out1355231797|)) (and (or .cse3 .cse2) (= ~z$r_buff1_thd0~0_In1355231797 |ULTIMATE.start_main_#t~ite52_Out1355231797|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1355231797, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1355231797, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1355231797, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1355231797} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1355231797|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1355231797, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1355231797, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1355231797, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1355231797} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 16:38:19,922 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L837-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y~0_37 2) (= 2 v_~__unbuffered_p2_EAX~0_30) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~__unbuffered_p2_EBX~0_37 0) (= 2 v_~x~0_117) (= v_~main$tmp_guard1~0_27 0) (= (mod v_~main$tmp_guard1~0_27 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~z$r_buff1_thd0~0_162 |v_ULTIMATE.start_main_#t~ite52_69|)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_69|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_37, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_30, ~y~0=v_~y~0_37, ~x~0=v_~x~0_117} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_68|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_37, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_162, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_27, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_30, ~y~0=v_~y~0_37, ~x~0=v_~x~0_117, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 16:38:20,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:38:20 BasicIcfg [2019-12-27 16:38:20,035 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 16:38:20,038 INFO L168 Benchmark]: Toolchain (without parser) took 115429.00 ms. Allocated memory was 141.0 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 97.1 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-12-27 16:38:20,038 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 141.0 MB. Free memory was 117.4 MB in the beginning and 117.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 16:38:20,039 INFO L168 Benchmark]: CACSL2BoogieTranslator took 857.30 ms. Allocated memory was 141.0 MB in the beginning and 199.2 MB in the end (delta: 58.2 MB). Free memory was 96.7 MB in the beginning and 152.3 MB in the end (delta: -55.7 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-12-27 16:38:20,039 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.33 ms. Allocated memory is still 199.2 MB. Free memory was 152.3 MB in the beginning and 149.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 16:38:20,040 INFO L168 Benchmark]: Boogie Preprocessor took 40.10 ms. Allocated memory is still 199.2 MB. Free memory was 149.5 MB in the beginning and 147.3 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-12-27 16:38:20,040 INFO L168 Benchmark]: RCFGBuilder took 796.56 ms. Allocated memory is still 199.2 MB. Free memory was 147.3 MB in the beginning and 97.5 MB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. [2019-12-27 16:38:20,041 INFO L168 Benchmark]: TraceAbstraction took 113672.04 ms. Allocated memory was 199.2 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 96.7 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-12-27 16:38:20,045 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 141.0 MB. Free memory was 117.4 MB in the beginning and 117.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 857.30 ms. Allocated memory was 141.0 MB in the beginning and 199.2 MB in the end (delta: 58.2 MB). Free memory was 96.7 MB in the beginning and 152.3 MB in the end (delta: -55.7 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 57.33 ms. Allocated memory is still 199.2 MB. Free memory was 152.3 MB in the beginning and 149.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.10 ms. Allocated memory is still 199.2 MB. Free memory was 149.5 MB in the beginning and 147.3 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 796.56 ms. Allocated memory is still 199.2 MB. Free memory was 147.3 MB in the beginning and 97.5 MB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 113672.04 ms. Allocated memory was 199.2 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 96.7 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.3s, 175 ProgramPointsBefore, 93 ProgramPointsAfterwards, 212 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 32 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 32 ChoiceCompositions, 6798 VarBasedMoverChecksPositive, 289 VarBasedMoverChecksNegative, 75 SemBasedMoverChecksPositive, 285 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 0 MoverChecksTotal, 87070 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L823] FCALL, FORK 0 pthread_create(&t757, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L734] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L735] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L736] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L737] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L738] 1 z$r_buff0_thd1 = (_Bool)1 [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L825] FCALL, FORK 0 pthread_create(&t758, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L827] FCALL, FORK 0 pthread_create(&t759, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 2 x = 2 [L761] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 3 y = 2 [L781] 3 __unbuffered_p2_EAX = y [L784] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L785] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L786] 3 z$flush_delayed = weak$$choice2 [L787] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __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=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L788] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, __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=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L788] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L744] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L745] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L746] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L789] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L790] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L791] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L792] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __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 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=2, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L792] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __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 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=2, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L765] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L794] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L795] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __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=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L800] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __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=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L801] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L767] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L802] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L803] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L833] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __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=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L833] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L834] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L835] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L836] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 113.2s, OverallIterations: 26, TraceHistogramMax: 1, AutomataDifference: 44.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5859 SDtfs, 9105 SDslu, 24673 SDs, 0 SdLazy, 18352 SolverSat, 509 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 529 GetRequests, 137 SyntacticMatches, 64 SemanticMatches, 328 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2463 ImplicationChecksByTransitivity, 8.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=151934occurred 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: 34.7s AutomataMinimizationTime, 25 MinimizatonAttempts, 272052 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1034 NumberOfCodeBlocks, 1034 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 942 ConstructedInterpolants, 0 QuantifiedInterpolants, 227217 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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...