/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix015_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 20:24:26,404 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 20:24:26,406 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 20:24:26,418 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 20:24:26,419 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 20:24:26,420 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 20:24:26,421 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 20:24:26,423 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 20:24:26,424 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 20:24:26,425 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 20:24:26,426 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 20:24:26,427 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 20:24:26,428 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 20:24:26,429 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 20:24:26,429 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 20:24:26,431 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 20:24:26,431 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 20:24:26,432 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 20:24:26,434 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 20:24:26,436 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 20:24:26,437 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 20:24:26,438 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 20:24:26,440 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 20:24:26,440 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 20:24:26,442 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 20:24:26,443 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 20:24:26,443 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 20:24:26,444 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 20:24:26,444 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 20:24:26,445 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 20:24:26,446 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 20:24:26,446 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 20:24:26,447 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 20:24:26,448 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 20:24:26,449 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 20:24:26,449 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 20:24:26,450 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 20:24:26,450 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 20:24:26,450 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 20:24:26,451 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 20:24:26,452 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 20:24:26,452 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 20:24:26,466 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 20:24:26,467 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 20:24:26,468 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 20:24:26,468 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 20:24:26,468 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 20:24:26,469 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 20:24:26,469 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 20:24:26,469 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 20:24:26,469 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 20:24:26,469 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 20:24:26,470 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 20:24:26,470 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 20:24:26,470 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 20:24:26,470 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 20:24:26,470 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 20:24:26,470 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 20:24:26,471 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 20:24:26,471 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 20:24:26,471 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 20:24:26,471 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 20:24:26,472 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 20:24:26,472 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 20:24:26,472 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 20:24:26,472 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 20:24:26,472 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 20:24:26,473 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 20:24:26,473 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 20:24:26,473 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 20:24:26,473 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 20:24:26,473 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 20:24:26,759 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 20:24:26,782 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 20:24:26,785 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 20:24:26,786 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 20:24:26,786 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 20:24:26,787 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix015_power.oepc.i [2019-12-18 20:24:26,856 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e74c29594/4439eec45c72415dbc13d081be0ee555/FLAGbeafa7ff1 [2019-12-18 20:24:27,382 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 20:24:27,383 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix015_power.oepc.i [2019-12-18 20:24:27,402 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e74c29594/4439eec45c72415dbc13d081be0ee555/FLAGbeafa7ff1 [2019-12-18 20:24:27,634 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e74c29594/4439eec45c72415dbc13d081be0ee555 [2019-12-18 20:24:27,644 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 20:24:27,646 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 20:24:27,647 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 20:24:27,647 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 20:24:27,651 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 20:24:27,652 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:24:27" (1/1) ... [2019-12-18 20:24:27,655 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2306dbe3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:24:27, skipping insertion in model container [2019-12-18 20:24:27,655 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:24:27" (1/1) ... [2019-12-18 20:24:27,663 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 20:24:27,724 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 20:24:28,279 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:24:28,297 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 20:24:28,370 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:24:28,465 INFO L208 MainTranslator]: Completed translation [2019-12-18 20:24:28,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:24:28 WrapperNode [2019-12-18 20:24:28,466 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 20:24:28,466 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 20:24:28,467 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 20:24:28,467 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 20:24:28,476 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:24:28" (1/1) ... [2019-12-18 20:24:28,498 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:24:28" (1/1) ... [2019-12-18 20:24:28,540 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 20:24:28,542 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 20:24:28,542 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 20:24:28,542 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 20:24:28,552 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:24:28" (1/1) ... [2019-12-18 20:24:28,553 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:24:28" (1/1) ... [2019-12-18 20:24:28,557 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:24:28" (1/1) ... [2019-12-18 20:24:28,558 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:24:28" (1/1) ... [2019-12-18 20:24:28,569 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:24:28" (1/1) ... [2019-12-18 20:24:28,573 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:24:28" (1/1) ... [2019-12-18 20:24:28,577 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:24:28" (1/1) ... [2019-12-18 20:24:28,582 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 20:24:28,583 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 20:24:28,583 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 20:24:28,583 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 20:24:28,584 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:24:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 20:24:28,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 20:24:28,665 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 20:24:28,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 20:24:28,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 20:24:28,665 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 20:24:28,665 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 20:24:28,666 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 20:24:28,666 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 20:24:28,666 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 20:24:28,666 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 20:24:28,666 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 20:24:28,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 20:24:28,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 20:24:28,669 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 20:24:29,661 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 20:24:29,662 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 20:24:29,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:24:29 BoogieIcfgContainer [2019-12-18 20:24:29,663 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 20:24:29,665 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 20:24:29,665 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 20:24:29,668 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 20:24:29,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 08:24:27" (1/3) ... [2019-12-18 20:24:29,669 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77881fd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:24:29, skipping insertion in model container [2019-12-18 20:24:29,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:24:28" (2/3) ... [2019-12-18 20:24:29,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77881fd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:24:29, skipping insertion in model container [2019-12-18 20:24:29,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:24:29" (3/3) ... [2019-12-18 20:24:29,672 INFO L109 eAbstractionObserver]: Analyzing ICFG mix015_power.oepc.i [2019-12-18 20:24:29,682 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 20:24:29,682 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 20:24:29,689 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 20:24:29,690 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 20:24:29,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,737 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,738 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,738 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,738 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,739 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,739 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,763 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,763 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,790 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,790 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,818 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,818 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,818 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,818 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,818 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,819 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,819 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,819 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,819 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,820 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,820 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,820 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,820 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,820 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,821 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,821 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,821 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,821 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,821 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,822 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,822 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,822 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,822 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,822 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,823 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,823 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,823 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,823 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,823 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,824 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,824 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,824 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,824 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,824 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,833 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,835 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,843 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,843 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,844 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,852 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,852 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:24:29,872 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 20:24:29,892 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 20:24:29,893 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 20:24:29,893 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 20:24:29,893 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 20:24:29,893 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 20:24:29,893 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 20:24:29,893 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 20:24:29,893 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 20:24:29,911 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 216 transitions [2019-12-18 20:24:29,913 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-18 20:24:30,033 INFO L126 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-18 20:24:30,033 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:24:30,057 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 9/173 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 20:24:30,082 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-18 20:24:30,155 INFO L126 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-18 20:24:30,155 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:24:30,165 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 9/173 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 20:24:30,183 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 20:24:30,184 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 20:24:33,875 WARN L192 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-18 20:24:34,026 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-18 20:24:34,121 INFO L206 etLargeBlockEncoding]: Checked pairs total: 83227 [2019-12-18 20:24:34,122 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-18 20:24:34,126 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 104 transitions [2019-12-18 20:24:53,831 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 120962 states. [2019-12-18 20:24:53,834 INFO L276 IsEmpty]: Start isEmpty. Operand 120962 states. [2019-12-18 20:24:53,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 20:24:53,842 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:24:53,844 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 20:24:53,844 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-18 20:24:53,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:24:53,851 INFO L82 PathProgramCache]: Analyzing trace with hash 919898, now seen corresponding path program 1 times [2019-12-18 20:24:53,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:24:53,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224937232] [2019-12-18 20:24:53,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:24:53,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:24:54,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:24:54,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224937232] [2019-12-18 20:24:54,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:24:54,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:24:54,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943561703] [2019-12-18 20:24:54,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:24:54,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:24:54,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:24:54,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:24:54,098 INFO L87 Difference]: Start difference. First operand 120962 states. Second operand 3 states. [2019-12-18 20:24:57,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:24:57,139 INFO L93 Difference]: Finished difference Result 119798 states and 510282 transitions. [2019-12-18 20:24:57,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:24:57,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 20:24:57,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:24:57,834 INFO L225 Difference]: With dead ends: 119798 [2019-12-18 20:24:57,834 INFO L226 Difference]: Without dead ends: 112910 [2019-12-18 20:24:57,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:25:04,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112910 states. [2019-12-18 20:25:07,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112910 to 112910. [2019-12-18 20:25:07,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112910 states. [2019-12-18 20:25:08,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112910 states to 112910 states and 480308 transitions. [2019-12-18 20:25:08,253 INFO L78 Accepts]: Start accepts. Automaton has 112910 states and 480308 transitions. Word has length 3 [2019-12-18 20:25:08,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:25:08,254 INFO L462 AbstractCegarLoop]: Abstraction has 112910 states and 480308 transitions. [2019-12-18 20:25:08,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:25:08,254 INFO L276 IsEmpty]: Start isEmpty. Operand 112910 states and 480308 transitions. [2019-12-18 20:25:08,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 20:25:08,257 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:25:08,257 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:25:08,258 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-18 20:25:08,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:25:08,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1163520711, now seen corresponding path program 1 times [2019-12-18 20:25:08,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:25:08,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135364213] [2019-12-18 20:25:08,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:25:08,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:25:08,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:25:08,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135364213] [2019-12-18 20:25:08,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:25:08,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:25:08,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592738099] [2019-12-18 20:25:08,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:25:08,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:25:08,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:25:08,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:25:08,406 INFO L87 Difference]: Start difference. First operand 112910 states and 480308 transitions. Second operand 4 states. [2019-12-18 20:25:13,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:25:13,992 INFO L93 Difference]: Finished difference Result 175260 states and 715456 transitions. [2019-12-18 20:25:13,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:25:13,992 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 20:25:13,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:25:14,689 INFO L225 Difference]: With dead ends: 175260 [2019-12-18 20:25:14,689 INFO L226 Difference]: Without dead ends: 175211 [2019-12-18 20:25:14,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:25:20,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175211 states. [2019-12-18 20:25:24,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175211 to 160651. [2019-12-18 20:25:24,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160651 states. [2019-12-18 20:25:31,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160651 states to 160651 states and 663882 transitions. [2019-12-18 20:25:31,054 INFO L78 Accepts]: Start accepts. Automaton has 160651 states and 663882 transitions. Word has length 11 [2019-12-18 20:25:31,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:25:31,055 INFO L462 AbstractCegarLoop]: Abstraction has 160651 states and 663882 transitions. [2019-12-18 20:25:31,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:25:31,055 INFO L276 IsEmpty]: Start isEmpty. Operand 160651 states and 663882 transitions. [2019-12-18 20:25:31,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 20:25:31,066 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:25:31,066 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:25:31,066 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-18 20:25:31,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:25:31,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1406257601, now seen corresponding path program 1 times [2019-12-18 20:25:31,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:25:31,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070879823] [2019-12-18 20:25:31,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:25:31,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:25:31,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:25:31,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070879823] [2019-12-18 20:25:31,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:25:31,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:25:31,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513393751] [2019-12-18 20:25:31,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:25:31,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:25:31,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:25:31,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:25:31,132 INFO L87 Difference]: Start difference. First operand 160651 states and 663882 transitions. Second operand 3 states. [2019-12-18 20:25:31,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:25:31,312 INFO L93 Difference]: Finished difference Result 34503 states and 111808 transitions. [2019-12-18 20:25:31,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:25:31,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 20:25:31,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:25:31,372 INFO L225 Difference]: With dead ends: 34503 [2019-12-18 20:25:31,372 INFO L226 Difference]: Without dead ends: 34503 [2019-12-18 20:25:31,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:25:31,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34503 states. [2019-12-18 20:25:31,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34503 to 34503. [2019-12-18 20:25:31,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34503 states. [2019-12-18 20:25:32,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34503 states to 34503 states and 111808 transitions. [2019-12-18 20:25:32,026 INFO L78 Accepts]: Start accepts. Automaton has 34503 states and 111808 transitions. Word has length 13 [2019-12-18 20:25:32,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:25:32,026 INFO L462 AbstractCegarLoop]: Abstraction has 34503 states and 111808 transitions. [2019-12-18 20:25:32,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:25:32,026 INFO L276 IsEmpty]: Start isEmpty. Operand 34503 states and 111808 transitions. [2019-12-18 20:25:32,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 20:25:32,029 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:25:32,029 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:25:32,029 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-18 20:25:32,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:25:32,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1992610691, now seen corresponding path program 1 times [2019-12-18 20:25:32,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:25:32,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649985648] [2019-12-18 20:25:32,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:25:32,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:25:32,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:25:32,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649985648] [2019-12-18 20:25:32,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:25:32,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:25:32,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474446842] [2019-12-18 20:25:32,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:25:32,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:25:32,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:25:32,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:25:32,147 INFO L87 Difference]: Start difference. First operand 34503 states and 111808 transitions. Second operand 4 states. [2019-12-18 20:25:32,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:25:32,527 INFO L93 Difference]: Finished difference Result 42846 states and 138316 transitions. [2019-12-18 20:25:32,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:25:32,527 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 20:25:32,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:25:32,603 INFO L225 Difference]: With dead ends: 42846 [2019-12-18 20:25:32,603 INFO L226 Difference]: Without dead ends: 42846 [2019-12-18 20:25:32,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:25:34,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42846 states. [2019-12-18 20:25:34,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42846 to 38560. [2019-12-18 20:25:34,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38560 states. [2019-12-18 20:25:34,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38560 states to 38560 states and 124897 transitions. [2019-12-18 20:25:34,828 INFO L78 Accepts]: Start accepts. Automaton has 38560 states and 124897 transitions. Word has length 16 [2019-12-18 20:25:34,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:25:34,829 INFO L462 AbstractCegarLoop]: Abstraction has 38560 states and 124897 transitions. [2019-12-18 20:25:34,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:25:34,830 INFO L276 IsEmpty]: Start isEmpty. Operand 38560 states and 124897 transitions. [2019-12-18 20:25:34,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 20:25:34,841 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:25:34,841 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-18 20:25:34,841 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-18 20:25:34,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:25:34,842 INFO L82 PathProgramCache]: Analyzing trace with hash 352437866, now seen corresponding path program 1 times [2019-12-18 20:25:34,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:25:34,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558249151] [2019-12-18 20:25:34,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:25:34,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:25:35,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:25:35,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558249151] [2019-12-18 20:25:35,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:25:35,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:25:35,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53320830] [2019-12-18 20:25:35,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:25:35,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:25:35,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:25:35,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:25:35,026 INFO L87 Difference]: Start difference. First operand 38560 states and 124897 transitions. Second operand 7 states. [2019-12-18 20:25:35,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:25:35,876 INFO L93 Difference]: Finished difference Result 50748 states and 162165 transitions. [2019-12-18 20:25:35,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 20:25:35,877 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-18 20:25:35,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:25:35,960 INFO L225 Difference]: With dead ends: 50748 [2019-12-18 20:25:35,960 INFO L226 Difference]: Without dead ends: 50748 [2019-12-18 20:25:35,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-12-18 20:25:36,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50748 states. [2019-12-18 20:25:36,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50748 to 38668. [2019-12-18 20:25:36,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38668 states. [2019-12-18 20:25:37,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38668 states to 38668 states and 125202 transitions. [2019-12-18 20:25:37,743 INFO L78 Accepts]: Start accepts. Automaton has 38668 states and 125202 transitions. Word has length 22 [2019-12-18 20:25:37,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:25:37,743 INFO L462 AbstractCegarLoop]: Abstraction has 38668 states and 125202 transitions. [2019-12-18 20:25:37,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:25:37,744 INFO L276 IsEmpty]: Start isEmpty. Operand 38668 states and 125202 transitions. [2019-12-18 20:25:37,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 20:25:37,751 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:25:37,751 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-18 20:25:37,752 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-18 20:25:37,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:25:37,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1182905528, now seen corresponding path program 2 times [2019-12-18 20:25:37,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:25:37,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451614681] [2019-12-18 20:25:37,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:25:37,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:25:37,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:25:37,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451614681] [2019-12-18 20:25:37,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:25:37,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:25:37,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710629632] [2019-12-18 20:25:37,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:25:37,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:25:37,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:25:37,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:25:37,925 INFO L87 Difference]: Start difference. First operand 38668 states and 125202 transitions. Second operand 6 states. [2019-12-18 20:25:38,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:25:38,714 INFO L93 Difference]: Finished difference Result 53094 states and 169644 transitions. [2019-12-18 20:25:38,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 20:25:38,714 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 20:25:38,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:25:38,803 INFO L225 Difference]: With dead ends: 53094 [2019-12-18 20:25:38,804 INFO L226 Difference]: Without dead ends: 53087 [2019-12-18 20:25:38,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-18 20:25:39,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53087 states. [2019-12-18 20:25:39,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53087 to 37871. [2019-12-18 20:25:39,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37871 states. [2019-12-18 20:25:39,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37871 states to 37871 states and 122446 transitions. [2019-12-18 20:25:39,564 INFO L78 Accepts]: Start accepts. Automaton has 37871 states and 122446 transitions. Word has length 22 [2019-12-18 20:25:39,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:25:39,564 INFO L462 AbstractCegarLoop]: Abstraction has 37871 states and 122446 transitions. [2019-12-18 20:25:39,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:25:39,565 INFO L276 IsEmpty]: Start isEmpty. Operand 37871 states and 122446 transitions. [2019-12-18 20:25:39,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 20:25:39,576 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:25:39,576 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:25:39,576 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-18 20:25:39,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:25:39,576 INFO L82 PathProgramCache]: Analyzing trace with hash -772014791, now seen corresponding path program 1 times [2019-12-18 20:25:39,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:25:39,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796177980] [2019-12-18 20:25:39,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:25:39,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:25:39,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-18 20:25:39,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796177980] [2019-12-18 20:25:39,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:25:39,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:25:39,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169303630] [2019-12-18 20:25:39,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:25:39,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:25:39,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:25:39,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:25:39,625 INFO L87 Difference]: Start difference. First operand 37871 states and 122446 transitions. Second operand 4 states. [2019-12-18 20:25:39,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:25:39,691 INFO L93 Difference]: Finished difference Result 14666 states and 44680 transitions. [2019-12-18 20:25:39,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:25:39,691 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 20:25:39,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:25:39,711 INFO L225 Difference]: With dead ends: 14666 [2019-12-18 20:25:39,711 INFO L226 Difference]: Without dead ends: 14666 [2019-12-18 20:25:39,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:25:39,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14666 states. [2019-12-18 20:25:39,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14666 to 14422. [2019-12-18 20:25:39,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14422 states. [2019-12-18 20:25:39,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14422 states to 14422 states and 43984 transitions. [2019-12-18 20:25:39,933 INFO L78 Accepts]: Start accepts. Automaton has 14422 states and 43984 transitions. Word has length 25 [2019-12-18 20:25:39,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:25:39,934 INFO L462 AbstractCegarLoop]: Abstraction has 14422 states and 43984 transitions. [2019-12-18 20:25:39,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:25:39,934 INFO L276 IsEmpty]: Start isEmpty. Operand 14422 states and 43984 transitions. [2019-12-18 20:25:39,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 20:25:39,944 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:25:39,944 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:25:39,944 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-18 20:25:39,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:25:39,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1959375522, now seen corresponding path program 1 times [2019-12-18 20:25:39,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:25:39,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54508362] [2019-12-18 20:25:39,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:25:39,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:25:39,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:25:39,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54508362] [2019-12-18 20:25:39,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:25:39,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:25:39,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300650571] [2019-12-18 20:25:39,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:25:39,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:25:39,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:25:39,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:25:39,985 INFO L87 Difference]: Start difference. First operand 14422 states and 43984 transitions. Second operand 3 states. [2019-12-18 20:25:40,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:25:40,083 INFO L93 Difference]: Finished difference Result 22349 states and 67733 transitions. [2019-12-18 20:25:40,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:25:40,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 20:25:40,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:25:40,114 INFO L225 Difference]: With dead ends: 22349 [2019-12-18 20:25:40,114 INFO L226 Difference]: Without dead ends: 22349 [2019-12-18 20:25:40,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:25:40,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22349 states. [2019-12-18 20:25:41,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22349 to 17004. [2019-12-18 20:25:41,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17004 states. [2019-12-18 20:25:41,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17004 states to 17004 states and 52336 transitions. [2019-12-18 20:25:41,933 INFO L78 Accepts]: Start accepts. Automaton has 17004 states and 52336 transitions. Word has length 27 [2019-12-18 20:25:41,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:25:41,933 INFO L462 AbstractCegarLoop]: Abstraction has 17004 states and 52336 transitions. [2019-12-18 20:25:41,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:25:41,933 INFO L276 IsEmpty]: Start isEmpty. Operand 17004 states and 52336 transitions. [2019-12-18 20:25:41,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 20:25:41,945 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:25:41,945 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:25:41,946 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-18 20:25:41,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:25:41,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1187835806, now seen corresponding path program 1 times [2019-12-18 20:25:41,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:25:41,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669987935] [2019-12-18 20:25:41,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:25:41,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:25:42,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:25:42,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669987935] [2019-12-18 20:25:42,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:25:42,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:25:42,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933584366] [2019-12-18 20:25:42,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:25:42,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:25:42,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:25:42,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:25:42,052 INFO L87 Difference]: Start difference. First operand 17004 states and 52336 transitions. Second operand 6 states. [2019-12-18 20:25:42,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:25:42,939 INFO L93 Difference]: Finished difference Result 35174 states and 105481 transitions. [2019-12-18 20:25:42,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 20:25:42,939 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 20:25:42,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:25:43,009 INFO L225 Difference]: With dead ends: 35174 [2019-12-18 20:25:43,010 INFO L226 Difference]: Without dead ends: 35174 [2019-12-18 20:25:43,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 20:25:43,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35174 states. [2019-12-18 20:25:43,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35174 to 20135. [2019-12-18 20:25:43,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20135 states. [2019-12-18 20:25:43,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20135 states to 20135 states and 61654 transitions. [2019-12-18 20:25:43,442 INFO L78 Accepts]: Start accepts. Automaton has 20135 states and 61654 transitions. Word has length 27 [2019-12-18 20:25:43,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:25:43,443 INFO L462 AbstractCegarLoop]: Abstraction has 20135 states and 61654 transitions. [2019-12-18 20:25:43,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:25:43,443 INFO L276 IsEmpty]: Start isEmpty. Operand 20135 states and 61654 transitions. [2019-12-18 20:25:43,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 20:25:43,457 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:25:43,457 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-18 20:25:43,457 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-18 20:25:43,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:25:43,458 INFO L82 PathProgramCache]: Analyzing trace with hash 708131532, now seen corresponding path program 1 times [2019-12-18 20:25:43,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:25:43,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865361306] [2019-12-18 20:25:43,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:25:43,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:25:43,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:25:43,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865361306] [2019-12-18 20:25:43,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:25:43,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:25:43,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48132705] [2019-12-18 20:25:43,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:25:43,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:25:43,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:25:43,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:25:43,588 INFO L87 Difference]: Start difference. First operand 20135 states and 61654 transitions. Second operand 6 states. [2019-12-18 20:25:44,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:25:44,440 INFO L93 Difference]: Finished difference Result 39877 states and 118664 transitions. [2019-12-18 20:25:44,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 20:25:44,440 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-18 20:25:44,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:25:44,498 INFO L225 Difference]: With dead ends: 39877 [2019-12-18 20:25:44,498 INFO L226 Difference]: Without dead ends: 39877 [2019-12-18 20:25:44,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 20:25:44,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39877 states. [2019-12-18 20:25:45,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39877 to 20872. [2019-12-18 20:25:45,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20872 states. [2019-12-18 20:25:45,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20872 states to 20872 states and 64353 transitions. [2019-12-18 20:25:45,166 INFO L78 Accepts]: Start accepts. Automaton has 20872 states and 64353 transitions. Word has length 28 [2019-12-18 20:25:45,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:25:45,166 INFO L462 AbstractCegarLoop]: Abstraction has 20872 states and 64353 transitions. [2019-12-18 20:25:45,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:25:45,166 INFO L276 IsEmpty]: Start isEmpty. Operand 20872 states and 64353 transitions. [2019-12-18 20:25:45,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 20:25:45,189 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:25:45,189 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:25:45,190 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-18 20:25:45,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:25:45,190 INFO L82 PathProgramCache]: Analyzing trace with hash 2083615183, now seen corresponding path program 1 times [2019-12-18 20:25:45,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:25:45,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805196454] [2019-12-18 20:25:45,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:25:45,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:25:45,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-18 20:25:45,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805196454] [2019-12-18 20:25:45,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:25:45,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 20:25:45,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569270202] [2019-12-18 20:25:45,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 20:25:45,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:25:45,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 20:25:45,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:25:45,441 INFO L87 Difference]: Start difference. First operand 20872 states and 64353 transitions. Second operand 9 states. [2019-12-18 20:25:47,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:25:47,710 INFO L93 Difference]: Finished difference Result 43741 states and 131754 transitions. [2019-12-18 20:25:47,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 20:25:47,711 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-12-18 20:25:47,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:25:47,775 INFO L225 Difference]: With dead ends: 43741 [2019-12-18 20:25:47,776 INFO L226 Difference]: Without dead ends: 43741 [2019-12-18 20:25:47,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=146, Invalid=406, Unknown=0, NotChecked=0, Total=552 [2019-12-18 20:25:47,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43741 states. [2019-12-18 20:25:48,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43741 to 21659. [2019-12-18 20:25:48,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21659 states. [2019-12-18 20:25:48,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21659 states to 21659 states and 66795 transitions. [2019-12-18 20:25:48,258 INFO L78 Accepts]: Start accepts. Automaton has 21659 states and 66795 transitions. Word has length 33 [2019-12-18 20:25:48,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:25:48,259 INFO L462 AbstractCegarLoop]: Abstraction has 21659 states and 66795 transitions. [2019-12-18 20:25:48,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 20:25:48,259 INFO L276 IsEmpty]: Start isEmpty. Operand 21659 states and 66795 transitions. [2019-12-18 20:25:48,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 20:25:48,284 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:25:48,285 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:25:48,285 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-18 20:25:48,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:25:48,285 INFO L82 PathProgramCache]: Analyzing trace with hash -2131169195, now seen corresponding path program 2 times [2019-12-18 20:25:48,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:25:48,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562470953] [2019-12-18 20:25:48,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:25:48,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:25:48,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:25:48,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562470953] [2019-12-18 20:25:48,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:25:48,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:25:48,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846706546] [2019-12-18 20:25:48,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:25:48,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:25:48,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:25:48,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:25:48,411 INFO L87 Difference]: Start difference. First operand 21659 states and 66795 transitions. Second operand 7 states. [2019-12-18 20:25:50,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:25:50,014 INFO L93 Difference]: Finished difference Result 46321 states and 138703 transitions. [2019-12-18 20:25:50,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 20:25:50,015 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 20:25:50,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:25:50,081 INFO L225 Difference]: With dead ends: 46321 [2019-12-18 20:25:50,082 INFO L226 Difference]: Without dead ends: 46321 [2019-12-18 20:25:50,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2019-12-18 20:25:50,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46321 states. [2019-12-18 20:25:50,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46321 to 23316. [2019-12-18 20:25:50,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23316 states. [2019-12-18 20:25:50,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23316 states to 23316 states and 71843 transitions. [2019-12-18 20:25:50,582 INFO L78 Accepts]: Start accepts. Automaton has 23316 states and 71843 transitions. Word has length 33 [2019-12-18 20:25:50,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:25:50,582 INFO L462 AbstractCegarLoop]: Abstraction has 23316 states and 71843 transitions. [2019-12-18 20:25:50,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:25:50,583 INFO L276 IsEmpty]: Start isEmpty. Operand 23316 states and 71843 transitions. [2019-12-18 20:25:50,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 20:25:50,602 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:25:50,602 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:25:50,602 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-18 20:25:50,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:25:50,603 INFO L82 PathProgramCache]: Analyzing trace with hash 572830043, now seen corresponding path program 3 times [2019-12-18 20:25:50,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:25:50,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605997647] [2019-12-18 20:25:50,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:25:50,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:25:50,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:25:50,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605997647] [2019-12-18 20:25:50,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:25:50,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 20:25:50,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854002624] [2019-12-18 20:25:50,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 20:25:50,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:25:50,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 20:25:50,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:25:50,824 INFO L87 Difference]: Start difference. First operand 23316 states and 71843 transitions. Second operand 9 states. [2019-12-18 20:25:52,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:25:52,982 INFO L93 Difference]: Finished difference Result 53967 states and 160416 transitions. [2019-12-18 20:25:52,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 20:25:52,983 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-12-18 20:25:52,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:25:53,072 INFO L225 Difference]: With dead ends: 53967 [2019-12-18 20:25:53,072 INFO L226 Difference]: Without dead ends: 53967 [2019-12-18 20:25:53,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=183, Invalid=519, Unknown=0, NotChecked=0, Total=702 [2019-12-18 20:25:53,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53967 states. [2019-12-18 20:25:53,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53967 to 23190. [2019-12-18 20:25:53,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23190 states. [2019-12-18 20:25:53,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23190 states to 23190 states and 71389 transitions. [2019-12-18 20:25:53,858 INFO L78 Accepts]: Start accepts. Automaton has 23190 states and 71389 transitions. Word has length 33 [2019-12-18 20:25:53,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:25:53,858 INFO L462 AbstractCegarLoop]: Abstraction has 23190 states and 71389 transitions. [2019-12-18 20:25:53,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 20:25:53,859 INFO L276 IsEmpty]: Start isEmpty. Operand 23190 states and 71389 transitions. [2019-12-18 20:25:53,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 20:25:53,880 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:25:53,880 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-18 20:25:53,880 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-18 20:25:53,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:25:53,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1529567545, now seen corresponding path program 1 times [2019-12-18 20:25:53,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:25:53,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183947790] [2019-12-18 20:25:53,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:25:53,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:25:54,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:25:54,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183947790] [2019-12-18 20:25:54,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:25:54,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:25:54,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348730565] [2019-12-18 20:25:54,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 20:25:54,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:25:54,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 20:25:54,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 20:25:54,052 INFO L87 Difference]: Start difference. First operand 23190 states and 71389 transitions. Second operand 8 states. [2019-12-18 20:25:55,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:25:55,631 INFO L93 Difference]: Finished difference Result 46548 states and 138523 transitions. [2019-12-18 20:25:55,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 20:25:55,632 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-12-18 20:25:55,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:25:55,702 INFO L225 Difference]: With dead ends: 46548 [2019-12-18 20:25:55,702 INFO L226 Difference]: Without dead ends: 46548 [2019-12-18 20:25:55,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2019-12-18 20:25:55,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46548 states. [2019-12-18 20:25:56,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46548 to 21234. [2019-12-18 20:25:56,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21234 states. [2019-12-18 20:25:56,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21234 states to 21234 states and 65630 transitions. [2019-12-18 20:25:56,197 INFO L78 Accepts]: Start accepts. Automaton has 21234 states and 65630 transitions. Word has length 34 [2019-12-18 20:25:56,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:25:56,197 INFO L462 AbstractCegarLoop]: Abstraction has 21234 states and 65630 transitions. [2019-12-18 20:25:56,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 20:25:56,198 INFO L276 IsEmpty]: Start isEmpty. Operand 21234 states and 65630 transitions. [2019-12-18 20:25:56,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 20:25:56,217 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:25:56,218 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-18 20:25:56,218 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-18 20:25:56,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:25:56,218 INFO L82 PathProgramCache]: Analyzing trace with hash 276051641, now seen corresponding path program 2 times [2019-12-18 20:25:56,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:25:56,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467892635] [2019-12-18 20:25:56,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:25:56,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:25:56,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:25:56,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467892635] [2019-12-18 20:25:56,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:25:56,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 20:25:56,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326434392] [2019-12-18 20:25:56,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 20:25:56,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:25:56,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 20:25:56,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-12-18 20:25:56,468 INFO L87 Difference]: Start difference. First operand 21234 states and 65630 transitions. Second operand 11 states. [2019-12-18 20:25:59,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:25:59,309 INFO L93 Difference]: Finished difference Result 53840 states and 161604 transitions. [2019-12-18 20:25:59,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 20:25:59,309 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2019-12-18 20:25:59,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:25:59,404 INFO L225 Difference]: With dead ends: 53840 [2019-12-18 20:25:59,404 INFO L226 Difference]: Without dead ends: 53840 [2019-12-18 20:25:59,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=214, Invalid=656, Unknown=0, NotChecked=0, Total=870 [2019-12-18 20:25:59,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53840 states. [2019-12-18 20:25:59,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53840 to 24680. [2019-12-18 20:25:59,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24680 states. [2019-12-18 20:25:59,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24680 states to 24680 states and 76989 transitions. [2019-12-18 20:25:59,967 INFO L78 Accepts]: Start accepts. Automaton has 24680 states and 76989 transitions. Word has length 34 [2019-12-18 20:25:59,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:25:59,967 INFO L462 AbstractCegarLoop]: Abstraction has 24680 states and 76989 transitions. [2019-12-18 20:25:59,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 20:25:59,967 INFO L276 IsEmpty]: Start isEmpty. Operand 24680 states and 76989 transitions. [2019-12-18 20:26:00,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 20:26:00,002 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:26:00,002 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-18 20:26:00,002 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-18 20:26:00,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:26:00,002 INFO L82 PathProgramCache]: Analyzing trace with hash 358675718, now seen corresponding path program 1 times [2019-12-18 20:26:00,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:26:00,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694867281] [2019-12-18 20:26:00,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:26:00,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:26:00,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:26:00,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694867281] [2019-12-18 20:26:00,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:26:00,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:26:00,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971336404] [2019-12-18 20:26:00,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:26:00,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:26:00,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:26:00,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:26:00,059 INFO L87 Difference]: Start difference. First operand 24680 states and 76989 transitions. Second operand 4 states. [2019-12-18 20:26:00,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:26:00,213 INFO L93 Difference]: Finished difference Result 42112 states and 131863 transitions. [2019-12-18 20:26:00,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:26:00,213 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-18 20:26:00,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:26:00,244 INFO L225 Difference]: With dead ends: 42112 [2019-12-18 20:26:00,244 INFO L226 Difference]: Without dead ends: 21106 [2019-12-18 20:26:00,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:26:00,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21106 states. [2019-12-18 20:26:00,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21106 to 20836. [2019-12-18 20:26:00,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20836 states. [2019-12-18 20:26:00,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20836 states to 20836 states and 64058 transitions. [2019-12-18 20:26:00,558 INFO L78 Accepts]: Start accepts. Automaton has 20836 states and 64058 transitions. Word has length 39 [2019-12-18 20:26:00,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:26:00,558 INFO L462 AbstractCegarLoop]: Abstraction has 20836 states and 64058 transitions. [2019-12-18 20:26:00,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:26:00,558 INFO L276 IsEmpty]: Start isEmpty. Operand 20836 states and 64058 transitions. [2019-12-18 20:26:00,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 20:26:00,577 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:26:00,577 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-18 20:26:00,578 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-18 20:26:00,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:26:00,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1572679302, now seen corresponding path program 2 times [2019-12-18 20:26:00,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:26:00,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251533306] [2019-12-18 20:26:00,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:26:00,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:26:00,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:26:00,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251533306] [2019-12-18 20:26:00,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:26:00,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:26:00,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830303227] [2019-12-18 20:26:00,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:26:00,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:26:00,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:26:00,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:26:00,635 INFO L87 Difference]: Start difference. First operand 20836 states and 64058 transitions. Second operand 3 states. [2019-12-18 20:26:00,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:26:00,882 INFO L93 Difference]: Finished difference Result 20835 states and 64056 transitions. [2019-12-18 20:26:00,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:26:00,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 20:26:00,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:26:00,924 INFO L225 Difference]: With dead ends: 20835 [2019-12-18 20:26:00,924 INFO L226 Difference]: Without dead ends: 20835 [2019-12-18 20:26:00,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:26:01,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20835 states. [2019-12-18 20:26:01,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20835 to 20835. [2019-12-18 20:26:01,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20835 states. [2019-12-18 20:26:01,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20835 states to 20835 states and 64056 transitions. [2019-12-18 20:26:01,238 INFO L78 Accepts]: Start accepts. Automaton has 20835 states and 64056 transitions. Word has length 39 [2019-12-18 20:26:01,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:26:01,239 INFO L462 AbstractCegarLoop]: Abstraction has 20835 states and 64056 transitions. [2019-12-18 20:26:01,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:26:01,239 INFO L276 IsEmpty]: Start isEmpty. Operand 20835 states and 64056 transitions. [2019-12-18 20:26:01,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 20:26:01,259 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:26:01,259 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-18 20:26:01,259 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-18 20:26:01,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:26:01,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1861174117, now seen corresponding path program 1 times [2019-12-18 20:26:01,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:26:01,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781582846] [2019-12-18 20:26:01,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:26:01,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:26:01,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:26:01,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781582846] [2019-12-18 20:26:01,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:26:01,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:26:01,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120868509] [2019-12-18 20:26:01,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:26:01,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:26:01,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:26:01,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:26:01,305 INFO L87 Difference]: Start difference. First operand 20835 states and 64056 transitions. Second operand 4 states. [2019-12-18 20:26:01,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:26:01,420 INFO L93 Difference]: Finished difference Result 33931 states and 103476 transitions. [2019-12-18 20:26:01,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:26:01,420 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-18 20:26:01,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:26:01,443 INFO L225 Difference]: With dead ends: 33931 [2019-12-18 20:26:01,444 INFO L226 Difference]: Without dead ends: 15463 [2019-12-18 20:26:01,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:26:01,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15463 states. [2019-12-18 20:26:01,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15463 to 15274. [2019-12-18 20:26:01,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15274 states. [2019-12-18 20:26:01,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15274 states to 15274 states and 44636 transitions. [2019-12-18 20:26:01,662 INFO L78 Accepts]: Start accepts. Automaton has 15274 states and 44636 transitions. Word has length 40 [2019-12-18 20:26:01,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:26:01,662 INFO L462 AbstractCegarLoop]: Abstraction has 15274 states and 44636 transitions. [2019-12-18 20:26:01,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:26:01,663 INFO L276 IsEmpty]: Start isEmpty. Operand 15274 states and 44636 transitions. [2019-12-18 20:26:01,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 20:26:01,681 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:26:01,681 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-18 20:26:01,681 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-18 20:26:01,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:26:01,681 INFO L82 PathProgramCache]: Analyzing trace with hash 437381093, now seen corresponding path program 2 times [2019-12-18 20:26:01,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:26:01,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554087594] [2019-12-18 20:26:01,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:26:01,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:26:01,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:26:01,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554087594] [2019-12-18 20:26:01,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:26:01,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:26:01,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487570833] [2019-12-18 20:26:01,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:26:01,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:26:01,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:26:01,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:26:01,756 INFO L87 Difference]: Start difference. First operand 15274 states and 44636 transitions. Second operand 3 states. [2019-12-18 20:26:01,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:26:01,821 INFO L93 Difference]: Finished difference Result 15192 states and 44375 transitions. [2019-12-18 20:26:01,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:26:01,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-18 20:26:01,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:26:01,848 INFO L225 Difference]: With dead ends: 15192 [2019-12-18 20:26:01,848 INFO L226 Difference]: Without dead ends: 15192 [2019-12-18 20:26:01,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:26:01,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15192 states. [2019-12-18 20:26:02,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15192 to 13014. [2019-12-18 20:26:02,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13014 states. [2019-12-18 20:26:02,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13014 states to 13014 states and 38779 transitions. [2019-12-18 20:26:02,087 INFO L78 Accepts]: Start accepts. Automaton has 13014 states and 38779 transitions. Word has length 40 [2019-12-18 20:26:02,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:26:02,088 INFO L462 AbstractCegarLoop]: Abstraction has 13014 states and 38779 transitions. [2019-12-18 20:26:02,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:26:02,088 INFO L276 IsEmpty]: Start isEmpty. Operand 13014 states and 38779 transitions. [2019-12-18 20:26:02,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 20:26:02,100 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:26:02,101 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:26:02,101 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-18 20:26:02,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:26:02,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1353733925, now seen corresponding path program 1 times [2019-12-18 20:26:02,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:26:02,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656688774] [2019-12-18 20:26:02,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:26:02,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:26:02,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:26:02,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656688774] [2019-12-18 20:26:02,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:26:02,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:26:02,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837063172] [2019-12-18 20:26:02,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:26:02,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:26:02,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:26:02,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:26:02,143 INFO L87 Difference]: Start difference. First operand 13014 states and 38779 transitions. Second operand 5 states. [2019-12-18 20:26:02,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:26:02,203 INFO L93 Difference]: Finished difference Result 11990 states and 36498 transitions. [2019-12-18 20:26:02,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:26:02,204 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-18 20:26:02,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:26:02,219 INFO L225 Difference]: With dead ends: 11990 [2019-12-18 20:26:02,219 INFO L226 Difference]: Without dead ends: 8996 [2019-12-18 20:26:02,219 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-18 20:26:02,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8996 states. [2019-12-18 20:26:02,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8996 to 8996. [2019-12-18 20:26:02,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8996 states. [2019-12-18 20:26:02,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8996 states to 8996 states and 29303 transitions. [2019-12-18 20:26:02,366 INFO L78 Accepts]: Start accepts. Automaton has 8996 states and 29303 transitions. Word has length 41 [2019-12-18 20:26:02,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:26:02,366 INFO L462 AbstractCegarLoop]: Abstraction has 8996 states and 29303 transitions. [2019-12-18 20:26:02,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:26:02,366 INFO L276 IsEmpty]: Start isEmpty. Operand 8996 states and 29303 transitions. [2019-12-18 20:26:02,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 20:26:02,377 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:26:02,377 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-18 20:26:02,377 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-18 20:26:02,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:26:02,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1529197946, now seen corresponding path program 1 times [2019-12-18 20:26:02,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:26:02,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295610504] [2019-12-18 20:26:02,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:26:02,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:26:02,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:26:02,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295610504] [2019-12-18 20:26:02,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:26:02,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:26:02,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564793766] [2019-12-18 20:26:02,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:26:02,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:26:02,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:26:02,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:26:02,443 INFO L87 Difference]: Start difference. First operand 8996 states and 29303 transitions. Second operand 7 states. [2019-12-18 20:26:02,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:26:02,801 INFO L93 Difference]: Finished difference Result 18072 states and 57778 transitions. [2019-12-18 20:26:02,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 20:26:02,802 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 20:26:02,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:26:02,837 INFO L225 Difference]: With dead ends: 18072 [2019-12-18 20:26:02,837 INFO L226 Difference]: Without dead ends: 13089 [2019-12-18 20:26:02,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 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-18 20:26:02,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13089 states. [2019-12-18 20:26:03,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13089 to 10681. [2019-12-18 20:26:03,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10681 states. [2019-12-18 20:26:03,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10681 states to 10681 states and 34704 transitions. [2019-12-18 20:26:03,316 INFO L78 Accepts]: Start accepts. Automaton has 10681 states and 34704 transitions. Word has length 65 [2019-12-18 20:26:03,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:26:03,317 INFO L462 AbstractCegarLoop]: Abstraction has 10681 states and 34704 transitions. [2019-12-18 20:26:03,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:26:03,317 INFO L276 IsEmpty]: Start isEmpty. Operand 10681 states and 34704 transitions. [2019-12-18 20:26:03,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 20:26:03,335 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:26:03,336 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-18 20:26:03,336 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-18 20:26:03,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:26:03,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1412718426, now seen corresponding path program 2 times [2019-12-18 20:26:03,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:26:03,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594651868] [2019-12-18 20:26:03,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:26:03,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:26:03,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:26:03,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594651868] [2019-12-18 20:26:03,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:26:03,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:26:03,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336026249] [2019-12-18 20:26:03,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:26:03,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:26:03,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:26:03,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:26:03,407 INFO L87 Difference]: Start difference. First operand 10681 states and 34704 transitions. Second operand 7 states. [2019-12-18 20:26:03,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:26:03,661 INFO L93 Difference]: Finished difference Result 20910 states and 66495 transitions. [2019-12-18 20:26:03,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 20:26:03,661 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 20:26:03,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:26:03,684 INFO L225 Difference]: With dead ends: 20910 [2019-12-18 20:26:03,685 INFO L226 Difference]: Without dead ends: 15246 [2019-12-18 20:26:03,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 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-18 20:26:03,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15246 states. [2019-12-18 20:26:03,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15246 to 12537. [2019-12-18 20:26:03,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12537 states. [2019-12-18 20:26:03,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12537 states to 12537 states and 40504 transitions. [2019-12-18 20:26:03,909 INFO L78 Accepts]: Start accepts. Automaton has 12537 states and 40504 transitions. Word has length 65 [2019-12-18 20:26:03,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:26:03,910 INFO L462 AbstractCegarLoop]: Abstraction has 12537 states and 40504 transitions. [2019-12-18 20:26:03,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:26:03,910 INFO L276 IsEmpty]: Start isEmpty. Operand 12537 states and 40504 transitions. [2019-12-18 20:26:03,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 20:26:03,925 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:26:03,925 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-18 20:26:03,925 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-18 20:26:03,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:26:03,926 INFO L82 PathProgramCache]: Analyzing trace with hash 33307276, now seen corresponding path program 3 times [2019-12-18 20:26:03,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:26:03,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19002389] [2019-12-18 20:26:03,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:26:03,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:26:04,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:26:04,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19002389] [2019-12-18 20:26:04,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:26:04,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:26:04,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793636948] [2019-12-18 20:26:04,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 20:26:04,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:26:04,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 20:26:04,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:26:04,041 INFO L87 Difference]: Start difference. First operand 12537 states and 40504 transitions. Second operand 9 states. [2019-12-18 20:26:05,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:26:05,102 INFO L93 Difference]: Finished difference Result 44503 states and 138809 transitions. [2019-12-18 20:26:05,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 20:26:05,103 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 20:26:05,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:26:05,157 INFO L225 Difference]: With dead ends: 44503 [2019-12-18 20:26:05,157 INFO L226 Difference]: Without dead ends: 39432 [2019-12-18 20:26:05,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=222, Invalid=590, Unknown=0, NotChecked=0, Total=812 [2019-12-18 20:26:05,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39432 states. [2019-12-18 20:26:05,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39432 to 12873. [2019-12-18 20:26:05,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12873 states. [2019-12-18 20:26:05,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12873 states to 12873 states and 41729 transitions. [2019-12-18 20:26:05,539 INFO L78 Accepts]: Start accepts. Automaton has 12873 states and 41729 transitions. Word has length 65 [2019-12-18 20:26:05,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:26:05,539 INFO L462 AbstractCegarLoop]: Abstraction has 12873 states and 41729 transitions. [2019-12-18 20:26:05,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 20:26:05,540 INFO L276 IsEmpty]: Start isEmpty. Operand 12873 states and 41729 transitions. [2019-12-18 20:26:05,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 20:26:05,554 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:26:05,555 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-18 20:26:05,555 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-18 20:26:05,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:26:05,555 INFO L82 PathProgramCache]: Analyzing trace with hash -473487095, now seen corresponding path program 1 times [2019-12-18 20:26:05,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:26:05,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449149470] [2019-12-18 20:26:05,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:26:05,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:26:05,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:26:05,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449149470] [2019-12-18 20:26:05,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:26:05,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:26:05,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182002401] [2019-12-18 20:26:05,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:26:05,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:26:05,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:26:05,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:26:05,599 INFO L87 Difference]: Start difference. First operand 12873 states and 41729 transitions. Second operand 3 states. [2019-12-18 20:26:05,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:26:05,676 INFO L93 Difference]: Finished difference Result 13640 states and 42859 transitions. [2019-12-18 20:26:05,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:26:05,676 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 20:26:05,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:26:05,694 INFO L225 Difference]: With dead ends: 13640 [2019-12-18 20:26:05,695 INFO L226 Difference]: Without dead ends: 13361 [2019-12-18 20:26:05,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:26:05,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13361 states. [2019-12-18 20:26:05,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13361 to 10610. [2019-12-18 20:26:05,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10610 states. [2019-12-18 20:26:05,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10610 states to 10610 states and 33914 transitions. [2019-12-18 20:26:05,879 INFO L78 Accepts]: Start accepts. Automaton has 10610 states and 33914 transitions. Word has length 65 [2019-12-18 20:26:05,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:26:05,879 INFO L462 AbstractCegarLoop]: Abstraction has 10610 states and 33914 transitions. [2019-12-18 20:26:05,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:26:05,880 INFO L276 IsEmpty]: Start isEmpty. Operand 10610 states and 33914 transitions. [2019-12-18 20:26:05,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 20:26:05,892 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:26:05,892 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-18 20:26:05,892 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-18 20:26:05,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:26:05,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1174139712, now seen corresponding path program 4 times [2019-12-18 20:26:05,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:26:05,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621319259] [2019-12-18 20:26:05,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:26:05,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:26:06,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:26:06,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621319259] [2019-12-18 20:26:06,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:26:06,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:26:06,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076355193] [2019-12-18 20:26:06,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 20:26:06,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:26:06,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 20:26:06,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:26:06,005 INFO L87 Difference]: Start difference. First operand 10610 states and 33914 transitions. Second operand 9 states. [2019-12-18 20:26:06,601 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-12-18 20:26:07,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:26:07,222 INFO L93 Difference]: Finished difference Result 24145 states and 75680 transitions. [2019-12-18 20:26:07,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 20:26:07,223 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 20:26:07,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:26:07,256 INFO L225 Difference]: With dead ends: 24145 [2019-12-18 20:26:07,256 INFO L226 Difference]: Without dead ends: 22392 [2019-12-18 20:26:07,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-12-18 20:26:07,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22392 states. [2019-12-18 20:26:07,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22392 to 10490. [2019-12-18 20:26:07,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10490 states. [2019-12-18 20:26:07,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10490 states to 10490 states and 33558 transitions. [2019-12-18 20:26:07,515 INFO L78 Accepts]: Start accepts. Automaton has 10490 states and 33558 transitions. Word has length 65 [2019-12-18 20:26:07,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:26:07,515 INFO L462 AbstractCegarLoop]: Abstraction has 10490 states and 33558 transitions. [2019-12-18 20:26:07,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 20:26:07,515 INFO L276 IsEmpty]: Start isEmpty. Operand 10490 states and 33558 transitions. [2019-12-18 20:26:07,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 20:26:07,528 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:26:07,528 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-18 20:26:07,528 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-18 20:26:07,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:26:07,528 INFO L82 PathProgramCache]: Analyzing trace with hash -2002921922, now seen corresponding path program 5 times [2019-12-18 20:26:07,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:26:07,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022407153] [2019-12-18 20:26:07,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:26:07,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:26:07,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:26:07,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022407153] [2019-12-18 20:26:07,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:26:07,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:26:07,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876665587] [2019-12-18 20:26:07,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:26:07,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:26:07,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:26:07,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:26:07,588 INFO L87 Difference]: Start difference. First operand 10490 states and 33558 transitions. Second operand 3 states. [2019-12-18 20:26:07,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:26:07,690 INFO L93 Difference]: Finished difference Result 12063 states and 38420 transitions. [2019-12-18 20:26:07,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:26:07,691 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 20:26:07,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:26:07,714 INFO L225 Difference]: With dead ends: 12063 [2019-12-18 20:26:07,714 INFO L226 Difference]: Without dead ends: 12063 [2019-12-18 20:26:07,714 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-18 20:26:07,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12063 states. [2019-12-18 20:26:07,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12063 to 10919. [2019-12-18 20:26:07,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10919 states. [2019-12-18 20:26:07,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10919 states to 10919 states and 34988 transitions. [2019-12-18 20:26:07,916 INFO L78 Accepts]: Start accepts. Automaton has 10919 states and 34988 transitions. Word has length 65 [2019-12-18 20:26:07,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:26:07,916 INFO L462 AbstractCegarLoop]: Abstraction has 10919 states and 34988 transitions. [2019-12-18 20:26:07,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:26:07,916 INFO L276 IsEmpty]: Start isEmpty. Operand 10919 states and 34988 transitions. [2019-12-18 20:26:07,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 20:26:07,929 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:26:07,930 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-18 20:26:07,930 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-18 20:26:07,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:26:07,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1068268020, now seen corresponding path program 1 times [2019-12-18 20:26:07,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:26:07,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228745858] [2019-12-18 20:26:07,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:26:07,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:26:07,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:26:07,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228745858] [2019-12-18 20:26:07,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:26:07,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:26:07,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592010423] [2019-12-18 20:26:07,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:26:07,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:26:07,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:26:07,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:26:07,983 INFO L87 Difference]: Start difference. First operand 10919 states and 34988 transitions. Second operand 3 states. [2019-12-18 20:26:08,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:26:08,186 INFO L93 Difference]: Finished difference Result 16471 states and 52781 transitions. [2019-12-18 20:26:08,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:26:08,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 20:26:08,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:26:08,213 INFO L225 Difference]: With dead ends: 16471 [2019-12-18 20:26:08,213 INFO L226 Difference]: Without dead ends: 16471 [2019-12-18 20:26:08,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:26:08,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16471 states. [2019-12-18 20:26:08,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16471 to 11449. [2019-12-18 20:26:08,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11449 states. [2019-12-18 20:26:08,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11449 states to 11449 states and 36650 transitions. [2019-12-18 20:26:08,439 INFO L78 Accepts]: Start accepts. Automaton has 11449 states and 36650 transitions. Word has length 66 [2019-12-18 20:26:08,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:26:08,439 INFO L462 AbstractCegarLoop]: Abstraction has 11449 states and 36650 transitions. [2019-12-18 20:26:08,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:26:08,440 INFO L276 IsEmpty]: Start isEmpty. Operand 11449 states and 36650 transitions. [2019-12-18 20:26:08,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 20:26:08,453 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:26:08,453 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-18 20:26:08,453 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-18 20:26:08,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:26:08,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1537924046, now seen corresponding path program 2 times [2019-12-18 20:26:08,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:26:08,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248866450] [2019-12-18 20:26:08,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:26:08,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:26:08,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:26:08,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248866450] [2019-12-18 20:26:08,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:26:08,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:26:08,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695232787] [2019-12-18 20:26:08,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 20:26:08,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:26:08,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 20:26:08,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:26:08,571 INFO L87 Difference]: Start difference. First operand 11449 states and 36650 transitions. Second operand 9 states. [2019-12-18 20:26:09,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:26:09,526 INFO L93 Difference]: Finished difference Result 27744 states and 86262 transitions. [2019-12-18 20:26:09,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 20:26:09,527 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-18 20:26:09,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:26:09,571 INFO L225 Difference]: With dead ends: 27744 [2019-12-18 20:26:09,572 INFO L226 Difference]: Without dead ends: 23179 [2019-12-18 20:26:09,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2019-12-18 20:26:09,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23179 states. [2019-12-18 20:26:09,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23179 to 11314. [2019-12-18 20:26:09,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11314 states. [2019-12-18 20:26:09,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11314 states to 11314 states and 35824 transitions. [2019-12-18 20:26:09,849 INFO L78 Accepts]: Start accepts. Automaton has 11314 states and 35824 transitions. Word has length 66 [2019-12-18 20:26:09,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:26:09,849 INFO L462 AbstractCegarLoop]: Abstraction has 11314 states and 35824 transitions. [2019-12-18 20:26:09,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 20:26:09,849 INFO L276 IsEmpty]: Start isEmpty. Operand 11314 states and 35824 transitions. [2019-12-18 20:26:09,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 20:26:09,862 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:26:09,862 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-18 20:26:09,862 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-18 20:26:09,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:26:09,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1285891802, now seen corresponding path program 3 times [2019-12-18 20:26:09,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:26:09,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475685022] [2019-12-18 20:26:09,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:26:09,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:26:09,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:26:09,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475685022] [2019-12-18 20:26:09,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:26:09,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:26:09,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724244665] [2019-12-18 20:26:09,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 20:26:09,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:26:09,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 20:26:09,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:26:09,976 INFO L87 Difference]: Start difference. First operand 11314 states and 35824 transitions. Second operand 9 states. [2019-12-18 20:26:11,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:26:11,094 INFO L93 Difference]: Finished difference Result 22354 states and 68873 transitions. [2019-12-18 20:26:11,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 20:26:11,094 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-18 20:26:11,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:26:11,132 INFO L225 Difference]: With dead ends: 22354 [2019-12-18 20:26:11,132 INFO L226 Difference]: Without dead ends: 20300 [2019-12-18 20:26:11,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2019-12-18 20:26:11,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20300 states. [2019-12-18 20:26:11,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20300 to 10914. [2019-12-18 20:26:11,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10914 states. [2019-12-18 20:26:11,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10914 states to 10914 states and 34616 transitions. [2019-12-18 20:26:11,599 INFO L78 Accepts]: Start accepts. Automaton has 10914 states and 34616 transitions. Word has length 66 [2019-12-18 20:26:11,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:26:11,599 INFO L462 AbstractCegarLoop]: Abstraction has 10914 states and 34616 transitions. [2019-12-18 20:26:11,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 20:26:11,600 INFO L276 IsEmpty]: Start isEmpty. Operand 10914 states and 34616 transitions. [2019-12-18 20:26:11,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 20:26:11,618 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:26:11,619 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-18 20:26:11,619 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-18 20:26:11,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:26:11,619 INFO L82 PathProgramCache]: Analyzing trace with hash 159393856, now seen corresponding path program 4 times [2019-12-18 20:26:11,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:26:11,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726478163] [2019-12-18 20:26:11,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:26:11,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:26:11,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:26:11,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726478163] [2019-12-18 20:26:11,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:26:11,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:26:11,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040875818] [2019-12-18 20:26:11,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:26:11,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:26:11,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:26:11,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:26:11,679 INFO L87 Difference]: Start difference. First operand 10914 states and 34616 transitions. Second operand 4 states. [2019-12-18 20:26:11,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:26:11,780 INFO L93 Difference]: Finished difference Result 10771 states and 34044 transitions. [2019-12-18 20:26:11,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:26:11,781 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-18 20:26:11,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:26:11,797 INFO L225 Difference]: With dead ends: 10771 [2019-12-18 20:26:11,797 INFO L226 Difference]: Without dead ends: 10771 [2019-12-18 20:26:11,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:26:11,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10771 states. [2019-12-18 20:26:11,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10771 to 9832. [2019-12-18 20:26:11,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9832 states. [2019-12-18 20:26:11,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9832 states to 9832 states and 31011 transitions. [2019-12-18 20:26:11,968 INFO L78 Accepts]: Start accepts. Automaton has 9832 states and 31011 transitions. Word has length 66 [2019-12-18 20:26:11,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:26:11,968 INFO L462 AbstractCegarLoop]: Abstraction has 9832 states and 31011 transitions. [2019-12-18 20:26:11,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:26:11,968 INFO L276 IsEmpty]: Start isEmpty. Operand 9832 states and 31011 transitions. [2019-12-18 20:26:11,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 20:26:11,979 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:26:11,979 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-18 20:26:11,979 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-18 20:26:11,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:26:11,979 INFO L82 PathProgramCache]: Analyzing trace with hash 673864792, now seen corresponding path program 1 times [2019-12-18 20:26:11,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:26:11,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079080345] [2019-12-18 20:26:11,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:26:11,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:26:12,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:26:12,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079080345] [2019-12-18 20:26:12,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:26:12,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:26:12,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125254479] [2019-12-18 20:26:12,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:26:12,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:26:12,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:26:12,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:26:12,050 INFO L87 Difference]: Start difference. First operand 9832 states and 31011 transitions. Second operand 3 states. [2019-12-18 20:26:12,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:26:12,088 INFO L93 Difference]: Finished difference Result 8260 states and 25450 transitions. [2019-12-18 20:26:12,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:26:12,089 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 20:26:12,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:26:12,102 INFO L225 Difference]: With dead ends: 8260 [2019-12-18 20:26:12,103 INFO L226 Difference]: Without dead ends: 8260 [2019-12-18 20:26:12,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:26:12,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8260 states. [2019-12-18 20:26:12,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8260 to 8260. [2019-12-18 20:26:12,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8260 states. [2019-12-18 20:26:12,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8260 states to 8260 states and 25450 transitions. [2019-12-18 20:26:12,372 INFO L78 Accepts]: Start accepts. Automaton has 8260 states and 25450 transitions. Word has length 66 [2019-12-18 20:26:12,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:26:12,372 INFO L462 AbstractCegarLoop]: Abstraction has 8260 states and 25450 transitions. [2019-12-18 20:26:12,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:26:12,373 INFO L276 IsEmpty]: Start isEmpty. Operand 8260 states and 25450 transitions. [2019-12-18 20:26:12,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 20:26:12,390 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:26:12,390 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:26:12,390 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-18 20:26:12,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:26:12,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1633407744, now seen corresponding path program 1 times [2019-12-18 20:26:12,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:26:12,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663836784] [2019-12-18 20:26:12,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:26:12,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:26:12,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:26:12,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663836784] [2019-12-18 20:26:12,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:26:12,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:26:12,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068710344] [2019-12-18 20:26:12,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 20:26:12,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:26:12,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 20:26:12,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 20:26:12,610 INFO L87 Difference]: Start difference. First operand 8260 states and 25450 transitions. Second operand 10 states. [2019-12-18 20:26:13,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:26:13,281 INFO L93 Difference]: Finished difference Result 14721 states and 45016 transitions. [2019-12-18 20:26:13,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 20:26:13,281 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 20:26:13,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:26:13,301 INFO L225 Difference]: With dead ends: 14721 [2019-12-18 20:26:13,302 INFO L226 Difference]: Without dead ends: 13702 [2019-12-18 20:26:13,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=442, Unknown=0, NotChecked=0, Total=552 [2019-12-18 20:26:13,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13702 states. [2019-12-18 20:26:13,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13702 to 11156. [2019-12-18 20:26:13,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11156 states. [2019-12-18 20:26:13,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11156 states to 11156 states and 34560 transitions. [2019-12-18 20:26:13,508 INFO L78 Accepts]: Start accepts. Automaton has 11156 states and 34560 transitions. Word has length 67 [2019-12-18 20:26:13,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:26:13,508 INFO L462 AbstractCegarLoop]: Abstraction has 11156 states and 34560 transitions. [2019-12-18 20:26:13,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 20:26:13,509 INFO L276 IsEmpty]: Start isEmpty. Operand 11156 states and 34560 transitions. [2019-12-18 20:26:13,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 20:26:13,521 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:26:13,521 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:26:13,522 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:26:13,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:26:13,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1333052502, now seen corresponding path program 2 times [2019-12-18 20:26:13,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:26:13,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825543154] [2019-12-18 20:26:13,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:26:13,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:26:14,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-18 20:26:14,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825543154] [2019-12-18 20:26:14,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:26:14,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 20:26:14,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978709521] [2019-12-18 20:26:14,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 20:26:14,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:26:14,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 20:26:14,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-12-18 20:26:14,026 INFO L87 Difference]: Start difference. First operand 11156 states and 34560 transitions. Second operand 17 states. [2019-12-18 20:26:16,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:26:16,985 INFO L93 Difference]: Finished difference Result 13019 states and 39576 transitions. [2019-12-18 20:26:16,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-18 20:26:16,986 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-12-18 20:26:16,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:26:17,005 INFO L225 Difference]: With dead ends: 13019 [2019-12-18 20:26:17,006 INFO L226 Difference]: Without dead ends: 12800 [2019-12-18 20:26:17,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=231, Invalid=1491, Unknown=0, NotChecked=0, Total=1722 [2019-12-18 20:26:17,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12800 states. [2019-12-18 20:26:17,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12800 to 10756. [2019-12-18 20:26:17,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10756 states. [2019-12-18 20:26:17,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10756 states to 10756 states and 32949 transitions. [2019-12-18 20:26:17,181 INFO L78 Accepts]: Start accepts. Automaton has 10756 states and 32949 transitions. Word has length 67 [2019-12-18 20:26:17,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:26:17,181 INFO L462 AbstractCegarLoop]: Abstraction has 10756 states and 32949 transitions. [2019-12-18 20:26:17,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 20:26:17,182 INFO L276 IsEmpty]: Start isEmpty. Operand 10756 states and 32949 transitions. [2019-12-18 20:26:17,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 20:26:17,193 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:26:17,193 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:26:17,193 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:26:17,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:26:17,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1684310332, now seen corresponding path program 3 times [2019-12-18 20:26:17,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:26:17,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977615853] [2019-12-18 20:26:17,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:26:17,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:26:17,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:26:17,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977615853] [2019-12-18 20:26:17,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:26:17,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:26:17,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661622846] [2019-12-18 20:26:17,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 20:26:17,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:26:17,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 20:26:17,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 20:26:17,404 INFO L87 Difference]: Start difference. First operand 10756 states and 32949 transitions. Second operand 10 states. [2019-12-18 20:26:17,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:26:17,987 INFO L93 Difference]: Finished difference Result 13684 states and 41017 transitions. [2019-12-18 20:26:17,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 20:26:17,987 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 20:26:17,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:26:18,006 INFO L225 Difference]: With dead ends: 13684 [2019-12-18 20:26:18,006 INFO L226 Difference]: Without dead ends: 10185 [2019-12-18 20:26:18,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-18 20:26:18,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10185 states. [2019-12-18 20:26:18,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10185 to 7772. [2019-12-18 20:26:18,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7772 states. [2019-12-18 20:26:18,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7772 states to 7772 states and 23344 transitions. [2019-12-18 20:26:18,163 INFO L78 Accepts]: Start accepts. Automaton has 7772 states and 23344 transitions. Word has length 67 [2019-12-18 20:26:18,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:26:18,164 INFO L462 AbstractCegarLoop]: Abstraction has 7772 states and 23344 transitions. [2019-12-18 20:26:18,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 20:26:18,164 INFO L276 IsEmpty]: Start isEmpty. Operand 7772 states and 23344 transitions. [2019-12-18 20:26:18,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 20:26:18,172 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:26:18,172 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:26:18,172 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:26:18,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:26:18,172 INFO L82 PathProgramCache]: Analyzing trace with hash 755721406, now seen corresponding path program 4 times [2019-12-18 20:26:18,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:26:18,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576596521] [2019-12-18 20:26:18,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:26:18,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:26:18,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:26:18,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576596521] [2019-12-18 20:26:18,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:26:18,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 20:26:18,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516089299] [2019-12-18 20:26:18,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 20:26:18,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:26:18,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 20:26:18,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 20:26:18,367 INFO L87 Difference]: Start difference. First operand 7772 states and 23344 transitions. Second operand 11 states. [2019-12-18 20:26:19,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:26:19,059 INFO L93 Difference]: Finished difference Result 12689 states and 37975 transitions. [2019-12-18 20:26:19,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 20:26:19,059 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 20:26:19,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:26:19,075 INFO L225 Difference]: With dead ends: 12689 [2019-12-18 20:26:19,075 INFO L226 Difference]: Without dead ends: 11670 [2019-12-18 20:26:19,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=572, Unknown=0, NotChecked=0, Total=702 [2019-12-18 20:26:19,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11670 states. [2019-12-18 20:26:19,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11670 to 9956. [2019-12-18 20:26:19,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9956 states. [2019-12-18 20:26:19,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9956 states to 9956 states and 30103 transitions. [2019-12-18 20:26:19,239 INFO L78 Accepts]: Start accepts. Automaton has 9956 states and 30103 transitions. Word has length 67 [2019-12-18 20:26:19,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:26:19,240 INFO L462 AbstractCegarLoop]: Abstraction has 9956 states and 30103 transitions. [2019-12-18 20:26:19,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 20:26:19,240 INFO L276 IsEmpty]: Start isEmpty. Operand 9956 states and 30103 transitions. [2019-12-18 20:26:19,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 20:26:19,250 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:26:19,250 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:26:19,250 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:26:19,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:26:19,251 INFO L82 PathProgramCache]: Analyzing trace with hash 2084228456, now seen corresponding path program 5 times [2019-12-18 20:26:19,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:26:19,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149241312] [2019-12-18 20:26:19,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:26:19,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:26:19,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:26:19,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149241312] [2019-12-18 20:26:19,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:26:19,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 20:26:19,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109141873] [2019-12-18 20:26:19,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 20:26:19,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:26:19,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 20:26:19,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 20:26:19,440 INFO L87 Difference]: Start difference. First operand 9956 states and 30103 transitions. Second operand 11 states. [2019-12-18 20:26:20,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:26:20,147 INFO L93 Difference]: Finished difference Result 12228 states and 36173 transitions. [2019-12-18 20:26:20,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 20:26:20,147 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 20:26:20,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:26:20,161 INFO L225 Difference]: With dead ends: 12228 [2019-12-18 20:26:20,162 INFO L226 Difference]: Without dead ends: 9593 [2019-12-18 20:26:20,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2019-12-18 20:26:20,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9593 states. [2019-12-18 20:26:20,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9593 to 7676. [2019-12-18 20:26:20,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7676 states. [2019-12-18 20:26:20,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7676 states to 7676 states and 22916 transitions. [2019-12-18 20:26:20,291 INFO L78 Accepts]: Start accepts. Automaton has 7676 states and 22916 transitions. Word has length 67 [2019-12-18 20:26:20,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:26:20,291 INFO L462 AbstractCegarLoop]: Abstraction has 7676 states and 22916 transitions. [2019-12-18 20:26:20,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 20:26:20,292 INFO L276 IsEmpty]: Start isEmpty. Operand 7676 states and 22916 transitions. [2019-12-18 20:26:20,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 20:26:20,300 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:26:20,301 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:26:20,301 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:26:20,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:26:20,301 INFO L82 PathProgramCache]: Analyzing trace with hash 797762192, now seen corresponding path program 6 times [2019-12-18 20:26:20,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:26:20,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060516826] [2019-12-18 20:26:20,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:26:20,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:26:20,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:26:20,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060516826] [2019-12-18 20:26:20,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:26:20,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 20:26:20,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157493374] [2019-12-18 20:26:20,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 20:26:20,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:26:20,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 20:26:20,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 20:26:20,463 INFO L87 Difference]: Start difference. First operand 7676 states and 22916 transitions. Second operand 12 states. [2019-12-18 20:26:21,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:26:21,284 INFO L93 Difference]: Finished difference Result 9956 states and 29001 transitions. [2019-12-18 20:26:21,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 20:26:21,285 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-18 20:26:21,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:26:21,299 INFO L225 Difference]: With dead ends: 9956 [2019-12-18 20:26:21,300 INFO L226 Difference]: Without dead ends: 9529 [2019-12-18 20:26:21,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-18 20:26:21,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9529 states. [2019-12-18 20:26:21,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9529 to 7356. [2019-12-18 20:26:21,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7356 states. [2019-12-18 20:26:21,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7356 states to 7356 states and 22044 transitions. [2019-12-18 20:26:21,428 INFO L78 Accepts]: Start accepts. Automaton has 7356 states and 22044 transitions. Word has length 67 [2019-12-18 20:26:21,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:26:21,428 INFO L462 AbstractCegarLoop]: Abstraction has 7356 states and 22044 transitions. [2019-12-18 20:26:21,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 20:26:21,429 INFO L276 IsEmpty]: Start isEmpty. Operand 7356 states and 22044 transitions. [2019-12-18 20:26:21,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 20:26:21,436 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:26:21,436 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:26:21,436 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:26:21,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:26:21,436 INFO L82 PathProgramCache]: Analyzing trace with hash 139331638, now seen corresponding path program 7 times [2019-12-18 20:26:21,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:26:21,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578989158] [2019-12-18 20:26:21,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:26:21,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:26:21,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:26:21,610 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 20:26:21,610 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 20:26:21,614 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] ULTIMATE.startENTRY-->L837: Formula: (let ((.cse0 (store |v_#valid_60| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= v_~x~0_11 0) (= 0 v_~weak$$choice0~0_8) (= v_~main$tmp_guard1~0_16 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t385~0.base_25|) (= 0 v_~a$w_buff1_used~0_71) (= 0 v_~__unbuffered_p0_EAX~0_15) (= 0 v_~__unbuffered_cnt~0_20) (= |v_#NULL.offset_6| 0) (= 0 v_~__unbuffered_p1_EAX~0_12) (= |v_#valid_58| (store .cse0 |v_ULTIMATE.start_main_~#t385~0.base_25| 1)) (= 0 |v_ULTIMATE.start_main_~#t385~0.offset_20|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t385~0.base_25| 4)) (= 0 v_~a$w_buff1~0_21) (< 0 |v_#StackHeapBarrier_17|) (= v_~a$r_buff0_thd3~0_77 0) (= 0 v_~weak$$choice2~0_34) (= 0 v_~a$w_buff0~0_23) (= v_~a$flush_delayed~0_13 0) (= 0 |v_#NULL.base_6|) (= v_~__unbuffered_p2_EBX~0_13 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t385~0.base_25| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t385~0.base_25|) |v_ULTIMATE.start_main_~#t385~0.offset_20| 0)) |v_#memory_int_21|) (= v_~a$mem_tmp~0_10 0) (= 0 v_~a$r_buff1_thd1~0_21) (= v_~a$r_buff0_thd1~0_29 0) (= 0 v_~__unbuffered_p2_EAX~0_12) (= v_~a$r_buff0_thd2~0_21 0) (= 0 v_~a$r_buff1_thd0~0_22) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t385~0.base_25|)) (= 0 v_~a$r_buff1_thd2~0_17) (= 0 v_~z~0_8) (= v_~y~0_11 0) (= 0 v_~a$read_delayed~0_6) (= 0 v_~a$r_buff1_thd3~0_50) (= v_~a$read_delayed_var~0.offset_6 0) (= 0 v_~a$read_delayed_var~0.base_6) (= 0 v_~a$w_buff0_used~0_108) (= v_~a~0_27 0) (= v_~a$r_buff0_thd0~0_21 0) (= v_~__unbuffered_p0_EBX~0_15 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_13|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_11|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_21, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_11|, ~a~0=v_~a~0_27, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_19|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_15, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_12, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_12, ULTIMATE.start_main_~#t386~0.base=|v_ULTIMATE.start_main_~#t386~0.base_25|, ULTIMATE.start_main_~#t387~0.offset=|v_ULTIMATE.start_main_~#t387~0.offset_15|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_13, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_15, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_50, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_108, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_29, ULTIMATE.start_main_~#t386~0.offset=|v_ULTIMATE.start_main_~#t386~0.offset_20|, ULTIMATE.start_main_~#t385~0.offset=|v_ULTIMATE.start_main_~#t385~0.offset_20|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t385~0.base=|v_ULTIMATE.start_main_~#t385~0.base_25|, ~a$w_buff0~0=v_~a$w_buff0~0_23, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_22, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x~0=v_~x~0_11, ~a$read_delayed~0=v_~a$read_delayed~0_6, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_21, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_13|, ~a$mem_tmp~0=v_~a$mem_tmp~0_10, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_11|, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~y~0=v_~y~0_11, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_21, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_77, ULTIMATE.start_main_~#t387~0.base=|v_ULTIMATE.start_main_~#t387~0.base_17|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_6|, ~a$flush_delayed~0=v_~a$flush_delayed~0_13, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_8, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_71, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_6} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t386~0.base, ULTIMATE.start_main_~#t387~0.offset, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ULTIMATE.start_main_~#t386~0.offset, ULTIMATE.start_main_~#t385~0.offset, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ULTIMATE.start_main_~#t385~0.base, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ULTIMATE.start_main_~#t387~0.base, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-18 20:26:21,615 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [864] [864] L837-1-->L839: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t386~0.base_12|)) (= 0 |v_ULTIMATE.start_main_~#t386~0.offset_10|) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t386~0.base_12| 1)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t386~0.base_12| 4)) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t386~0.base_12|)) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t386~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t386~0.base_12|) |v_ULTIMATE.start_main_~#t386~0.offset_10| 1))) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t386~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t386~0.base=|v_ULTIMATE.start_main_~#t386~0.base_12|, ULTIMATE.start_main_~#t386~0.offset=|v_ULTIMATE.start_main_~#t386~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t386~0.base, ULTIMATE.start_main_~#t386~0.offset] because there is no mapped edge [2019-12-18 20:26:21,616 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L839-1-->L841: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t387~0.offset_11|) (not (= |v_ULTIMATE.start_main_~#t387~0.base_13| 0)) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t387~0.base_13|)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t387~0.base_13| 4)) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t387~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t387~0.base_13|) |v_ULTIMATE.start_main_~#t387~0.offset_11| 2))) (= (store |v_#valid_37| |v_ULTIMATE.start_main_~#t387~0.base_13| 1) |v_#valid_36|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t387~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t387~0.base=|v_ULTIMATE.start_main_~#t387~0.base_13|, ULTIMATE.start_main_~#t387~0.offset=|v_ULTIMATE.start_main_~#t387~0.offset_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t387~0.base, ULTIMATE.start_main_~#t387~0.offset] because there is no mapped edge [2019-12-18 20:26:21,618 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L4-->L758: Formula: (and (= 1 ~a$r_buff0_thd1~0_Out1719380248) (= 1 ~x~0_Out1719380248) (= ~a$r_buff1_thd0~0_Out1719380248 ~a$r_buff0_thd0~0_In1719380248) (= ~a$r_buff1_thd3~0_Out1719380248 ~a$r_buff0_thd3~0_In1719380248) (= ~a$r_buff0_thd1~0_In1719380248 ~a$r_buff1_thd1~0_Out1719380248) (= ~__unbuffered_p0_EAX~0_Out1719380248 ~x~0_Out1719380248) (not (= 0 P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1719380248)) (= ~y~0_In1719380248 ~__unbuffered_p0_EBX~0_Out1719380248) (= ~a$r_buff0_thd2~0_In1719380248 ~a$r_buff1_thd2~0_Out1719380248)) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1719380248, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1719380248, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1719380248, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1719380248, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1719380248, ~y~0=~y~0_In1719380248} OutVars{~__unbuffered_p0_EBX~0=~__unbuffered_p0_EBX~0_Out1719380248, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_Out1719380248, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_Out1719380248, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_Out1719380248, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1719380248, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1719380248, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out1719380248, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1719380248, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out1719380248, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out1719380248, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1719380248, ~y~0=~y~0_In1719380248, ~x~0=~x~0_Out1719380248} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, ~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd0~0, ~a$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-18 20:26:21,621 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L759-->L759-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In1676752957 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In1676752957 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In1676752957 |P0Thread1of1ForFork1_#t~ite5_Out1676752957|)) (and (not .cse1) (not .cse0) (= |P0Thread1of1ForFork1_#t~ite5_Out1676752957| 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1676752957, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1676752957} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out1676752957|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1676752957, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1676752957} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 20:26:21,622 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L760-->L760-2: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In623043603 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd1~0_In623043603 256) 0)) (.cse3 (= (mod ~a$r_buff0_thd1~0_In623043603 256) 0)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In623043603 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite6_Out623043603| ~a$w_buff1_used~0_In623043603)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork1_#t~ite6_Out623043603| 0)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In623043603, ~a$w_buff0_used~0=~a$w_buff0_used~0_In623043603, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In623043603, ~a$w_buff1_used~0=~a$w_buff1_used~0_In623043603} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out623043603|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In623043603, ~a$w_buff0_used~0=~a$w_buff0_used~0_In623043603, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In623043603, ~a$w_buff1_used~0=~a$w_buff1_used~0_In623043603} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 20:26:21,622 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L778-2-->L778-4: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd2~0_In1249083580 256) 0)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In1249083580 256)))) (or (and (= ~a$w_buff1~0_In1249083580 |P1Thread1of1ForFork2_#t~ite9_Out1249083580|) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite9_Out1249083580| ~a~0_In1249083580) (or .cse1 .cse0)))) InVars {~a~0=~a~0_In1249083580, ~a$w_buff1~0=~a$w_buff1~0_In1249083580, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1249083580, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1249083580} OutVars{~a~0=~a~0_In1249083580, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out1249083580|, ~a$w_buff1~0=~a$w_buff1~0_In1249083580, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1249083580, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1249083580} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-18 20:26:21,623 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L778-4-->L779: Formula: (= v_~a~0_18 |v_P1Thread1of1ForFork2_#t~ite9_8|) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_8|} OutVars{~a~0=v_~a~0_18, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_7|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_7|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-18 20:26:21,623 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L761-->L762: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In-1701477032 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1701477032 256)))) (or (and (= ~a$r_buff0_thd1~0_Out-1701477032 ~a$r_buff0_thd1~0_In-1701477032) (or .cse0 .cse1)) (and (not .cse0) (= ~a$r_buff0_thd1~0_Out-1701477032 0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1701477032, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1701477032} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-1701477032|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1701477032, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-1701477032} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 20:26:21,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L762-->L762-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-720209126 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In-720209126 256))) (.cse2 (= (mod ~a$r_buff1_thd1~0_In-720209126 256) 0)) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In-720209126 256)))) (or (and (or .cse0 .cse1) (= ~a$r_buff1_thd1~0_In-720209126 |P0Thread1of1ForFork1_#t~ite8_Out-720209126|) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork1_#t~ite8_Out-720209126|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-720209126, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-720209126, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-720209126, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-720209126} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-720209126|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-720209126, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-720209126, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-720209126, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-720209126} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 20:26:21,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L762-2-->P0EXIT: Formula: (and (= v_~a$r_buff1_thd1~0_15 |v_P0Thread1of1ForFork1_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_7|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_15, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 20:26:21,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L779-->L779-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In741868229 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In741868229 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out741868229|)) (and (= ~a$w_buff0_used~0_In741868229 |P1Thread1of1ForFork2_#t~ite11_Out741868229|) (or .cse1 .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In741868229, ~a$w_buff0_used~0=~a$w_buff0_used~0_In741868229} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In741868229, ~a$w_buff0_used~0=~a$w_buff0_used~0_In741868229, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out741868229|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 20:26:21,625 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L803-->L803-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1133270901 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite20_In1133270901| |P2Thread1of1ForFork0_#t~ite20_Out1133270901|) (= ~a$w_buff0~0_In1133270901 |P2Thread1of1ForFork0_#t~ite21_Out1133270901|) (not .cse0)) (and (= |P2Thread1of1ForFork0_#t~ite20_Out1133270901| |P2Thread1of1ForFork0_#t~ite21_Out1133270901|) (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In1133270901 256) 0))) (or (and .cse1 (= (mod ~a$r_buff1_thd3~0_In1133270901 256) 0)) (and (= 0 (mod ~a$w_buff1_used~0_In1133270901 256)) .cse1) (= 0 (mod ~a$w_buff0_used~0_In1133270901 256)))) .cse0 (= ~a$w_buff0~0_In1133270901 |P2Thread1of1ForFork0_#t~ite20_Out1133270901|)))) InVars {~a$w_buff0~0=~a$w_buff0~0_In1133270901, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1133270901, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1133270901, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1133270901, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1133270901, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In1133270901|, ~weak$$choice2~0=~weak$$choice2~0_In1133270901} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out1133270901|, ~a$w_buff0~0=~a$w_buff0~0_In1133270901, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1133270901, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1133270901, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1133270901, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out1133270901|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1133270901, ~weak$$choice2~0=~weak$$choice2~0_In1133270901} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-18 20:26:21,626 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L804-->L804-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In781967366 256)))) (or (and (= ~a$w_buff1~0_In781967366 |P2Thread1of1ForFork0_#t~ite24_Out781967366|) (= |P2Thread1of1ForFork0_#t~ite23_In781967366| |P2Thread1of1ForFork0_#t~ite23_Out781967366|) (not .cse0)) (and (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In781967366 256) 0))) (or (and .cse1 (= 0 (mod ~a$w_buff1_used~0_In781967366 256))) (and .cse1 (= 0 (mod ~a$r_buff1_thd3~0_In781967366 256))) (= 0 (mod ~a$w_buff0_used~0_In781967366 256)))) (= ~a$w_buff1~0_In781967366 |P2Thread1of1ForFork0_#t~ite23_Out781967366|) (= |P2Thread1of1ForFork0_#t~ite24_Out781967366| |P2Thread1of1ForFork0_#t~ite23_Out781967366|) .cse0))) InVars {~a$w_buff1~0=~a$w_buff1~0_In781967366, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In781967366|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In781967366, ~a$w_buff0_used~0=~a$w_buff0_used~0_In781967366, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In781967366, ~a$w_buff1_used~0=~a$w_buff1_used~0_In781967366, ~weak$$choice2~0=~weak$$choice2~0_In781967366} OutVars{~a$w_buff1~0=~a$w_buff1~0_In781967366, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out781967366|, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out781967366|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In781967366, ~a$w_buff0_used~0=~a$w_buff0_used~0_In781967366, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In781967366, ~a$w_buff1_used~0=~a$w_buff1_used~0_In781967366, ~weak$$choice2~0=~weak$$choice2~0_In781967366} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-18 20:26:21,626 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L805-->L805-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-519639880 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite26_In-519639880| |P2Thread1of1ForFork0_#t~ite26_Out-519639880|) (= |P2Thread1of1ForFork0_#t~ite27_Out-519639880| ~a$w_buff0_used~0_In-519639880)) (and (= ~a$w_buff0_used~0_In-519639880 |P2Thread1of1ForFork0_#t~ite26_Out-519639880|) (= |P2Thread1of1ForFork0_#t~ite27_Out-519639880| |P2Thread1of1ForFork0_#t~ite26_Out-519639880|) (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-519639880 256)))) (or (and .cse1 (= 0 (mod ~a$w_buff1_used~0_In-519639880 256))) (= 0 (mod ~a$w_buff0_used~0_In-519639880 256)) (and (= (mod ~a$r_buff1_thd3~0_In-519639880 256) 0) .cse1))) .cse0))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-519639880|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-519639880, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-519639880, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-519639880, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-519639880, ~weak$$choice2~0=~weak$$choice2~0_In-519639880} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-519639880|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-519639880|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-519639880, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-519639880, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-519639880, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-519639880, ~weak$$choice2~0=~weak$$choice2~0_In-519639880} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-18 20:26:21,628 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L807-->L808: Formula: (and (= v_~a$r_buff0_thd3~0_49 v_~a$r_buff0_thd3~0_48) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_49, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_7|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_48, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_7|, ~weak$$choice2~0=v_~weak$$choice2~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 20:26:21,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L810-->L814: Formula: (and (not (= (mod v_~a$flush_delayed~0_7 256) 0)) (= v_~a~0_16 v_~a$mem_tmp~0_4) (= v_~a$flush_delayed~0_6 0)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_4, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_16, ~a$mem_tmp~0=v_~a$mem_tmp~0_4, ~a$flush_delayed~0=v_~a$flush_delayed~0_6} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-18 20:26:21,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L814-2-->L814-4: Formula: (let ((.cse0 (= (mod ~a$r_buff1_thd3~0_In-117983445 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In-117983445 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out-117983445| ~a~0_In-117983445)) (and (= ~a$w_buff1~0_In-117983445 |P2Thread1of1ForFork0_#t~ite38_Out-117983445|) (not .cse0) (not .cse1)))) InVars {~a~0=~a~0_In-117983445, ~a$w_buff1~0=~a$w_buff1~0_In-117983445, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-117983445, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-117983445} OutVars{~a~0=~a~0_In-117983445, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-117983445|, ~a$w_buff1~0=~a$w_buff1~0_In-117983445, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-117983445, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-117983445} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 20:26:21,631 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L814-4-->L815: Formula: (= v_~a~0_19 |v_P2Thread1of1ForFork0_#t~ite38_8|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_8|} OutVars{~a~0=v_~a~0_19, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_7|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_7|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 20:26:21,631 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L815-->L815-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-110683210 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-110683210 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out-110683210| 0)) (and (= |P2Thread1of1ForFork0_#t~ite40_Out-110683210| ~a$w_buff0_used~0_In-110683210) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-110683210, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-110683210} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-110683210|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-110683210, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-110683210} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 20:26:21,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L816-->L816-2: Formula: (let ((.cse2 (= (mod ~a$r_buff0_thd3~0_In254834805 256) 0)) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In254834805 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In254834805 256))) (.cse0 (= (mod ~a$r_buff1_thd3~0_In254834805 256) 0))) (or (and (= ~a$w_buff1_used~0_In254834805 |P2Thread1of1ForFork0_#t~ite41_Out254834805|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork0_#t~ite41_Out254834805|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In254834805, ~a$w_buff0_used~0=~a$w_buff0_used~0_In254834805, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In254834805, ~a$w_buff1_used~0=~a$w_buff1_used~0_In254834805} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In254834805, ~a$w_buff0_used~0=~a$w_buff0_used~0_In254834805, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In254834805, ~a$w_buff1_used~0=~a$w_buff1_used~0_In254834805, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out254834805|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 20:26:21,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L817-->L817-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-1440470132 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1440470132 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite42_Out-1440470132| 0) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out-1440470132| ~a$r_buff0_thd3~0_In-1440470132) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1440470132, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1440470132} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-1440470132, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1440470132, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-1440470132|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 20:26:21,633 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L818-->L818-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd3~0_In-78910200 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-78910200 256))) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-78910200 256))) (.cse2 (= 0 (mod ~a$r_buff0_thd3~0_In-78910200 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite43_Out-78910200| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~a$r_buff1_thd3~0_In-78910200 |P2Thread1of1ForFork0_#t~ite43_Out-78910200|) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-78910200, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-78910200, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-78910200, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-78910200} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-78910200|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-78910200, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-78910200, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-78910200, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-78910200} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 20:26:21,633 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [862] [862] L818-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= v_~a$r_buff1_thd3~0_42 |v_P2Thread1of1ForFork0_#t~ite43_8|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_42, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 20:26:21,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L780-->L780-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff0_thd2~0_In652682148 256))) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In652682148 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In652682148 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In652682148 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$w_buff1_used~0_In652682148 |P1Thread1of1ForFork2_#t~ite12_Out652682148|)) (and (= 0 |P1Thread1of1ForFork2_#t~ite12_Out652682148|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In652682148, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In652682148, ~a$w_buff0_used~0=~a$w_buff0_used~0_In652682148, ~a$w_buff1_used~0=~a$w_buff1_used~0_In652682148} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In652682148, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In652682148, ~a$w_buff0_used~0=~a$w_buff0_used~0_In652682148, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out652682148|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In652682148} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 20:26:21,635 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L781-->L781-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-448407568 256))) (.cse0 (= (mod ~a$r_buff0_thd2~0_In-448407568 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite13_Out-448407568| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite13_Out-448407568| ~a$r_buff0_thd2~0_In-448407568) (or .cse1 .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-448407568, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-448407568} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-448407568, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-448407568, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-448407568|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 20:26:21,635 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L782-->L782-2: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd2~0_In-762659575 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In-762659575 256) 0)) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-762659575 256))) (.cse2 (= 0 (mod ~a$r_buff0_thd2~0_In-762659575 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$r_buff1_thd2~0_In-762659575 |P1Thread1of1ForFork2_#t~ite14_Out-762659575|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork2_#t~ite14_Out-762659575|)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-762659575, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-762659575, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-762659575, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-762659575} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-762659575, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-762659575, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-762659575, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-762659575, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-762659575|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 20:26:21,636 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L782-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite14_8| v_~a$r_buff1_thd2~0_13) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_7|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 20:26:21,636 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L841-1-->L847: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 20:26:21,637 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L847-2-->L847-4: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In-634495932 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd0~0_In-634495932 256)))) (or (and (= ~a$w_buff1~0_In-634495932 |ULTIMATE.start_main_#t~ite47_Out-634495932|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite47_Out-634495932| ~a~0_In-634495932)))) InVars {~a~0=~a~0_In-634495932, ~a$w_buff1~0=~a$w_buff1~0_In-634495932, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-634495932, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-634495932} OutVars{~a~0=~a~0_In-634495932, ~a$w_buff1~0=~a$w_buff1~0_In-634495932, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-634495932|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-634495932, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-634495932} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 20:26:21,637 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L847-4-->L848: Formula: (= v_~a~0_21 |v_ULTIMATE.start_main_#t~ite47_7|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_7|} OutVars{~a~0=v_~a~0_21, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 20:26:21,637 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L848-->L848-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-40010557 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In-40010557 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite49_Out-40010557| ~a$w_buff0_used~0_In-40010557)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite49_Out-40010557| 0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-40010557, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-40010557} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-40010557, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-40010557|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-40010557} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 20:26:21,638 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L849-->L849-2: Formula: (let ((.cse3 (= (mod ~a$w_buff0_used~0_In-1913170425 256) 0)) (.cse2 (= 0 (mod ~a$r_buff0_thd0~0_In-1913170425 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In-1913170425 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-1913170425 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff1_used~0_In-1913170425 |ULTIMATE.start_main_#t~ite50_Out-1913170425|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite50_Out-1913170425|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1913170425, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1913170425, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1913170425, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1913170425} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1913170425|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1913170425, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1913170425, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1913170425, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1913170425} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 20:26:21,638 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L850-->L850-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1384817342 256))) (.cse0 (= (mod ~a$r_buff0_thd0~0_In-1384817342 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out-1384817342| 0)) (and (= ~a$r_buff0_thd0~0_In-1384817342 |ULTIMATE.start_main_#t~ite51_Out-1384817342|) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1384817342, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1384817342} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1384817342|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1384817342, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1384817342} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 20:26:21,639 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L851-->L851-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-1693834608 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In-1693834608 256))) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In-1693834608 256))) (.cse2 (= (mod ~a$r_buff1_thd0~0_In-1693834608 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out-1693834608| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite52_Out-1693834608| ~a$r_buff1_thd0~0_In-1693834608)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1693834608, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1693834608, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1693834608, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1693834608} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1693834608|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1693834608, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1693834608, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1693834608, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1693834608} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 20:26:21,640 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [896] [896] L851-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= 1 v_~__unbuffered_p0_EAX~0_12) (= v_~__unbuffered_p2_EBX~0_10 0) (= v_~main$tmp_guard1~0_13 0) (= 0 v_~__unbuffered_p1_EAX~0_9) (= v_~__unbuffered_p2_EAX~0_9 1) (= v_~__unbuffered_p0_EBX~0_12 0) (= |v_ULTIMATE.start_main_#t~ite52_15| v_~a$r_buff1_thd0~0_19)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_15|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_12, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_10, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_14|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_12, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_10, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_19, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 20:26:21,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 08:26:21 BasicIcfg [2019-12-18 20:26:21,742 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 20:26:21,744 INFO L168 Benchmark]: Toolchain (without parser) took 114098.81 ms. Allocated memory was 137.4 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 100.9 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 627.2 MB. Max. memory is 7.1 GB. [2019-12-18 20:26:21,744 INFO L168 Benchmark]: CDTParser took 1.26 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-18 20:26:21,744 INFO L168 Benchmark]: CACSL2BoogieTranslator took 818.98 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 100.5 MB in the beginning and 155.0 MB in the end (delta: -54.5 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. [2019-12-18 20:26:21,745 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.20 ms. Allocated memory is still 201.9 MB. Free memory was 155.0 MB in the beginning and 152.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 20:26:21,745 INFO L168 Benchmark]: Boogie Preprocessor took 40.68 ms. Allocated memory is still 201.9 MB. Free memory was 152.2 MB in the beginning and 150.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 20:26:21,745 INFO L168 Benchmark]: RCFGBuilder took 1080.51 ms. Allocated memory is still 201.9 MB. Free memory was 150.2 MB in the beginning and 99.1 MB in the end (delta: 51.1 MB). Peak memory consumption was 51.1 MB. Max. memory is 7.1 GB. [2019-12-18 20:26:21,746 INFO L168 Benchmark]: TraceAbstraction took 112077.56 ms. Allocated memory was 201.9 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 99.1 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 560.9 MB. Max. memory is 7.1 GB. [2019-12-18 20:26:21,748 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.26 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 818.98 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 100.5 MB in the beginning and 155.0 MB in the end (delta: -54.5 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 75.20 ms. Allocated memory is still 201.9 MB. Free memory was 155.0 MB in the beginning and 152.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.68 ms. Allocated memory is still 201.9 MB. Free memory was 152.2 MB in the beginning and 150.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1080.51 ms. Allocated memory is still 201.9 MB. Free memory was 150.2 MB in the beginning and 99.1 MB in the end (delta: 51.1 MB). Peak memory consumption was 51.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 112077.56 ms. Allocated memory was 201.9 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 99.1 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 560.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.2s, 179 ProgramPointsBefore, 95 ProgramPointsAfterwards, 216 TransitionsBefore, 104 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 32 ChoiceCompositions, 7008 VarBasedMoverChecksPositive, 202 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 83227 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L837] FCALL, FORK 0 pthread_create(&t385, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L839] FCALL, FORK 0 pthread_create(&t386, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L841] FCALL, FORK 0 pthread_create(&t387, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L737] 1 a$w_buff1 = a$w_buff0 [L738] 1 a$w_buff0 = 1 [L739] 1 a$w_buff1_used = a$w_buff0_used [L740] 1 a$w_buff0_used = (_Bool)1 [L758] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L772] 2 y = 1 [L775] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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] [L778] 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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] [L792] 3 z = 1 [L795] 3 __unbuffered_p2_EAX = z [L798] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 3 a$flush_delayed = weak$$choice2 [L801] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, z=1] [L802] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, z=1] [L758] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L759] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L760] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L802] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L803] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L804] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L805] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L806] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L806] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L808] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=1, z=1] [L814] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=1, z=1] [L815] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L816] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L817] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L779] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L780] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L781] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L847] 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=1, z=1] [L848] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L849] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L850] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 170 locations, 2 error locations. Result: UNSAFE, OverallTime: 111.7s, OverallIterations: 38, TraceHistogramMax: 1, AutomataDifference: 38.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8350 SDtfs, 13981 SDslu, 28107 SDs, 0 SdLazy, 14781 SolverSat, 822 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 542 GetRequests, 60 SyntacticMatches, 32 SemanticMatches, 450 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2104 ImplicationChecksByTransitivity, 8.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=160651occurred 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: 43.4s AutomataMinimizationTime, 37 MinimizatonAttempts, 306242 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 1749 NumberOfCodeBlocks, 1749 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 1645 ConstructedInterpolants, 0 QuantifiedInterpolants, 389446 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 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...