/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix025_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 22:00:12,421 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 22:00:12,424 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 22:00:12,436 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 22:00:12,436 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 22:00:12,437 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 22:00:12,438 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 22:00:12,440 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 22:00:12,442 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 22:00:12,443 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 22:00:12,444 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 22:00:12,445 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 22:00:12,445 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 22:00:12,446 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 22:00:12,447 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 22:00:12,448 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 22:00:12,449 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 22:00:12,450 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 22:00:12,451 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 22:00:12,453 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 22:00:12,455 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 22:00:12,456 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 22:00:12,457 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 22:00:12,458 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 22:00:12,460 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 22:00:12,460 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 22:00:12,461 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 22:00:12,462 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 22:00:12,462 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 22:00:12,463 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 22:00:12,463 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 22:00:12,464 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 22:00:12,464 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 22:00:12,465 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 22:00:12,466 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 22:00:12,466 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 22:00:12,467 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 22:00:12,467 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 22:00:12,467 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 22:00:12,468 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 22:00:12,469 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 22:00:12,470 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 22:00:12,484 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 22:00:12,485 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 22:00:12,486 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 22:00:12,486 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 22:00:12,486 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 22:00:12,486 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 22:00:12,486 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 22:00:12,487 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 22:00:12,487 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 22:00:12,487 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 22:00:12,487 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 22:00:12,487 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 22:00:12,488 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 22:00:12,488 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 22:00:12,488 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 22:00:12,488 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 22:00:12,488 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 22:00:12,488 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 22:00:12,489 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 22:00:12,489 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 22:00:12,489 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 22:00:12,489 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 22:00:12,489 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 22:00:12,490 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 22:00:12,490 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 22:00:12,490 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 22:00:12,490 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 22:00:12,490 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 22:00:12,491 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 22:00:12,491 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 22:00:12,760 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 22:00:12,779 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 22:00:12,783 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 22:00:12,784 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 22:00:12,785 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 22:00:12,785 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix025_pso.oepc.i [2019-12-26 22:00:12,844 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba6540ba3/91a96c86fae24e4399233dfbf1198202/FLAGab121d5f8 [2019-12-26 22:00:13,428 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 22:00:13,429 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix025_pso.oepc.i [2019-12-26 22:00:13,442 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba6540ba3/91a96c86fae24e4399233dfbf1198202/FLAGab121d5f8 [2019-12-26 22:00:13,738 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba6540ba3/91a96c86fae24e4399233dfbf1198202 [2019-12-26 22:00:13,746 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 22:00:13,748 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 22:00:13,750 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 22:00:13,750 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 22:00:13,755 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 22:00:13,756 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:00:13" (1/1) ... [2019-12-26 22:00:13,758 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32a7d1ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:00:13, skipping insertion in model container [2019-12-26 22:00:13,759 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:00:13" (1/1) ... [2019-12-26 22:00:13,766 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 22:00:13,825 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 22:00:14,299 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:00:14,310 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 22:00:14,398 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:00:14,478 INFO L208 MainTranslator]: Completed translation [2019-12-26 22:00:14,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:00:14 WrapperNode [2019-12-26 22:00:14,479 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 22:00:14,480 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 22:00:14,480 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 22:00:14,480 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 22:00:14,488 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:00:14" (1/1) ... [2019-12-26 22:00:14,511 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:00:14" (1/1) ... [2019-12-26 22:00:14,542 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 22:00:14,542 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 22:00:14,542 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 22:00:14,543 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 22:00:14,551 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:00:14" (1/1) ... [2019-12-26 22:00:14,551 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:00:14" (1/1) ... [2019-12-26 22:00:14,555 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:00:14" (1/1) ... [2019-12-26 22:00:14,556 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:00:14" (1/1) ... [2019-12-26 22:00:14,567 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:00:14" (1/1) ... [2019-12-26 22:00:14,571 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:00:14" (1/1) ... [2019-12-26 22:00:14,575 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:00:14" (1/1) ... [2019-12-26 22:00:14,580 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 22:00:14,580 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 22:00:14,580 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 22:00:14,581 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 22:00:14,581 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:00:14" (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-26 22:00:14,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 22:00:14,648 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 22:00:14,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 22:00:14,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 22:00:14,648 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 22:00:14,649 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 22:00:14,649 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 22:00:14,650 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 22:00:14,650 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 22:00:14,651 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 22:00:14,651 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 22:00:14,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 22:00:14,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 22:00:14,654 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 22:00:15,359 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 22:00:15,359 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 22:00:15,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:00:15 BoogieIcfgContainer [2019-12-26 22:00:15,361 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 22:00:15,362 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 22:00:15,362 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 22:00:15,367 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 22:00:15,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 10:00:13" (1/3) ... [2019-12-26 22:00:15,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45215d34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:00:15, skipping insertion in model container [2019-12-26 22:00:15,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:00:14" (2/3) ... [2019-12-26 22:00:15,370 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45215d34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:00:15, skipping insertion in model container [2019-12-26 22:00:15,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:00:15" (3/3) ... [2019-12-26 22:00:15,373 INFO L109 eAbstractionObserver]: Analyzing ICFG mix025_pso.oepc.i [2019-12-26 22:00:15,383 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 22:00:15,383 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 22:00:15,398 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 22:00:15,399 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 22:00:15,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,463 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,464 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,464 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,465 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,465 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,490 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,491 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,491 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,494 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,494 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,508 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,508 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,535 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,537 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,544 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,544 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,545 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,550 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,550 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:15,568 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 22:00:15,588 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 22:00:15,588 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 22:00:15,588 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 22:00:15,588 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 22:00:15,588 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 22:00:15,588 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 22:00:15,588 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 22:00:15,589 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 22:00:15,604 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-26 22:00:15,606 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-26 22:00:15,712 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-26 22:00:15,713 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:00:15,730 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 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/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 22:00:15,757 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-26 22:00:15,814 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-26 22:00:15,814 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:00:15,823 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 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/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 22:00:15,844 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-26 22:00:15,845 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 22:00:20,961 WARN L192 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-26 22:00:21,080 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-26 22:00:21,320 INFO L206 etLargeBlockEncoding]: Checked pairs total: 130103 [2019-12-26 22:00:21,321 INFO L214 etLargeBlockEncoding]: Total number of compositions: 120 [2019-12-26 22:00:21,325 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 105 transitions [2019-12-26 22:00:43,255 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 122102 states. [2019-12-26 22:00:43,257 INFO L276 IsEmpty]: Start isEmpty. Operand 122102 states. [2019-12-26 22:00:43,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-26 22:00:43,262 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:00:43,262 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-26 22:00:43,263 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-26 22:00:43,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:00:43,268 INFO L82 PathProgramCache]: Analyzing trace with hash 913940, now seen corresponding path program 1 times [2019-12-26 22:00:43,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:00:43,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554393944] [2019-12-26 22:00:43,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:00:43,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:00:43,472 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-26 22:00:43,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554393944] [2019-12-26 22:00:43,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:00:43,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:00:43,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591083855] [2019-12-26 22:00:43,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:00:43,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:00:43,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:00:43,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:00:43,497 INFO L87 Difference]: Start difference. First operand 122102 states. Second operand 3 states. [2019-12-26 22:00:47,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:00:47,270 INFO L93 Difference]: Finished difference Result 121140 states and 517588 transitions. [2019-12-26 22:00:47,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:00:47,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-26 22:00:47,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:00:48,037 INFO L225 Difference]: With dead ends: 121140 [2019-12-26 22:00:48,038 INFO L226 Difference]: Without dead ends: 107958 [2019-12-26 22:00:48,040 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-26 22:00:54,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107958 states. [2019-12-26 22:00:57,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107958 to 107958. [2019-12-26 22:00:57,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107958 states. [2019-12-26 22:01:01,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107958 states to 107958 states and 460128 transitions. [2019-12-26 22:01:01,950 INFO L78 Accepts]: Start accepts. Automaton has 107958 states and 460128 transitions. Word has length 3 [2019-12-26 22:01:01,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:01:01,950 INFO L462 AbstractCegarLoop]: Abstraction has 107958 states and 460128 transitions. [2019-12-26 22:01:01,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:01:01,951 INFO L276 IsEmpty]: Start isEmpty. Operand 107958 states and 460128 transitions. [2019-12-26 22:01:01,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 22:01:01,955 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:01:01,955 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:01:01,956 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-26 22:01:01,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:01:01,956 INFO L82 PathProgramCache]: Analyzing trace with hash 2082409598, now seen corresponding path program 1 times [2019-12-26 22:01:01,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:01:01,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198196700] [2019-12-26 22:01:01,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:01:01,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:01:02,077 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-26 22:01:02,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198196700] [2019-12-26 22:01:02,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:01:02,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:01:02,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291546924] [2019-12-26 22:01:02,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:01:02,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:01:02,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:01:02,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:01:02,080 INFO L87 Difference]: Start difference. First operand 107958 states and 460128 transitions. Second operand 4 states. [2019-12-26 22:01:03,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:01:03,319 INFO L93 Difference]: Finished difference Result 172022 states and 703369 transitions. [2019-12-26 22:01:03,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:01:03,319 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 22:01:03,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:01:09,025 INFO L225 Difference]: With dead ends: 172022 [2019-12-26 22:01:09,025 INFO L226 Difference]: Without dead ends: 171924 [2019-12-26 22:01:09,026 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-26 22:01:14,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171924 states. [2019-12-26 22:01:17,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171924 to 156115. [2019-12-26 22:01:17,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156115 states. [2019-12-26 22:01:18,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156115 states to 156115 states and 647087 transitions. [2019-12-26 22:01:18,708 INFO L78 Accepts]: Start accepts. Automaton has 156115 states and 647087 transitions. Word has length 11 [2019-12-26 22:01:18,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:01:18,708 INFO L462 AbstractCegarLoop]: Abstraction has 156115 states and 647087 transitions. [2019-12-26 22:01:18,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:01:18,708 INFO L276 IsEmpty]: Start isEmpty. Operand 156115 states and 647087 transitions. [2019-12-26 22:01:18,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 22:01:18,716 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:01:18,716 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:01:18,717 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-26 22:01:18,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:01:18,717 INFO L82 PathProgramCache]: Analyzing trace with hash 594088235, now seen corresponding path program 1 times [2019-12-26 22:01:18,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:01:18,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931207715] [2019-12-26 22:01:18,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:01:18,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:01:18,826 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-26 22:01:18,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931207715] [2019-12-26 22:01:18,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:01:18,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:01:18,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893526364] [2019-12-26 22:01:18,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:01:18,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:01:18,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:01:18,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:01:18,829 INFO L87 Difference]: Start difference. First operand 156115 states and 647087 transitions. Second operand 3 states. [2019-12-26 22:01:18,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:01:18,994 INFO L93 Difference]: Finished difference Result 33388 states and 108650 transitions. [2019-12-26 22:01:18,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:01:18,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-26 22:01:18,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:01:19,062 INFO L225 Difference]: With dead ends: 33388 [2019-12-26 22:01:19,062 INFO L226 Difference]: Without dead ends: 33388 [2019-12-26 22:01:19,063 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-26 22:01:19,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33388 states. [2019-12-26 22:01:19,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33388 to 33388. [2019-12-26 22:01:19,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33388 states. [2019-12-26 22:01:19,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33388 states to 33388 states and 108650 transitions. [2019-12-26 22:01:19,743 INFO L78 Accepts]: Start accepts. Automaton has 33388 states and 108650 transitions. Word has length 13 [2019-12-26 22:01:19,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:01:19,744 INFO L462 AbstractCegarLoop]: Abstraction has 33388 states and 108650 transitions. [2019-12-26 22:01:19,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:01:19,744 INFO L276 IsEmpty]: Start isEmpty. Operand 33388 states and 108650 transitions. [2019-12-26 22:01:19,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 22:01:19,746 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:01:19,746 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:01:19,747 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-26 22:01:19,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:01:19,747 INFO L82 PathProgramCache]: Analyzing trace with hash -805978823, now seen corresponding path program 1 times [2019-12-26 22:01:19,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:01:19,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842779789] [2019-12-26 22:01:19,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:01:19,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:01:19,813 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-26 22:01:19,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842779789] [2019-12-26 22:01:19,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:01:19,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:01:19,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341546869] [2019-12-26 22:01:19,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:01:19,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:01:19,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:01:19,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:01:19,815 INFO L87 Difference]: Start difference. First operand 33388 states and 108650 transitions. Second operand 3 states. [2019-12-26 22:01:20,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:01:20,017 INFO L93 Difference]: Finished difference Result 52822 states and 170897 transitions. [2019-12-26 22:01:20,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:01:20,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-26 22:01:20,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:01:20,135 INFO L225 Difference]: With dead ends: 52822 [2019-12-26 22:01:20,135 INFO L226 Difference]: Without dead ends: 52822 [2019-12-26 22:01:20,135 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-26 22:01:20,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52822 states. [2019-12-26 22:01:21,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52822 to 39094. [2019-12-26 22:01:21,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39094 states. [2019-12-26 22:01:21,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39094 states to 39094 states and 127496 transitions. [2019-12-26 22:01:21,541 INFO L78 Accepts]: Start accepts. Automaton has 39094 states and 127496 transitions. Word has length 16 [2019-12-26 22:01:21,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:01:21,542 INFO L462 AbstractCegarLoop]: Abstraction has 39094 states and 127496 transitions. [2019-12-26 22:01:21,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:01:21,542 INFO L276 IsEmpty]: Start isEmpty. Operand 39094 states and 127496 transitions. [2019-12-26 22:01:21,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 22:01:21,544 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:01:21,544 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:01:21,545 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-26 22:01:21,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:01:21,545 INFO L82 PathProgramCache]: Analyzing trace with hash -805853304, now seen corresponding path program 1 times [2019-12-26 22:01:21,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:01:21,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706373599] [2019-12-26 22:01:21,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:01:21,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:01:21,625 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-26 22:01:21,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706373599] [2019-12-26 22:01:21,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:01:21,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:01:21,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425591549] [2019-12-26 22:01:21,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:01:21,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:01:21,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:01:21,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:01:21,627 INFO L87 Difference]: Start difference. First operand 39094 states and 127496 transitions. Second operand 4 states. [2019-12-26 22:01:22,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:01:22,009 INFO L93 Difference]: Finished difference Result 46903 states and 150848 transitions. [2019-12-26 22:01:22,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:01:22,009 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-26 22:01:22,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:01:22,088 INFO L225 Difference]: With dead ends: 46903 [2019-12-26 22:01:22,088 INFO L226 Difference]: Without dead ends: 46903 [2019-12-26 22:01:22,088 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-26 22:01:22,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46903 states. [2019-12-26 22:01:22,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46903 to 42953. [2019-12-26 22:01:22,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42953 states. [2019-12-26 22:01:22,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42953 states to 42953 states and 139113 transitions. [2019-12-26 22:01:22,872 INFO L78 Accepts]: Start accepts. Automaton has 42953 states and 139113 transitions. Word has length 16 [2019-12-26 22:01:22,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:01:22,873 INFO L462 AbstractCegarLoop]: Abstraction has 42953 states and 139113 transitions. [2019-12-26 22:01:22,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:01:22,873 INFO L276 IsEmpty]: Start isEmpty. Operand 42953 states and 139113 transitions. [2019-12-26 22:01:22,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 22:01:22,876 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:01:22,876 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:01:22,877 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-26 22:01:22,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:01:22,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1222928522, now seen corresponding path program 1 times [2019-12-26 22:01:22,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:01:22,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891952229] [2019-12-26 22:01:22,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:01:22,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:01:22,938 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-26 22:01:22,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891952229] [2019-12-26 22:01:22,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:01:22,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:01:22,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624392731] [2019-12-26 22:01:22,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:01:22,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:01:22,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:01:22,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:01:22,941 INFO L87 Difference]: Start difference. First operand 42953 states and 139113 transitions. Second operand 4 states. [2019-12-26 22:01:23,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:01:23,630 INFO L93 Difference]: Finished difference Result 51478 states and 165621 transitions. [2019-12-26 22:01:23,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:01:23,631 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-26 22:01:23,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:01:23,716 INFO L225 Difference]: With dead ends: 51478 [2019-12-26 22:01:23,716 INFO L226 Difference]: Without dead ends: 51478 [2019-12-26 22:01:23,716 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-26 22:01:23,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51478 states. [2019-12-26 22:01:24,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51478 to 44383. [2019-12-26 22:01:24,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44383 states. [2019-12-26 22:01:24,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44383 states to 44383 states and 143934 transitions. [2019-12-26 22:01:24,548 INFO L78 Accepts]: Start accepts. Automaton has 44383 states and 143934 transitions. Word has length 16 [2019-12-26 22:01:24,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:01:24,549 INFO L462 AbstractCegarLoop]: Abstraction has 44383 states and 143934 transitions. [2019-12-26 22:01:24,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:01:24,549 INFO L276 IsEmpty]: Start isEmpty. Operand 44383 states and 143934 transitions. [2019-12-26 22:01:24,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 22:01:24,558 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:01:24,558 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-26 22:01:24,558 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-26 22:01:24,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:01:24,559 INFO L82 PathProgramCache]: Analyzing trace with hash -655013944, now seen corresponding path program 1 times [2019-12-26 22:01:24,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:01:24,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316606742] [2019-12-26 22:01:24,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:01:24,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:01:24,631 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-26 22:01:24,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316606742] [2019-12-26 22:01:24,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:01:24,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:01:24,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965022898] [2019-12-26 22:01:24,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:01:24,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:01:24,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:01:24,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:01:24,633 INFO L87 Difference]: Start difference. First operand 44383 states and 143934 transitions. Second operand 5 states. [2019-12-26 22:01:25,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:01:25,294 INFO L93 Difference]: Finished difference Result 61264 states and 194140 transitions. [2019-12-26 22:01:25,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 22:01:25,295 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-26 22:01:25,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:01:25,393 INFO L225 Difference]: With dead ends: 61264 [2019-12-26 22:01:25,393 INFO L226 Difference]: Without dead ends: 61250 [2019-12-26 22:01:25,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:01:25,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61250 states. [2019-12-26 22:01:26,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61250 to 45686. [2019-12-26 22:01:26,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45686 states. [2019-12-26 22:01:26,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45686 states to 45686 states and 147920 transitions. [2019-12-26 22:01:26,747 INFO L78 Accepts]: Start accepts. Automaton has 45686 states and 147920 transitions. Word has length 22 [2019-12-26 22:01:26,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:01:26,748 INFO L462 AbstractCegarLoop]: Abstraction has 45686 states and 147920 transitions. [2019-12-26 22:01:26,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:01:26,748 INFO L276 IsEmpty]: Start isEmpty. Operand 45686 states and 147920 transitions. [2019-12-26 22:01:26,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 22:01:26,757 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:01:26,757 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:01:26,758 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-26 22:01:26,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:01:26,758 INFO L82 PathProgramCache]: Analyzing trace with hash -2032339914, now seen corresponding path program 1 times [2019-12-26 22:01:26,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:01:26,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701865507] [2019-12-26 22:01:26,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:01:26,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:01:26,825 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-26 22:01:26,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701865507] [2019-12-26 22:01:26,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:01:26,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:01:26,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753612353] [2019-12-26 22:01:26,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:01:26,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:01:26,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:01:26,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:01:26,827 INFO L87 Difference]: Start difference. First operand 45686 states and 147920 transitions. Second operand 5 states. [2019-12-26 22:01:27,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:01:27,436 INFO L93 Difference]: Finished difference Result 63752 states and 201665 transitions. [2019-12-26 22:01:27,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 22:01:27,437 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-26 22:01:27,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:01:27,543 INFO L225 Difference]: With dead ends: 63752 [2019-12-26 22:01:27,543 INFO L226 Difference]: Without dead ends: 63738 [2019-12-26 22:01:27,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:01:27,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63738 states. [2019-12-26 22:01:28,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63738 to 44032. [2019-12-26 22:01:28,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44032 states. [2019-12-26 22:01:29,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44032 states to 44032 states and 142639 transitions. [2019-12-26 22:01:29,181 INFO L78 Accepts]: Start accepts. Automaton has 44032 states and 142639 transitions. Word has length 22 [2019-12-26 22:01:29,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:01:29,182 INFO L462 AbstractCegarLoop]: Abstraction has 44032 states and 142639 transitions. [2019-12-26 22:01:29,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:01:29,182 INFO L276 IsEmpty]: Start isEmpty. Operand 44032 states and 142639 transitions. [2019-12-26 22:01:29,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 22:01:29,193 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:01:29,194 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-26 22:01:29,194 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-26 22:01:29,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:01:29,194 INFO L82 PathProgramCache]: Analyzing trace with hash -701847110, now seen corresponding path program 1 times [2019-12-26 22:01:29,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:01:29,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094105261] [2019-12-26 22:01:29,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:01:29,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:01:29,270 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-26 22:01:29,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094105261] [2019-12-26 22:01:29,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:01:29,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:01:29,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025610945] [2019-12-26 22:01:29,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:01:29,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:01:29,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:01:29,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:01:29,272 INFO L87 Difference]: Start difference. First operand 44032 states and 142639 transitions. Second operand 4 states. [2019-12-26 22:01:29,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:01:29,365 INFO L93 Difference]: Finished difference Result 17193 states and 52641 transitions. [2019-12-26 22:01:29,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:01:29,366 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-26 22:01:29,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:01:29,405 INFO L225 Difference]: With dead ends: 17193 [2019-12-26 22:01:29,406 INFO L226 Difference]: Without dead ends: 17193 [2019-12-26 22:01:29,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:01:29,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17193 states. [2019-12-26 22:01:29,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17193 to 16865. [2019-12-26 22:01:29,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16865 states. [2019-12-26 22:01:29,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16865 states to 16865 states and 51705 transitions. [2019-12-26 22:01:29,847 INFO L78 Accepts]: Start accepts. Automaton has 16865 states and 51705 transitions. Word has length 25 [2019-12-26 22:01:29,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:01:29,848 INFO L462 AbstractCegarLoop]: Abstraction has 16865 states and 51705 transitions. [2019-12-26 22:01:29,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:01:29,848 INFO L276 IsEmpty]: Start isEmpty. Operand 16865 states and 51705 transitions. [2019-12-26 22:01:29,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-26 22:01:29,864 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:01:29,864 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:01:29,865 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-26 22:01:29,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:01:29,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1083173402, now seen corresponding path program 1 times [2019-12-26 22:01:29,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:01:29,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835392732] [2019-12-26 22:01:29,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:01:29,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:01:29,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:01:29,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835392732] [2019-12-26 22:01:29,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:01:29,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:01:29,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887396349] [2019-12-26 22:01:29,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:01:29,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:01:29,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:01:29,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:01:29,954 INFO L87 Difference]: Start difference. First operand 16865 states and 51705 transitions. Second operand 5 states. [2019-12-26 22:01:30,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:01:30,283 INFO L93 Difference]: Finished difference Result 21613 states and 65127 transitions. [2019-12-26 22:01:30,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 22:01:30,284 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-26 22:01:30,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:01:30,313 INFO L225 Difference]: With dead ends: 21613 [2019-12-26 22:01:30,313 INFO L226 Difference]: Without dead ends: 21613 [2019-12-26 22:01:30,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:01:30,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21613 states. [2019-12-26 22:01:30,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21613 to 20225. [2019-12-26 22:01:30,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20225 states. [2019-12-26 22:01:30,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20225 states to 20225 states and 61637 transitions. [2019-12-26 22:01:30,627 INFO L78 Accepts]: Start accepts. Automaton has 20225 states and 61637 transitions. Word has length 26 [2019-12-26 22:01:30,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:01:30,628 INFO L462 AbstractCegarLoop]: Abstraction has 20225 states and 61637 transitions. [2019-12-26 22:01:30,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:01:30,628 INFO L276 IsEmpty]: Start isEmpty. Operand 20225 states and 61637 transitions. [2019-12-26 22:01:30,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-26 22:01:30,644 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:01:30,644 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-26 22:01:30,644 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-26 22:01:30,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:01:30,645 INFO L82 PathProgramCache]: Analyzing trace with hash -799804073, now seen corresponding path program 1 times [2019-12-26 22:01:30,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:01:30,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773872287] [2019-12-26 22:01:30,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:01:30,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:01:30,715 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-26 22:01:30,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773872287] [2019-12-26 22:01:30,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:01:30,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:01:30,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067957561] [2019-12-26 22:01:30,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:01:30,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:01:30,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:01:30,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:01:30,717 INFO L87 Difference]: Start difference. First operand 20225 states and 61637 transitions. Second operand 5 states. [2019-12-26 22:01:31,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:01:31,054 INFO L93 Difference]: Finished difference Result 23624 states and 70894 transitions. [2019-12-26 22:01:31,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 22:01:31,055 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-26 22:01:31,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:01:31,088 INFO L225 Difference]: With dead ends: 23624 [2019-12-26 22:01:31,088 INFO L226 Difference]: Without dead ends: 23624 [2019-12-26 22:01:31,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:01:31,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23624 states. [2019-12-26 22:01:31,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23624 to 19452. [2019-12-26 22:01:31,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19452 states. [2019-12-26 22:01:31,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19452 states to 19452 states and 59284 transitions. [2019-12-26 22:01:31,403 INFO L78 Accepts]: Start accepts. Automaton has 19452 states and 59284 transitions. Word has length 28 [2019-12-26 22:01:31,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:01:31,403 INFO L462 AbstractCegarLoop]: Abstraction has 19452 states and 59284 transitions. [2019-12-26 22:01:31,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:01:31,403 INFO L276 IsEmpty]: Start isEmpty. Operand 19452 states and 59284 transitions. [2019-12-26 22:01:31,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-26 22:01:31,422 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:01:31,422 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:01:31,423 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-26 22:01:31,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:01:31,423 INFO L82 PathProgramCache]: Analyzing trace with hash -145847770, now seen corresponding path program 1 times [2019-12-26 22:01:31,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:01:31,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020670360] [2019-12-26 22:01:31,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:01:31,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:01:31,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:01:31,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020670360] [2019-12-26 22:01:31,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:01:31,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:01:31,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315263236] [2019-12-26 22:01:31,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:01:31,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:01:31,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:01:31,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:01:31,496 INFO L87 Difference]: Start difference. First operand 19452 states and 59284 transitions. Second operand 6 states. [2019-12-26 22:01:32,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:01:32,180 INFO L93 Difference]: Finished difference Result 27031 states and 80502 transitions. [2019-12-26 22:01:32,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 22:01:32,180 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-26 22:01:32,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:01:32,237 INFO L225 Difference]: With dead ends: 27031 [2019-12-26 22:01:32,238 INFO L226 Difference]: Without dead ends: 27031 [2019-12-26 22:01:32,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-26 22:01:32,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27031 states. [2019-12-26 22:01:32,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27031 to 20764. [2019-12-26 22:01:32,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20764 states. [2019-12-26 22:01:32,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20764 states to 20764 states and 63071 transitions. [2019-12-26 22:01:32,917 INFO L78 Accepts]: Start accepts. Automaton has 20764 states and 63071 transitions. Word has length 32 [2019-12-26 22:01:32,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:01:32,918 INFO L462 AbstractCegarLoop]: Abstraction has 20764 states and 63071 transitions. [2019-12-26 22:01:32,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:01:32,918 INFO L276 IsEmpty]: Start isEmpty. Operand 20764 states and 63071 transitions. [2019-12-26 22:01:32,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-26 22:01:32,940 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:01:32,940 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] [2019-12-26 22:01:32,941 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-26 22:01:32,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:01:32,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1380765993, now seen corresponding path program 1 times [2019-12-26 22:01:32,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:01:32,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205411129] [2019-12-26 22:01:32,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:01:32,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:01:33,024 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-26 22:01:33,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205411129] [2019-12-26 22:01:33,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:01:33,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:01:33,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272346697] [2019-12-26 22:01:33,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:01:33,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:01:33,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:01:33,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:01:33,026 INFO L87 Difference]: Start difference. First operand 20764 states and 63071 transitions. Second operand 6 states. [2019-12-26 22:01:33,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:01:33,887 INFO L93 Difference]: Finished difference Result 26334 states and 78684 transitions. [2019-12-26 22:01:33,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 22:01:33,887 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-26 22:01:33,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:01:33,925 INFO L225 Difference]: With dead ends: 26334 [2019-12-26 22:01:33,925 INFO L226 Difference]: Without dead ends: 26334 [2019-12-26 22:01:33,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-26 22:01:34,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26334 states. [2019-12-26 22:01:34,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26334 to 17642. [2019-12-26 22:01:34,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17642 states. [2019-12-26 22:01:34,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17642 states to 17642 states and 53957 transitions. [2019-12-26 22:01:34,246 INFO L78 Accepts]: Start accepts. Automaton has 17642 states and 53957 transitions. Word has length 34 [2019-12-26 22:01:34,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:01:34,247 INFO L462 AbstractCegarLoop]: Abstraction has 17642 states and 53957 transitions. [2019-12-26 22:01:34,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:01:34,247 INFO L276 IsEmpty]: Start isEmpty. Operand 17642 states and 53957 transitions. [2019-12-26 22:01:34,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-26 22:01:34,263 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:01:34,263 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-26 22:01:34,263 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-26 22:01:34,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:01:34,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1372962452, now seen corresponding path program 1 times [2019-12-26 22:01:34,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:01:34,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747543301] [2019-12-26 22:01:34,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:01:34,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:01:34,322 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-26 22:01:34,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747543301] [2019-12-26 22:01:34,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:01:34,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:01:34,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098241044] [2019-12-26 22:01:34,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:01:34,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:01:34,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:01:34,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:01:34,324 INFO L87 Difference]: Start difference. First operand 17642 states and 53957 transitions. Second operand 3 states. [2019-12-26 22:01:34,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:01:34,388 INFO L93 Difference]: Finished difference Result 17641 states and 53955 transitions. [2019-12-26 22:01:34,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:01:34,389 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-26 22:01:34,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:01:34,415 INFO L225 Difference]: With dead ends: 17641 [2019-12-26 22:01:34,415 INFO L226 Difference]: Without dead ends: 17641 [2019-12-26 22:01:34,415 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-26 22:01:34,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17641 states. [2019-12-26 22:01:34,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17641 to 17641. [2019-12-26 22:01:34,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17641 states. [2019-12-26 22:01:34,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17641 states to 17641 states and 53955 transitions. [2019-12-26 22:01:34,695 INFO L78 Accepts]: Start accepts. Automaton has 17641 states and 53955 transitions. Word has length 39 [2019-12-26 22:01:34,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:01:34,696 INFO L462 AbstractCegarLoop]: Abstraction has 17641 states and 53955 transitions. [2019-12-26 22:01:34,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:01:34,696 INFO L276 IsEmpty]: Start isEmpty. Operand 17641 states and 53955 transitions. [2019-12-26 22:01:34,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 22:01:34,714 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:01:34,714 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-26 22:01:34,714 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-26 22:01:34,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:01:34,714 INFO L82 PathProgramCache]: Analyzing trace with hash -2062304393, now seen corresponding path program 1 times [2019-12-26 22:01:34,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:01:34,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342107337] [2019-12-26 22:01:34,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:01:34,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:01:34,799 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-26 22:01:34,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342107337] [2019-12-26 22:01:34,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:01:34,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:01:34,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675877084] [2019-12-26 22:01:34,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:01:34,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:01:34,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:01:34,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:01:34,801 INFO L87 Difference]: Start difference. First operand 17641 states and 53955 transitions. Second operand 5 states. [2019-12-26 22:01:35,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:01:35,436 INFO L93 Difference]: Finished difference Result 25346 states and 76639 transitions. [2019-12-26 22:01:35,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:01:35,436 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-26 22:01:35,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:01:35,484 INFO L225 Difference]: With dead ends: 25346 [2019-12-26 22:01:35,485 INFO L226 Difference]: Without dead ends: 25346 [2019-12-26 22:01:35,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:01:35,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25346 states. [2019-12-26 22:01:35,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25346 to 23560. [2019-12-26 22:01:35,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23560 states. [2019-12-26 22:01:35,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23560 states to 23560 states and 71751 transitions. [2019-12-26 22:01:35,868 INFO L78 Accepts]: Start accepts. Automaton has 23560 states and 71751 transitions. Word has length 40 [2019-12-26 22:01:35,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:01:35,869 INFO L462 AbstractCegarLoop]: Abstraction has 23560 states and 71751 transitions. [2019-12-26 22:01:35,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:01:35,869 INFO L276 IsEmpty]: Start isEmpty. Operand 23560 states and 71751 transitions. [2019-12-26 22:01:35,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 22:01:35,897 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:01:35,897 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-26 22:01:35,898 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-26 22:01:35,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:01:35,898 INFO L82 PathProgramCache]: Analyzing trace with hash -950700709, now seen corresponding path program 2 times [2019-12-26 22:01:35,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:01:35,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310371333] [2019-12-26 22:01:35,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:01:35,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:01:35,947 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-26 22:01:35,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310371333] [2019-12-26 22:01:35,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:01:35,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:01:35,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903558139] [2019-12-26 22:01:35,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:01:35,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:01:35,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:01:35,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:01:35,949 INFO L87 Difference]: Start difference. First operand 23560 states and 71751 transitions. Second operand 5 states. [2019-12-26 22:01:36,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:01:36,072 INFO L93 Difference]: Finished difference Result 22175 states and 68518 transitions. [2019-12-26 22:01:36,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:01:36,073 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-26 22:01:36,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:01:36,112 INFO L225 Difference]: With dead ends: 22175 [2019-12-26 22:01:36,112 INFO L226 Difference]: Without dead ends: 22175 [2019-12-26 22:01:36,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-26 22:01:36,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22175 states. [2019-12-26 22:01:36,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22175 to 21251. [2019-12-26 22:01:36,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21251 states. [2019-12-26 22:01:36,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21251 states to 21251 states and 66025 transitions. [2019-12-26 22:01:36,740 INFO L78 Accepts]: Start accepts. Automaton has 21251 states and 66025 transitions. Word has length 40 [2019-12-26 22:01:36,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:01:36,741 INFO L462 AbstractCegarLoop]: Abstraction has 21251 states and 66025 transitions. [2019-12-26 22:01:36,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:01:36,741 INFO L276 IsEmpty]: Start isEmpty. Operand 21251 states and 66025 transitions. [2019-12-26 22:01:36,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-26 22:01:36,770 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:01:36,770 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] [2019-12-26 22:01:36,770 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-26 22:01:36,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:01:36,771 INFO L82 PathProgramCache]: Analyzing trace with hash 20161267, now seen corresponding path program 1 times [2019-12-26 22:01:36,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:01:36,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960719039] [2019-12-26 22:01:36,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:01:36,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:01:36,858 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-26 22:01:36,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960719039] [2019-12-26 22:01:36,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:01:36,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:01:36,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973453017] [2019-12-26 22:01:36,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:01:36,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:01:36,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:01:36,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:01:36,860 INFO L87 Difference]: Start difference. First operand 21251 states and 66025 transitions. Second operand 7 states. [2019-12-26 22:01:37,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:01:37,412 INFO L93 Difference]: Finished difference Result 62478 states and 192933 transitions. [2019-12-26 22:01:37,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-26 22:01:37,412 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-26 22:01:37,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:01:37,480 INFO L225 Difference]: With dead ends: 62478 [2019-12-26 22:01:37,481 INFO L226 Difference]: Without dead ends: 47634 [2019-12-26 22:01:37,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-26 22:01:37,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47634 states. [2019-12-26 22:01:38,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47634 to 25007. [2019-12-26 22:01:38,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25007 states. [2019-12-26 22:01:38,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25007 states to 25007 states and 78146 transitions. [2019-12-26 22:01:38,070 INFO L78 Accepts]: Start accepts. Automaton has 25007 states and 78146 transitions. Word has length 63 [2019-12-26 22:01:38,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:01:38,070 INFO L462 AbstractCegarLoop]: Abstraction has 25007 states and 78146 transitions. [2019-12-26 22:01:38,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:01:38,070 INFO L276 IsEmpty]: Start isEmpty. Operand 25007 states and 78146 transitions. [2019-12-26 22:01:38,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-26 22:01:38,098 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:01:38,098 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] [2019-12-26 22:01:38,098 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-26 22:01:38,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:01:38,098 INFO L82 PathProgramCache]: Analyzing trace with hash 618170621, now seen corresponding path program 2 times [2019-12-26 22:01:38,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:01:38,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243473295] [2019-12-26 22:01:38,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:01:38,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:01:38,189 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-26 22:01:38,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243473295] [2019-12-26 22:01:38,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:01:38,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:01:38,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707601521] [2019-12-26 22:01:38,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:01:38,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:01:38,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:01:38,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:01:38,191 INFO L87 Difference]: Start difference. First operand 25007 states and 78146 transitions. Second operand 7 states. [2019-12-26 22:01:38,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:01:38,730 INFO L93 Difference]: Finished difference Result 68433 states and 210070 transitions. [2019-12-26 22:01:38,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 22:01:38,730 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-26 22:01:38,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:01:38,814 INFO L225 Difference]: With dead ends: 68433 [2019-12-26 22:01:38,814 INFO L226 Difference]: Without dead ends: 48478 [2019-12-26 22:01:38,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-26 22:01:38,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48478 states. [2019-12-26 22:01:39,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48478 to 28798. [2019-12-26 22:01:39,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28798 states. [2019-12-26 22:01:39,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28798 states to 28798 states and 89643 transitions. [2019-12-26 22:01:39,868 INFO L78 Accepts]: Start accepts. Automaton has 28798 states and 89643 transitions. Word has length 63 [2019-12-26 22:01:39,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:01:39,869 INFO L462 AbstractCegarLoop]: Abstraction has 28798 states and 89643 transitions. [2019-12-26 22:01:39,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:01:39,869 INFO L276 IsEmpty]: Start isEmpty. Operand 28798 states and 89643 transitions. [2019-12-26 22:01:39,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-26 22:01:39,901 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:01:39,901 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] [2019-12-26 22:01:39,901 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-26 22:01:39,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:01:39,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1826673419, now seen corresponding path program 3 times [2019-12-26 22:01:39,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:01:39,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180640428] [2019-12-26 22:01:39,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:01:39,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:01:39,986 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-26 22:01:39,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180640428] [2019-12-26 22:01:39,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:01:39,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:01:39,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323161926] [2019-12-26 22:01:39,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:01:39,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:01:39,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:01:39,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:01:39,988 INFO L87 Difference]: Start difference. First operand 28798 states and 89643 transitions. Second operand 7 states. [2019-12-26 22:01:40,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:01:40,615 INFO L93 Difference]: Finished difference Result 59843 states and 183697 transitions. [2019-12-26 22:01:40,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 22:01:40,616 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-26 22:01:40,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:01:40,697 INFO L225 Difference]: With dead ends: 59843 [2019-12-26 22:01:40,697 INFO L226 Difference]: Without dead ends: 52762 [2019-12-26 22:01:40,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-26 22:01:40,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52762 states. [2019-12-26 22:01:41,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52762 to 29106. [2019-12-26 22:01:41,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29106 states. [2019-12-26 22:01:41,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29106 states to 29106 states and 90594 transitions. [2019-12-26 22:01:41,335 INFO L78 Accepts]: Start accepts. Automaton has 29106 states and 90594 transitions. Word has length 63 [2019-12-26 22:01:41,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:01:41,335 INFO L462 AbstractCegarLoop]: Abstraction has 29106 states and 90594 transitions. [2019-12-26 22:01:41,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:01:41,335 INFO L276 IsEmpty]: Start isEmpty. Operand 29106 states and 90594 transitions. [2019-12-26 22:01:41,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-26 22:01:41,365 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:01:41,365 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] [2019-12-26 22:01:41,365 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-26 22:01:41,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:01:41,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1896779851, now seen corresponding path program 4 times [2019-12-26 22:01:41,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:01:41,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703870575] [2019-12-26 22:01:41,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:01:41,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:01:41,435 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-26 22:01:41,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703870575] [2019-12-26 22:01:41,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:01:41,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:01:41,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223536575] [2019-12-26 22:01:41,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:01:41,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:01:41,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:01:41,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:01:41,438 INFO L87 Difference]: Start difference. First operand 29106 states and 90594 transitions. Second operand 3 states. [2019-12-26 22:01:41,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:01:41,623 INFO L93 Difference]: Finished difference Result 35624 states and 109784 transitions. [2019-12-26 22:01:41,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:01:41,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-12-26 22:01:41,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:01:41,679 INFO L225 Difference]: With dead ends: 35624 [2019-12-26 22:01:41,679 INFO L226 Difference]: Without dead ends: 35624 [2019-12-26 22:01:41,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-26 22:01:41,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35624 states. [2019-12-26 22:01:42,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35624 to 31022. [2019-12-26 22:01:42,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31022 states. [2019-12-26 22:01:42,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31022 states to 31022 states and 96384 transitions. [2019-12-26 22:01:42,199 INFO L78 Accepts]: Start accepts. Automaton has 31022 states and 96384 transitions. Word has length 63 [2019-12-26 22:01:42,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:01:42,200 INFO L462 AbstractCegarLoop]: Abstraction has 31022 states and 96384 transitions. [2019-12-26 22:01:42,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:01:42,200 INFO L276 IsEmpty]: Start isEmpty. Operand 31022 states and 96384 transitions. [2019-12-26 22:01:42,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 22:01:42,238 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:01:42,238 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] [2019-12-26 22:01:42,238 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-26 22:01:42,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:01:42,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1820548391, now seen corresponding path program 1 times [2019-12-26 22:01:42,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:01:42,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861574413] [2019-12-26 22:01:42,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:01:42,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:01:42,469 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-26 22:01:42,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861574413] [2019-12-26 22:01:42,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:01:42,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-26 22:01:42,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978541953] [2019-12-26 22:01:42,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 22:01:42,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:01:42,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 22:01:42,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:01:42,471 INFO L87 Difference]: Start difference. First operand 31022 states and 96384 transitions. Second operand 11 states. [2019-12-26 22:01:46,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:01:46,836 INFO L93 Difference]: Finished difference Result 62888 states and 190331 transitions. [2019-12-26 22:01:46,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-26 22:01:46,837 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-12-26 22:01:46,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:01:46,935 INFO L225 Difference]: With dead ends: 62888 [2019-12-26 22:01:46,935 INFO L226 Difference]: Without dead ends: 62501 [2019-12-26 22:01:46,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 3 SyntacticMatches, 6 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=294, Invalid=1428, Unknown=0, NotChecked=0, Total=1722 [2019-12-26 22:01:47,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62501 states. [2019-12-26 22:01:47,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62501 to 36542. [2019-12-26 22:01:47,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36542 states. [2019-12-26 22:01:47,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36542 states to 36542 states and 112818 transitions. [2019-12-26 22:01:47,726 INFO L78 Accepts]: Start accepts. Automaton has 36542 states and 112818 transitions. Word has length 64 [2019-12-26 22:01:47,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:01:47,727 INFO L462 AbstractCegarLoop]: Abstraction has 36542 states and 112818 transitions. [2019-12-26 22:01:47,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 22:01:47,727 INFO L276 IsEmpty]: Start isEmpty. Operand 36542 states and 112818 transitions. [2019-12-26 22:01:47,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 22:01:47,767 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:01:47,767 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] [2019-12-26 22:01:47,767 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-26 22:01:47,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:01:47,767 INFO L82 PathProgramCache]: Analyzing trace with hash -772692697, now seen corresponding path program 2 times [2019-12-26 22:01:47,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:01:47,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876208116] [2019-12-26 22:01:47,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:01:47,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:01:47,958 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-26 22:01:47,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876208116] [2019-12-26 22:01:47,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:01:47,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 22:01:47,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289644767] [2019-12-26 22:01:47,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 22:01:47,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:01:47,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 22:01:47,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-26 22:01:47,962 INFO L87 Difference]: Start difference. First operand 36542 states and 112818 transitions. Second operand 10 states. [2019-12-26 22:01:49,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:01:49,987 INFO L93 Difference]: Finished difference Result 57974 states and 177107 transitions. [2019-12-26 22:01:49,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-26 22:01:49,988 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 64 [2019-12-26 22:01:49,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:01:50,071 INFO L225 Difference]: With dead ends: 57974 [2019-12-26 22:01:50,072 INFO L226 Difference]: Without dead ends: 57754 [2019-12-26 22:01:50,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2019-12-26 22:01:50,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57754 states. [2019-12-26 22:01:51,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57754 to 43087. [2019-12-26 22:01:51,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43087 states. [2019-12-26 22:01:51,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43087 states to 43087 states and 132970 transitions. [2019-12-26 22:01:51,199 INFO L78 Accepts]: Start accepts. Automaton has 43087 states and 132970 transitions. Word has length 64 [2019-12-26 22:01:51,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:01:51,199 INFO L462 AbstractCegarLoop]: Abstraction has 43087 states and 132970 transitions. [2019-12-26 22:01:51,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 22:01:51,200 INFO L276 IsEmpty]: Start isEmpty. Operand 43087 states and 132970 transitions. [2019-12-26 22:01:51,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 22:01:51,244 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:01:51,244 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] [2019-12-26 22:01:51,244 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-26 22:01:51,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:01:51,245 INFO L82 PathProgramCache]: Analyzing trace with hash 98843029, now seen corresponding path program 3 times [2019-12-26 22:01:51,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:01:51,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107684784] [2019-12-26 22:01:51,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:01:51,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:01:51,439 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-26 22:01:51,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107684784] [2019-12-26 22:01:51,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:01:51,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 22:01:51,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56906512] [2019-12-26 22:01:51,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 22:01:51,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:01:51,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 22:01:51,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-26 22:01:51,443 INFO L87 Difference]: Start difference. First operand 43087 states and 132970 transitions. Second operand 10 states. [2019-12-26 22:01:54,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:01:54,013 INFO L93 Difference]: Finished difference Result 63388 states and 192889 transitions. [2019-12-26 22:01:54,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-26 22:01:54,013 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 64 [2019-12-26 22:01:54,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:01:54,104 INFO L225 Difference]: With dead ends: 63388 [2019-12-26 22:01:54,104 INFO L226 Difference]: Without dead ends: 63136 [2019-12-26 22:01:54,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 7 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=159, Invalid=771, Unknown=0, NotChecked=0, Total=930 [2019-12-26 22:01:54,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63136 states. [2019-12-26 22:01:55,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63136 to 42907. [2019-12-26 22:01:55,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42907 states. [2019-12-26 22:01:55,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42907 states to 42907 states and 132444 transitions. [2019-12-26 22:01:55,508 INFO L78 Accepts]: Start accepts. Automaton has 42907 states and 132444 transitions. Word has length 64 [2019-12-26 22:01:55,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:01:55,508 INFO L462 AbstractCegarLoop]: Abstraction has 42907 states and 132444 transitions. [2019-12-26 22:01:55,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 22:01:55,508 INFO L276 IsEmpty]: Start isEmpty. Operand 42907 states and 132444 transitions. [2019-12-26 22:01:55,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 22:01:55,557 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:01:55,557 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] [2019-12-26 22:01:55,557 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-26 22:01:55,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:01:55,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1550075121, now seen corresponding path program 4 times [2019-12-26 22:01:55,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:01:55,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216845109] [2019-12-26 22:01:55,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:01:55,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:01:55,623 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-26 22:01:55,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216845109] [2019-12-26 22:01:55,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:01:55,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:01:55,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790356159] [2019-12-26 22:01:55,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:01:55,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:01:55,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:01:55,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:01:55,625 INFO L87 Difference]: Start difference. First operand 42907 states and 132444 transitions. Second operand 3 states. [2019-12-26 22:01:55,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:01:55,809 INFO L93 Difference]: Finished difference Result 42906 states and 132442 transitions. [2019-12-26 22:01:55,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:01:55,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-26 22:01:55,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:01:55,885 INFO L225 Difference]: With dead ends: 42906 [2019-12-26 22:01:55,885 INFO L226 Difference]: Without dead ends: 42906 [2019-12-26 22:01:55,886 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-26 22:01:56,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42906 states. [2019-12-26 22:01:56,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42906 to 34743. [2019-12-26 22:01:56,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34743 states. [2019-12-26 22:01:56,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34743 states to 34743 states and 108996 transitions. [2019-12-26 22:01:56,544 INFO L78 Accepts]: Start accepts. Automaton has 34743 states and 108996 transitions. Word has length 64 [2019-12-26 22:01:56,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:01:56,545 INFO L462 AbstractCegarLoop]: Abstraction has 34743 states and 108996 transitions. [2019-12-26 22:01:56,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:01:56,545 INFO L276 IsEmpty]: Start isEmpty. Operand 34743 states and 108996 transitions. [2019-12-26 22:01:56,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:01:56,584 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:01:56,584 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] [2019-12-26 22:01:56,584 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-26 22:01:56,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:01:56,584 INFO L82 PathProgramCache]: Analyzing trace with hash 78921339, now seen corresponding path program 1 times [2019-12-26 22:01:56,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:01:56,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015913641] [2019-12-26 22:01:56,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:01:56,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:01:56,656 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-26 22:01:56,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015913641] [2019-12-26 22:01:56,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:01:56,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:01:56,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025503909] [2019-12-26 22:01:56,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:01:56,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:01:56,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:01:56,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:01:56,658 INFO L87 Difference]: Start difference. First operand 34743 states and 108996 transitions. Second operand 3 states. [2019-12-26 22:01:56,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:01:56,790 INFO L93 Difference]: Finished difference Result 26800 states and 82983 transitions. [2019-12-26 22:01:56,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:01:56,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 22:01:56,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:01:56,855 INFO L225 Difference]: With dead ends: 26800 [2019-12-26 22:01:56,855 INFO L226 Difference]: Without dead ends: 26800 [2019-12-26 22:01:56,856 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-26 22:01:57,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26800 states. [2019-12-26 22:01:57,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26800 to 24612. [2019-12-26 22:01:57,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24612 states. [2019-12-26 22:01:57,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24612 states to 24612 states and 76133 transitions. [2019-12-26 22:01:57,421 INFO L78 Accepts]: Start accepts. Automaton has 24612 states and 76133 transitions. Word has length 65 [2019-12-26 22:01:57,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:01:57,421 INFO L462 AbstractCegarLoop]: Abstraction has 24612 states and 76133 transitions. [2019-12-26 22:01:57,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:01:57,421 INFO L276 IsEmpty]: Start isEmpty. Operand 24612 states and 76133 transitions. [2019-12-26 22:01:57,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 22:01:57,449 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:01:57,449 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 22:01:57,449 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-26 22:01:57,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:01:57,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1524862519, now seen corresponding path program 1 times [2019-12-26 22:01:57,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:01:57,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079095486] [2019-12-26 22:01:57,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:01:57,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:01:58,005 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-26 22:01:58,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079095486] [2019-12-26 22:01:58,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:01:58,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-26 22:01:58,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82897202] [2019-12-26 22:01:58,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-26 22:01:58,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:01:58,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-26 22:01:58,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-26 22:01:58,007 INFO L87 Difference]: Start difference. First operand 24612 states and 76133 transitions. Second operand 15 states. [2019-12-26 22:02:03,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:02:03,067 INFO L93 Difference]: Finished difference Result 55593 states and 169836 transitions. [2019-12-26 22:02:03,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-12-26 22:02:03,067 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 66 [2019-12-26 22:02:03,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:02:03,151 INFO L225 Difference]: With dead ends: 55593 [2019-12-26 22:02:03,152 INFO L226 Difference]: Without dead ends: 53206 [2019-12-26 22:02:03,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 895 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=483, Invalid=2709, Unknown=0, NotChecked=0, Total=3192 [2019-12-26 22:02:03,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53206 states. [2019-12-26 22:02:03,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53206 to 28146. [2019-12-26 22:02:03,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28146 states. [2019-12-26 22:02:03,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28146 states to 28146 states and 86601 transitions. [2019-12-26 22:02:03,779 INFO L78 Accepts]: Start accepts. Automaton has 28146 states and 86601 transitions. Word has length 66 [2019-12-26 22:02:03,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:02:03,779 INFO L462 AbstractCegarLoop]: Abstraction has 28146 states and 86601 transitions. [2019-12-26 22:02:03,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-26 22:02:03,779 INFO L276 IsEmpty]: Start isEmpty. Operand 28146 states and 86601 transitions. [2019-12-26 22:02:03,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 22:02:03,812 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:02:03,813 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-26 22:02:03,813 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:02:03,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:02:03,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1239159877, now seen corresponding path program 2 times [2019-12-26 22:02:03,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:02:03,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352273669] [2019-12-26 22:02:03,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:02:03,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:02:04,270 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-26 22:02:04,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352273669] [2019-12-26 22:02:04,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:02:04,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-26 22:02:04,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668091031] [2019-12-26 22:02:04,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-26 22:02:04,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:02:04,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-26 22:02:04,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-26 22:02:04,273 INFO L87 Difference]: Start difference. First operand 28146 states and 86601 transitions. Second operand 15 states. [2019-12-26 22:02:09,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:02:09,012 INFO L93 Difference]: Finished difference Result 53620 states and 162640 transitions. [2019-12-26 22:02:09,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-26 22:02:09,013 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 66 [2019-12-26 22:02:09,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:02:09,079 INFO L225 Difference]: With dead ends: 53620 [2019-12-26 22:02:09,080 INFO L226 Difference]: Without dead ends: 47132 [2019-12-26 22:02:09,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=393, Invalid=1769, Unknown=0, NotChecked=0, Total=2162 [2019-12-26 22:02:09,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47132 states. [2019-12-26 22:02:09,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47132 to 25230. [2019-12-26 22:02:09,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25230 states. [2019-12-26 22:02:09,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25230 states to 25230 states and 77712 transitions. [2019-12-26 22:02:09,967 INFO L78 Accepts]: Start accepts. Automaton has 25230 states and 77712 transitions. Word has length 66 [2019-12-26 22:02:09,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:02:09,967 INFO L462 AbstractCegarLoop]: Abstraction has 25230 states and 77712 transitions. [2019-12-26 22:02:09,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-26 22:02:09,968 INFO L276 IsEmpty]: Start isEmpty. Operand 25230 states and 77712 transitions. [2019-12-26 22:02:09,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 22:02:09,995 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:02:09,996 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-26 22:02:09,996 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:02:09,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:02:09,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1620692773, now seen corresponding path program 3 times [2019-12-26 22:02:09,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:02:09,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772423454] [2019-12-26 22:02:09,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:02:10,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:02:10,421 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-26 22:02:10,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772423454] [2019-12-26 22:02:10,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:02:10,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-26 22:02:10,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079355560] [2019-12-26 22:02:10,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-26 22:02:10,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:02:10,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-26 22:02:10,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-12-26 22:02:10,423 INFO L87 Difference]: Start difference. First operand 25230 states and 77712 transitions. Second operand 16 states. [2019-12-26 22:02:16,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:02:16,672 INFO L93 Difference]: Finished difference Result 63148 states and 193268 transitions. [2019-12-26 22:02:16,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-12-26 22:02:16,673 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 66 [2019-12-26 22:02:16,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:02:16,766 INFO L225 Difference]: With dead ends: 63148 [2019-12-26 22:02:16,766 INFO L226 Difference]: Without dead ends: 59940 [2019-12-26 22:02:16,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1460 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=688, Invalid=4142, Unknown=0, NotChecked=0, Total=4830 [2019-12-26 22:02:16,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59940 states. [2019-12-26 22:02:17,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59940 to 30719. [2019-12-26 22:02:17,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30719 states. [2019-12-26 22:02:17,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30719 states to 30719 states and 94659 transitions. [2019-12-26 22:02:17,939 INFO L78 Accepts]: Start accepts. Automaton has 30719 states and 94659 transitions. Word has length 66 [2019-12-26 22:02:17,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:02:17,940 INFO L462 AbstractCegarLoop]: Abstraction has 30719 states and 94659 transitions. [2019-12-26 22:02:17,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-26 22:02:17,940 INFO L276 IsEmpty]: Start isEmpty. Operand 30719 states and 94659 transitions. [2019-12-26 22:02:17,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 22:02:17,977 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:02:17,977 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-26 22:02:17,977 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:02:17,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:02:17,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1334990131, now seen corresponding path program 4 times [2019-12-26 22:02:17,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:02:17,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669204420] [2019-12-26 22:02:17,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:02:17,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:02:18,380 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-26 22:02:18,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669204420] [2019-12-26 22:02:18,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:02:18,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-26 22:02:18,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553783859] [2019-12-26 22:02:18,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-26 22:02:18,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:02:18,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-26 22:02:18,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-12-26 22:02:18,382 INFO L87 Difference]: Start difference. First operand 30719 states and 94659 transitions. Second operand 16 states. [2019-12-26 22:02:24,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:02:24,341 INFO L93 Difference]: Finished difference Result 60016 states and 182023 transitions. [2019-12-26 22:02:24,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-12-26 22:02:24,342 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 66 [2019-12-26 22:02:24,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:02:24,410 INFO L225 Difference]: With dead ends: 60016 [2019-12-26 22:02:24,410 INFO L226 Difference]: Without dead ends: 46692 [2019-12-26 22:02:24,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 982 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=607, Invalid=2933, Unknown=0, NotChecked=0, Total=3540 [2019-12-26 22:02:24,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46692 states. [2019-12-26 22:02:24,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46692 to 24763. [2019-12-26 22:02:24,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24763 states. [2019-12-26 22:02:25,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24763 states to 24763 states and 76114 transitions. [2019-12-26 22:02:25,001 INFO L78 Accepts]: Start accepts. Automaton has 24763 states and 76114 transitions. Word has length 66 [2019-12-26 22:02:25,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:02:25,002 INFO L462 AbstractCegarLoop]: Abstraction has 24763 states and 76114 transitions. [2019-12-26 22:02:25,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-26 22:02:25,002 INFO L276 IsEmpty]: Start isEmpty. Operand 24763 states and 76114 transitions. [2019-12-26 22:02:25,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 22:02:25,027 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:02:25,027 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-26 22:02:25,028 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:02:25,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:02:25,028 INFO L82 PathProgramCache]: Analyzing trace with hash 38318619, now seen corresponding path program 5 times [2019-12-26 22:02:25,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:02:25,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660337713] [2019-12-26 22:02:25,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:02:25,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:02:25,187 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-26 22:02:25,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660337713] [2019-12-26 22:02:25,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:02:25,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 22:02:25,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828312980] [2019-12-26 22:02:25,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 22:02:25,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:02:25,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 22:02:25,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:02:25,189 INFO L87 Difference]: Start difference. First operand 24763 states and 76114 transitions. Second operand 11 states. [2019-12-26 22:02:26,692 WARN L192 SmtUtils]: Spent 333.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-12-26 22:02:26,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:02:26,818 INFO L93 Difference]: Finished difference Result 51147 states and 157438 transitions. [2019-12-26 22:02:26,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-26 22:02:26,818 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-26 22:02:26,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:02:26,874 INFO L225 Difference]: With dead ends: 51147 [2019-12-26 22:02:26,874 INFO L226 Difference]: Without dead ends: 40440 [2019-12-26 22:02:26,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=184, Invalid=808, Unknown=0, NotChecked=0, Total=992 [2019-12-26 22:02:26,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40440 states. [2019-12-26 22:02:27,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40440 to 24072. [2019-12-26 22:02:27,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24072 states. [2019-12-26 22:02:27,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24072 states to 24072 states and 73825 transitions. [2019-12-26 22:02:27,389 INFO L78 Accepts]: Start accepts. Automaton has 24072 states and 73825 transitions. Word has length 66 [2019-12-26 22:02:27,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:02:27,389 INFO L462 AbstractCegarLoop]: Abstraction has 24072 states and 73825 transitions. [2019-12-26 22:02:27,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 22:02:27,389 INFO L276 IsEmpty]: Start isEmpty. Operand 24072 states and 73825 transitions. [2019-12-26 22:02:27,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 22:02:27,420 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:02:27,420 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:02:27,421 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:02:27,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:02:27,421 INFO L82 PathProgramCache]: Analyzing trace with hash -952881413, now seen corresponding path program 6 times [2019-12-26 22:02:27,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:02:27,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000287980] [2019-12-26 22:02:27,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:02:27,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:02:27,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:02:27,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000287980] [2019-12-26 22:02:27,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:02:27,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 22:02:27,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819514114] [2019-12-26 22:02:27,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 22:02:27,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:02:27,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 22:02:27,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-26 22:02:27,639 INFO L87 Difference]: Start difference. First operand 24072 states and 73825 transitions. Second operand 12 states. [2019-12-26 22:02:28,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:02:28,799 INFO L93 Difference]: Finished difference Result 40893 states and 125275 transitions. [2019-12-26 22:02:28,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 22:02:28,799 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-26 22:02:28,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:02:28,856 INFO L225 Difference]: With dead ends: 40893 [2019-12-26 22:02:28,856 INFO L226 Difference]: Without dead ends: 39908 [2019-12-26 22:02:28,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-26 22:02:28,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39908 states. [2019-12-26 22:02:29,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39908 to 23404. [2019-12-26 22:02:29,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23404 states. [2019-12-26 22:02:29,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23404 states to 23404 states and 71986 transitions. [2019-12-26 22:02:29,339 INFO L78 Accepts]: Start accepts. Automaton has 23404 states and 71986 transitions. Word has length 66 [2019-12-26 22:02:29,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:02:29,339 INFO L462 AbstractCegarLoop]: Abstraction has 23404 states and 71986 transitions. [2019-12-26 22:02:29,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 22:02:29,339 INFO L276 IsEmpty]: Start isEmpty. Operand 23404 states and 71986 transitions. [2019-12-26 22:02:29,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 22:02:29,363 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:02:29,363 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-26 22:02:29,363 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:02:29,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:02:29,363 INFO L82 PathProgramCache]: Analyzing trace with hash 620198601, now seen corresponding path program 7 times [2019-12-26 22:02:29,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:02:29,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385272560] [2019-12-26 22:02:29,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:02:29,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:02:29,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:02:29,479 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 22:02:29,479 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 22:02:29,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] ULTIMATE.startENTRY-->L825: Formula: (let ((.cse0 (store |v_#valid_71| 0 0))) (and (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t663~0.base_22| 4)) (= v_~z$w_buff0_used~0_749 0) (= v_~weak$$choice2~0_132 0) (= 0 v_~weak$$choice0~0_14) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_6| 0) (= v_~z$r_buff0_thd1~0_380 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t663~0.base_22|)) (= v_~z$r_buff0_thd2~0_184 0) (= v_~__unbuffered_cnt~0_128 0) (= v_~y~0_48 0) (= v_~z$mem_tmp~0_24 0) (< 0 |v_#StackHeapBarrier_15|) (= v_~z$r_buff1_thd0~0_296 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~__unbuffered_p2_EBX~0_50 0) (= v_~z$w_buff1_used~0_500 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t663~0.base_22| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t663~0.base_22|) |v_ULTIMATE.start_main_~#t663~0.offset_16| 0)) |v_#memory_int_19|) (= v_~z$r_buff0_thd0~0_197 0) (= 0 |v_#NULL.base_6|) (= 0 v_~z$flush_delayed~0_43) (= 0 v_~__unbuffered_p0_EAX~0_233) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t663~0.base_22|) (= v_~z$read_delayed~0_7 0) (= 0 v_~z$r_buff1_thd3~0_396) (= v_~z$r_buff1_thd1~0_267 0) (= 0 v_~__unbuffered_p2_EAX~0_37) (= |v_ULTIMATE.start_main_~#t663~0.offset_16| 0) (= v_~z$w_buff0~0_256 0) (= v_~main$tmp_guard0~0_22 0) (= 0 v_~z$r_buff0_thd3~0_379) (= v_~z$r_buff1_thd2~0_280 0) (= v_~z$w_buff1~0_199 0) (= 0 v_~x~0_133) (= |v_#valid_69| (store .cse0 |v_ULTIMATE.start_main_~#t663~0.base_22| 1)) (= v_~z~0_182 0) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t665~0.base=|v_ULTIMATE.start_main_~#t665~0.base_17|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_280, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_63|, ULTIMATE.start_main_~#t665~0.offset=|v_ULTIMATE.start_main_~#t665~0.offset_14|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_113|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_223|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_76|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_197, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_233, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_37, ~z$mem_tmp~0=v_~z$mem_tmp~0_24, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_50, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_500, ~z$flush_delayed~0=v_~z$flush_delayed~0_43, ULTIMATE.start_main_~#t663~0.base=|v_ULTIMATE.start_main_~#t663~0.base_22|, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_267, ULTIMATE.start_main_~#t664~0.base=|v_ULTIMATE.start_main_~#t664~0.base_19|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_379, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_128, ~x~0=v_~x~0_133, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_199, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_45|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_33|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_296, ULTIMATE.start_main_~#t664~0.offset=|v_ULTIMATE.start_main_~#t664~0.offset_14|, ~y~0=v_~y~0_48, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_184, ULTIMATE.start_main_~#t663~0.offset=|v_ULTIMATE.start_main_~#t663~0.offset_16|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_19|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_749, ~z$w_buff0~0=v_~z$w_buff0~0_256, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_396, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_182, ~weak$$choice2~0=v_~weak$$choice2~0_132, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_380} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t665~0.base, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_~#t665~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_~#t663~0.base, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ULTIMATE.start_main_~#t664~0.base, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t664~0.offset, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t663~0.offset, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 22:02:29,485 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L4-->L746: Formula: (and (= v_~z$r_buff0_thd1~0_29 v_~z$r_buff1_thd1~0_17) (not (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10 0)) (= v_~z$r_buff0_thd2~0_25 v_~z$r_buff1_thd2~0_17) (= v_~z$r_buff0_thd3~0_70 v_~z$r_buff1_thd3~0_54) (= v_~z$r_buff0_thd1~0_28 1) (= v_~z$r_buff0_thd0~0_26 v_~z$r_buff1_thd0~0_23) (= v_~x~0_9 v_~__unbuffered_p0_EAX~0_11)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_26, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_70, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_29, ~x~0=v_~x~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_11, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_26, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_54, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_23, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_17, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_17, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_70, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_28, ~x~0=v_~x~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 22:02:29,486 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L825-1-->L827: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t664~0.base_11|) (= |v_ULTIMATE.start_main_~#t664~0.offset_10| 0) (not (= |v_ULTIMATE.start_main_~#t664~0.base_11| 0)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t664~0.base_11| 4)) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t664~0.base_11|) 0) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t664~0.base_11| 1) |v_#valid_31|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t664~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t664~0.base_11|) |v_ULTIMATE.start_main_~#t664~0.offset_10| 1)) |v_#memory_int_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t664~0.base=|v_ULTIMATE.start_main_~#t664~0.base_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t664~0.offset=|v_ULTIMATE.start_main_~#t664~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t664~0.base, #length, ULTIMATE.start_main_~#t664~0.offset] because there is no mapped edge [2019-12-26 22:02:29,488 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [856] [856] L827-1-->L829: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t665~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t665~0.base_12|) |v_ULTIMATE.start_main_~#t665~0.offset_10| 2)) |v_#memory_int_11|) (not (= 0 |v_ULTIMATE.start_main_~#t665~0.base_12|)) (= 0 |v_ULTIMATE.start_main_~#t665~0.offset_10|) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t665~0.base_12| 1)) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t665~0.base_12|)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t665~0.base_12|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t665~0.base_12| 4) |v_#length_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t665~0.base=|v_ULTIMATE.start_main_~#t665~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_29|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t665~0.offset=|v_ULTIMATE.start_main_~#t665~0.offset_10|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t665~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t665~0.offset, #length] because there is no mapped edge [2019-12-26 22:02:29,492 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L766-2-->L766-5: Formula: (let ((.cse1 (= |P1Thread1of1ForFork2_#t~ite9_Out-1413387751| |P1Thread1of1ForFork2_#t~ite10_Out-1413387751|)) (.cse2 (= (mod ~z$w_buff1_used~0_In-1413387751 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-1413387751 256)))) (or (and (not .cse0) .cse1 (= |P1Thread1of1ForFork2_#t~ite9_Out-1413387751| ~z$w_buff1~0_In-1413387751) (not .cse2)) (and .cse1 (or .cse2 .cse0) (= |P1Thread1of1ForFork2_#t~ite9_Out-1413387751| ~z~0_In-1413387751)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1413387751, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1413387751, ~z$w_buff1~0=~z$w_buff1~0_In-1413387751, ~z~0=~z~0_In-1413387751} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-1413387751|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1413387751, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out-1413387751|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1413387751, ~z$w_buff1~0=~z$w_buff1~0_In-1413387751, ~z~0=~z~0_In-1413387751} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-26 22:02:29,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L792-->L792-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1591357792 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite23_In-1591357792| |P2Thread1of1ForFork0_#t~ite23_Out-1591357792|) (not .cse0) (= ~z$w_buff1~0_In-1591357792 |P2Thread1of1ForFork0_#t~ite24_Out-1591357792|)) (and (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-1591357792 256) 0))) (or (and (= 0 (mod ~z$w_buff1_used~0_In-1591357792 256)) .cse1) (and (= (mod ~z$r_buff1_thd3~0_In-1591357792 256) 0) .cse1) (= (mod ~z$w_buff0_used~0_In-1591357792 256) 0))) (= |P2Thread1of1ForFork0_#t~ite23_Out-1591357792| |P2Thread1of1ForFork0_#t~ite24_Out-1591357792|) .cse0 (= |P2Thread1of1ForFork0_#t~ite23_Out-1591357792| ~z$w_buff1~0_In-1591357792)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1591357792, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1591357792, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In-1591357792|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1591357792, ~z$w_buff1~0=~z$w_buff1~0_In-1591357792, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1591357792, ~weak$$choice2~0=~weak$$choice2~0_In-1591357792} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1591357792, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out-1591357792|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1591357792, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out-1591357792|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1591357792, ~z$w_buff1~0=~z$w_buff1~0_In-1591357792, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1591357792, ~weak$$choice2~0=~weak$$choice2~0_In-1591357792} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-26 22:02:29,496 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L794-->L794-8: Formula: (let ((.cse4 (= |P2Thread1of1ForFork0_#t~ite30_Out1128918884| |P2Thread1of1ForFork0_#t~ite29_Out1128918884|)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1128918884 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1128918884 256))) (.cse6 (= 0 (mod ~z$r_buff0_thd3~0_In1128918884 256))) (.cse5 (= 0 (mod ~z$r_buff1_thd3~0_In1128918884 256))) (.cse0 (= 0 (mod ~weak$$choice2~0_In1128918884 256)))) (or (let ((.cse1 (not .cse6))) (and .cse0 (or .cse1 (not .cse2)) (not .cse3) .cse4 (or .cse1 (not .cse5)) (= |P2Thread1of1ForFork0_#t~ite28_Out1128918884| 0) (= |P2Thread1of1ForFork0_#t~ite28_Out1128918884| |P2Thread1of1ForFork0_#t~ite29_Out1128918884|))) (and (= |P2Thread1of1ForFork0_#t~ite28_In1128918884| |P2Thread1of1ForFork0_#t~ite28_Out1128918884|) (or (and .cse0 .cse4 (or (and .cse6 .cse2) .cse3 (and .cse6 .cse5)) (= |P2Thread1of1ForFork0_#t~ite29_Out1128918884| ~z$w_buff1_used~0_In1128918884)) (and (= |P2Thread1of1ForFork0_#t~ite29_In1128918884| |P2Thread1of1ForFork0_#t~ite29_Out1128918884|) (= |P2Thread1of1ForFork0_#t~ite30_Out1128918884| ~z$w_buff1_used~0_In1128918884) (not .cse0)))))) InVars {P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_In1128918884|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1128918884, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1128918884, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1128918884, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1128918884, ~weak$$choice2~0=~weak$$choice2~0_In1128918884, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In1128918884|} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out1128918884|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1128918884, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1128918884, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1128918884, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1128918884, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out1128918884|, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out1128918884|, ~weak$$choice2~0=~weak$$choice2~0_In1128918884} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-26 22:02:29,496 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [890] [890] L794-8-->L796: Formula: (and (= v_~z$w_buff1_used~0_493 |v_P2Thread1of1ForFork0_#t~ite30_38|) (not (= (mod v_~weak$$choice2~0_130 256) 0)) (= v_~z$r_buff0_thd3~0_373 v_~z$r_buff0_thd3~0_372)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_373, P2Thread1of1ForFork0_#t~ite30=|v_P2Thread1of1ForFork0_#t~ite30_38|, ~weak$$choice2~0=v_~weak$$choice2~0_130} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_39|, P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_15|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_31|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_493, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_372, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_23|, P2Thread1of1ForFork0_#t~ite30=|v_P2Thread1of1ForFork0_#t~ite30_37|, ~weak$$choice2~0=v_~weak$$choice2~0_130, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_49|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31, P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-26 22:02:29,498 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L798-->L802: Formula: (and (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= 0 v_~z$flush_delayed~0_9) (= v_~z~0_46 v_~z$mem_tmp~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_46} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-26 22:02:29,499 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L802-2-->L802-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork0_#t~ite38_Out-543389275| |P2Thread1of1ForFork0_#t~ite39_Out-543389275|)) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In-543389275 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-543389275 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite38_Out-543389275| ~z~0_In-543389275) .cse0 (or .cse1 .cse2)) (and .cse0 (= |P2Thread1of1ForFork0_#t~ite38_Out-543389275| ~z$w_buff1~0_In-543389275) (not .cse2) (not .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-543389275, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-543389275, ~z$w_buff1~0=~z$w_buff1~0_In-543389275, ~z~0=~z~0_In-543389275} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out-543389275|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-543389275|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-543389275, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-543389275, ~z$w_buff1~0=~z$w_buff1~0_In-543389275, ~z~0=~z~0_In-543389275} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-26 22:02:29,500 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L803-->L803-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In265794656 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In265794656 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out265794656|)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite40_Out265794656| ~z$w_buff0_used~0_In265794656)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In265794656, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In265794656} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In265794656, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out265794656|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In265794656} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-26 22:02:29,501 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L804-->L804-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In-389135945 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In-389135945 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-389135945 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-389135945 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite41_Out-389135945| ~z$w_buff1_used~0_In-389135945) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork0_#t~ite41_Out-389135945| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-389135945, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-389135945, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-389135945, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-389135945} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-389135945, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-389135945, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-389135945, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-389135945, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-389135945|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-26 22:02:29,502 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L805-->L805-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In2049133426 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In2049133426 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite42_Out2049133426| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out2049133426| ~z$r_buff0_thd3~0_In2049133426)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2049133426, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2049133426} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2049133426, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2049133426, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out2049133426|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-26 22:02:29,502 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L806-->L806-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In642426159 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In642426159 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In642426159 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In642426159 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite43_Out642426159| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork0_#t~ite43_Out642426159| ~z$r_buff1_thd3~0_In642426159) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In642426159, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In642426159, ~z$w_buff1_used~0=~z$w_buff1_used~0_In642426159, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In642426159} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out642426159|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In642426159, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In642426159, ~z$w_buff1_used~0=~z$w_buff1_used~0_In642426159, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In642426159} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-26 22:02:29,503 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L806-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_100 1) v_~__unbuffered_cnt~0_99) (= v_~z$r_buff1_thd3~0_306 |v_P2Thread1of1ForFork0_#t~ite43_56|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_56|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_55|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_306, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_99, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-26 22:02:29,503 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L747-->L747-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1458707467 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd1~0_In-1458707467 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite5_Out-1458707467| ~z$w_buff0_used~0_In-1458707467)) (and (= |P0Thread1of1ForFork1_#t~ite5_Out-1458707467| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1458707467, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1458707467} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-1458707467|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1458707467, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1458707467} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-26 22:02:29,504 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L748-->L748-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-487317593 256))) (.cse3 (= (mod ~z$r_buff1_thd1~0_In-487317593 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-487317593 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-487317593 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-487317593 |P0Thread1of1ForFork1_#t~ite6_Out-487317593|)) (and (= |P0Thread1of1ForFork1_#t~ite6_Out-487317593| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-487317593, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-487317593, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-487317593, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-487317593} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-487317593, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-487317593|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-487317593, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-487317593, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-487317593} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-26 22:02:29,504 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L749-->L750: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In308082645 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In308082645 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_In308082645 ~z$r_buff0_thd1~0_Out308082645)) (and (not .cse0) (not .cse1) (= 0 ~z$r_buff0_thd1~0_Out308082645)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In308082645, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In308082645} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In308082645, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out308082645|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out308082645} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 22:02:29,505 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L750-->L750-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In1254301718 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In1254301718 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1254301718 256))) (.cse1 (= (mod ~z$r_buff1_thd1~0_In1254301718 256) 0))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite8_Out1254301718|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd1~0_In1254301718 |P0Thread1of1ForFork1_#t~ite8_Out1254301718|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1254301718, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1254301718, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1254301718, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1254301718} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out1254301718|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1254301718, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1254301718, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1254301718, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1254301718} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-26 22:02:29,505 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L750-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~z$r_buff1_thd1~0_83 |v_P0Thread1of1ForFork1_#t~ite8_40|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_39|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_83, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-26 22:02:29,505 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L767-->L767-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In323503341 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In323503341 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out323503341| ~z$w_buff0_used~0_In323503341)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite11_Out323503341| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In323503341, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In323503341} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In323503341, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out323503341|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In323503341} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-26 22:02:29,506 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L768-->L768-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In-555959328 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In-555959328 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-555959328 256))) (.cse0 (= (mod ~z$r_buff1_thd2~0_In-555959328 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite12_Out-555959328| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In-555959328 |P1Thread1of1ForFork2_#t~ite12_Out-555959328|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-555959328, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-555959328, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-555959328, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-555959328} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-555959328, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-555959328, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-555959328, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-555959328|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-555959328} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-26 22:02:29,506 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L769-->L769-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In673202687 256))) (.cse0 (= (mod ~z$r_buff0_thd2~0_In673202687 256) 0))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite13_Out673202687|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd2~0_In673202687 |P1Thread1of1ForFork2_#t~ite13_Out673202687|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In673202687, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In673202687} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In673202687, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out673202687|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In673202687} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-26 22:02:29,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L770-->L770-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In1631602162 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd2~0_In1631602162 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1631602162 256))) (.cse0 (= (mod ~z$r_buff1_thd2~0_In1631602162 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite14_Out1631602162| ~z$r_buff1_thd2~0_In1631602162)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork2_#t~ite14_Out1631602162|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1631602162, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1631602162, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1631602162, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1631602162} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1631602162, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1631602162, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1631602162, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out1631602162|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1631602162} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-26 22:02:29,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L770-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_186 |v_P1Thread1of1ForFork2_#t~ite14_50|) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_94 1) v_~__unbuffered_cnt~0_93) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_94, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_50|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_186, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_49|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-26 22:02:29,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L829-1-->L835: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 22:02:29,508 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L835-2-->L835-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-1587374235 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1587374235 256)))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out-1587374235| ~z$w_buff1~0_In-1587374235) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite47_Out-1587374235| ~z~0_In-1587374235)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1587374235, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1587374235, ~z$w_buff1~0=~z$w_buff1~0_In-1587374235, ~z~0=~z~0_In-1587374235} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1587374235, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1587374235|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1587374235, ~z$w_buff1~0=~z$w_buff1~0_In-1587374235, ~z~0=~z~0_In-1587374235} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-26 22:02:29,508 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L835-4-->L836: Formula: (= v_~z~0_40 |v_ULTIMATE.start_main_#t~ite47_9|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_9|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_8|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_12|, ~z~0=v_~z~0_40} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48, ~z~0] because there is no mapped edge [2019-12-26 22:02:29,508 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L836-->L836-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1892564737 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1892564737 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite49_Out-1892564737|)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1892564737 |ULTIMATE.start_main_#t~ite49_Out-1892564737|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1892564737, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1892564737} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1892564737, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1892564737, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1892564737|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-26 22:02:29,509 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L837-->L837-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-464817903 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-464817903 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-464817903 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-464817903 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite50_Out-464817903|)) (and (or .cse1 .cse0) (= ~z$w_buff1_used~0_In-464817903 |ULTIMATE.start_main_#t~ite50_Out-464817903|) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-464817903, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-464817903, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-464817903, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-464817903} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-464817903|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-464817903, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-464817903, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-464817903, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-464817903} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-26 22:02:29,509 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L838-->L838-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In2030693531 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In2030693531 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out2030693531|) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In2030693531 |ULTIMATE.start_main_#t~ite51_Out2030693531|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2030693531, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2030693531} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2030693531, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out2030693531|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2030693531} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-26 22:02:29,510 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L839-->L839-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd0~0_In540059782 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In540059782 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In540059782 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In540059782 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite52_Out540059782| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~z$r_buff1_thd0~0_In540059782 |ULTIMATE.start_main_#t~ite52_Out540059782|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In540059782, ~z$w_buff0_used~0=~z$w_buff0_used~0_In540059782, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In540059782, ~z$w_buff1_used~0=~z$w_buff1_used~0_In540059782} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out540059782|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In540059782, ~z$w_buff0_used~0=~z$w_buff0_used~0_In540059782, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In540059782, ~z$w_buff1_used~0=~z$w_buff1_used~0_In540059782} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-26 22:02:29,510 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L839-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y~0_25 2) (= 2 v_~__unbuffered_p2_EAX~0_21) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~z$r_buff1_thd0~0_219 |v_ULTIMATE.start_main_#t~ite52_38|) (= v_~main$tmp_guard1~0_16 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_~__unbuffered_p2_EBX~0_34 0) (= 0 v_~__unbuffered_p0_EAX~0_178)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_178, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~y~0=v_~y~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_178, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_37|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_219, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~y~0=v_~y~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} 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-26 22:02:29,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 10:02:29 BasicIcfg [2019-12-26 22:02:29,587 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 22:02:29,588 INFO L168 Benchmark]: Toolchain (without parser) took 135840.52 ms. Allocated memory was 137.9 MB in the beginning and 3.7 GB in the end (delta: 3.6 GB). Free memory was 101.3 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2019-12-26 22:02:29,589 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-26 22:02:29,589 INFO L168 Benchmark]: CACSL2BoogieTranslator took 729.45 ms. Allocated memory was 137.9 MB in the beginning and 200.8 MB in the end (delta: 62.9 MB). Free memory was 100.8 MB in the beginning and 152.1 MB in the end (delta: -51.2 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2019-12-26 22:02:29,590 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.16 ms. Allocated memory is still 200.8 MB. Free memory was 152.1 MB in the beginning and 149.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-26 22:02:29,590 INFO L168 Benchmark]: Boogie Preprocessor took 37.88 ms. Allocated memory is still 200.8 MB. Free memory was 149.3 MB in the beginning and 147.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-26 22:02:29,591 INFO L168 Benchmark]: RCFGBuilder took 780.81 ms. Allocated memory is still 200.8 MB. Free memory was 147.3 MB in the beginning and 96.7 MB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 7.1 GB. [2019-12-26 22:02:29,591 INFO L168 Benchmark]: TraceAbstraction took 134224.37 ms. Allocated memory was 200.8 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 96.0 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2019-12-26 22:02:29,594 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 729.45 ms. Allocated memory was 137.9 MB in the beginning and 200.8 MB in the end (delta: 62.9 MB). Free memory was 100.8 MB in the beginning and 152.1 MB in the end (delta: -51.2 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.16 ms. Allocated memory is still 200.8 MB. Free memory was 152.1 MB in the beginning and 149.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.88 ms. Allocated memory is still 200.8 MB. Free memory was 149.3 MB in the beginning and 147.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 780.81 ms. Allocated memory is still 200.8 MB. Free memory was 147.3 MB in the beginning and 96.7 MB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 134224.37 ms. Allocated memory was 200.8 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 96.0 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.7s, 176 ProgramPointsBefore, 94 ProgramPointsAfterwards, 213 TransitionsBefore, 105 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 33 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 30 ChoiceCompositions, 7047 VarBasedMoverChecksPositive, 336 VarBasedMoverChecksNegative, 168 SemBasedMoverChecksPositive, 252 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 130103 CheckedPairsTotal, 120 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L825] FCALL, FORK 0 pthread_create(&t663, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L731] 1 z$w_buff1 = z$w_buff0 [L732] 1 z$w_buff0 = 1 [L733] 1 z$w_buff1_used = z$w_buff0_used [L734] 1 z$w_buff0_used = (_Bool)1 [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_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=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(&t664, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L760] 2 x = 1 [L763] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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] [L766] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_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=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] [L829] FCALL, FORK 0 pthread_create(&t665, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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] [L780] 3 y = 2 [L783] 3 __unbuffered_p2_EAX = y [L786] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L787] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L788] 3 z$flush_delayed = weak$$choice2 [L789] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, 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] [L790] 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_p0_EAX=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=1, 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] [L790] 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) [L766] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L791] EXPR 3 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, 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))=1, x=1, 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] [L791] 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)) [L792] 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)) [L793] EXPR 3 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, 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))=1, x=1, 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] [L793] 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)) [L796] 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=0, __unbuffered_p0_EAX=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, 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=1, 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] [L796] 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)) [L797] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, 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] [L802] 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=0, __unbuffered_p0_EAX=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=1, 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=1, z$w_buff1=0, z$w_buff1_used=0] [L802] 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) [L803] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L804] 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 [L805] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L746] 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) [L747] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L748] 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 [L767] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L768] 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 [L769] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L835] 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_p0_EAX=0, __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=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_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] [L836] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L837] 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 [L838] 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, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 133.8s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 55.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8721 SDtfs, 12077 SDslu, 36799 SDs, 0 SdLazy, 30137 SolverSat, 551 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 25.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 564 GetRequests, 41 SyntacticMatches, 47 SemanticMatches, 476 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5037 ImplicationChecksByTransitivity, 8.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156115occurred 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: 45.2s AutomataMinimizationTime, 31 MinimizatonAttempts, 372164 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 1418 NumberOfCodeBlocks, 1418 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1321 ConstructedInterpolants, 0 QuantifiedInterpolants, 362723 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...