/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix025_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 20:34:07,445 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 20:34:07,448 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 20:34:07,465 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 20:34:07,465 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 20:34:07,467 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 20:34:07,468 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 20:34:07,470 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 20:34:07,472 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 20:34:07,472 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 20:34:07,473 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 20:34:07,474 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 20:34:07,475 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 20:34:07,476 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 20:34:07,477 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 20:34:07,478 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 20:34:07,478 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 20:34:07,479 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 20:34:07,481 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 20:34:07,485 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 20:34:07,487 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 20:34:07,491 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 20:34:07,492 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 20:34:07,493 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 20:34:07,496 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 20:34:07,497 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 20:34:07,497 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 20:34:07,498 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 20:34:07,498 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 20:34:07,499 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 20:34:07,499 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 20:34:07,500 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 20:34:07,504 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 20:34:07,506 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 20:34:07,507 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 20:34:07,508 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 20:34:07,508 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 20:34:07,508 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 20:34:07,509 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 20:34:07,509 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 20:34:07,510 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 20:34:07,511 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 20:34:07,526 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 20:34:07,526 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 20:34:07,530 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 20:34:07,530 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 20:34:07,530 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 20:34:07,531 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 20:34:07,531 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 20:34:07,531 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 20:34:07,531 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 20:34:07,531 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 20:34:07,532 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 20:34:07,532 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 20:34:07,532 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 20:34:07,532 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 20:34:07,532 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 20:34:07,533 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 20:34:07,533 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 20:34:07,534 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 20:34:07,534 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 20:34:07,534 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 20:34:07,534 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 20:34:07,534 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:34:07,535 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 20:34:07,535 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 20:34:07,535 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 20:34:07,535 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 20:34:07,536 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 20:34:07,536 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 20:34:07,536 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 20:34:07,536 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 20:34:07,536 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 20:34:07,537 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 20:34:07,827 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 20:34:07,842 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 20:34:07,845 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 20:34:07,847 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 20:34:07,848 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 20:34:07,849 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix025_power.opt.i [2019-12-27 20:34:07,925 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e59f42b6d/44d40539d77c41edbc01aa1e0569874d/FLAGa3022f064 [2019-12-27 20:34:08,520 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 20:34:08,521 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix025_power.opt.i [2019-12-27 20:34:08,542 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e59f42b6d/44d40539d77c41edbc01aa1e0569874d/FLAGa3022f064 [2019-12-27 20:34:08,755 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e59f42b6d/44d40539d77c41edbc01aa1e0569874d [2019-12-27 20:34:08,765 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 20:34:08,767 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 20:34:08,769 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 20:34:08,769 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 20:34:08,772 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 20:34:08,773 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:34:08" (1/1) ... [2019-12-27 20:34:08,776 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2250643d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:34:08, skipping insertion in model container [2019-12-27 20:34:08,776 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:34:08" (1/1) ... [2019-12-27 20:34:08,782 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 20:34:08,837 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 20:34:09,384 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:34:09,397 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 20:34:09,489 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:34:09,565 INFO L208 MainTranslator]: Completed translation [2019-12-27 20:34:09,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:34:09 WrapperNode [2019-12-27 20:34:09,565 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 20:34:09,566 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 20:34:09,566 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 20:34:09,566 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 20:34:09,576 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:34:09" (1/1) ... [2019-12-27 20:34:09,597 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:34:09" (1/1) ... [2019-12-27 20:34:09,628 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 20:34:09,628 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 20:34:09,629 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 20:34:09,629 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 20:34:09,639 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:34:09" (1/1) ... [2019-12-27 20:34:09,640 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:34:09" (1/1) ... [2019-12-27 20:34:09,645 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:34:09" (1/1) ... [2019-12-27 20:34:09,645 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:34:09" (1/1) ... [2019-12-27 20:34:09,657 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:34:09" (1/1) ... [2019-12-27 20:34:09,663 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:34:09" (1/1) ... [2019-12-27 20:34:09,667 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:34:09" (1/1) ... [2019-12-27 20:34:09,672 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 20:34:09,673 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 20:34:09,673 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 20:34:09,673 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 20:34:09,674 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:34:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:34:09,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 20:34:09,735 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 20:34:09,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 20:34:09,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 20:34:09,736 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 20:34:09,736 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 20:34:09,736 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 20:34:09,737 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 20:34:09,737 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 20:34:09,737 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 20:34:09,737 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 20:34:09,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 20:34:09,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 20:34:09,739 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 20:34:10,489 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 20:34:10,490 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 20:34:10,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:34:10 BoogieIcfgContainer [2019-12-27 20:34:10,491 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 20:34:10,492 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 20:34:10,493 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 20:34:10,496 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 20:34:10,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:34:08" (1/3) ... [2019-12-27 20:34:10,497 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51c81f93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:34:10, skipping insertion in model container [2019-12-27 20:34:10,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:34:09" (2/3) ... [2019-12-27 20:34:10,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51c81f93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:34:10, skipping insertion in model container [2019-12-27 20:34:10,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:34:10" (3/3) ... [2019-12-27 20:34:10,501 INFO L109 eAbstractionObserver]: Analyzing ICFG mix025_power.opt.i [2019-12-27 20:34:10,512 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 20:34:10,512 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 20:34:10,527 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 20:34:10,528 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 20:34:10,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,572 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,572 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,572 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,574 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,574 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,587 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,588 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,604 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,604 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,671 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,673 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,680 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,680 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,681 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,688 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,688 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:34:10,703 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 20:34:10,718 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 20:34:10,719 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 20:34:10,719 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 20:34:10,719 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 20:34:10,719 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 20:34:10,719 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 20:34:10,719 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 20:34:10,719 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 20:34:10,733 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-27 20:34:10,735 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 20:34:10,857 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 20:34:10,857 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:34:10,873 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 20:34:10,895 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 20:34:10,975 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 20:34:10,975 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:34:10,988 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 20:34:11,010 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 20:34:11,011 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 20:34:14,571 WARN L192 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 20:34:14,702 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 20:34:14,729 INFO L206 etLargeBlockEncoding]: Checked pairs total: 84223 [2019-12-27 20:34:14,729 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-27 20:34:14,733 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 104 transitions [2019-12-27 20:34:34,780 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 122130 states. [2019-12-27 20:34:34,782 INFO L276 IsEmpty]: Start isEmpty. Operand 122130 states. [2019-12-27 20:34:34,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 20:34:34,788 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:34:34,789 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 20:34:34,789 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:34:34,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:34:34,795 INFO L82 PathProgramCache]: Analyzing trace with hash 912016, now seen corresponding path program 1 times [2019-12-27 20:34:34,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:34:34,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184830767] [2019-12-27 20:34:34,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:34:34,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:34:35,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:34:35,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184830767] [2019-12-27 20:34:35,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:34:35,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:34:35,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1868816509] [2019-12-27 20:34:35,011 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:34:35,015 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:34:35,029 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 20:34:35,029 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:34:35,033 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:34:35,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:34:35,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:34:35,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:34:35,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:34:35,051 INFO L87 Difference]: Start difference. First operand 122130 states. Second operand 3 states. [2019-12-27 20:34:37,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:34:37,742 INFO L93 Difference]: Finished difference Result 120482 states and 514480 transitions. [2019-12-27 20:34:37,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:34:37,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 20:34:37,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:34:38,420 INFO L225 Difference]: With dead ends: 120482 [2019-12-27 20:34:38,420 INFO L226 Difference]: Without dead ends: 113384 [2019-12-27 20:34:38,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:34:45,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113384 states. [2019-12-27 20:34:47,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113384 to 113384. [2019-12-27 20:34:47,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113384 states. [2019-12-27 20:34:48,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113384 states to 113384 states and 483579 transitions. [2019-12-27 20:34:48,508 INFO L78 Accepts]: Start accepts. Automaton has 113384 states and 483579 transitions. Word has length 3 [2019-12-27 20:34:48,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:34:48,509 INFO L462 AbstractCegarLoop]: Abstraction has 113384 states and 483579 transitions. [2019-12-27 20:34:48,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:34:48,509 INFO L276 IsEmpty]: Start isEmpty. Operand 113384 states and 483579 transitions. [2019-12-27 20:34:48,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 20:34:48,517 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:34:48,517 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:34:48,518 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:34:48,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:34:48,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1106167815, now seen corresponding path program 1 times [2019-12-27 20:34:48,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:34:48,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51941342] [2019-12-27 20:34:48,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:34:48,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:34:48,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:34:48,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51941342] [2019-12-27 20:34:48,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:34:48,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:34:48,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2107530049] [2019-12-27 20:34:48,686 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:34:48,687 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:34:48,690 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 20:34:48,690 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:34:48,691 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:34:48,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:34:48,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:34:48,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:34:48,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:34:48,693 INFO L87 Difference]: Start difference. First operand 113384 states and 483579 transitions. Second operand 4 states. [2019-12-27 20:34:54,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:34:54,103 INFO L93 Difference]: Finished difference Result 179498 states and 731972 transitions. [2019-12-27 20:34:54,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:34:54,103 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 20:34:54,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:34:54,824 INFO L225 Difference]: With dead ends: 179498 [2019-12-27 20:34:54,824 INFO L226 Difference]: Without dead ends: 179449 [2019-12-27 20:34:54,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:35:00,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179449 states. [2019-12-27 20:35:04,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179449 to 162546. [2019-12-27 20:35:04,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162546 states. [2019-12-27 20:35:05,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162546 states to 162546 states and 672884 transitions. [2019-12-27 20:35:05,438 INFO L78 Accepts]: Start accepts. Automaton has 162546 states and 672884 transitions. Word has length 11 [2019-12-27 20:35:05,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:35:05,439 INFO L462 AbstractCegarLoop]: Abstraction has 162546 states and 672884 transitions. [2019-12-27 20:35:05,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:35:05,439 INFO L276 IsEmpty]: Start isEmpty. Operand 162546 states and 672884 transitions. [2019-12-27 20:35:05,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 20:35:05,445 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:35:05,445 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:35:05,445 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:35:05,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:35:05,445 INFO L82 PathProgramCache]: Analyzing trace with hash 490332773, now seen corresponding path program 1 times [2019-12-27 20:35:05,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:35:05,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739202820] [2019-12-27 20:35:05,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:35:05,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:35:05,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:35:05,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739202820] [2019-12-27 20:35:05,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:35:05,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:35:05,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1886857431] [2019-12-27 20:35:05,510 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:35:05,512 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:35:05,514 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 20:35:05,514 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:35:05,514 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:35:05,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:35:05,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:35:05,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:35:05,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:35:05,515 INFO L87 Difference]: Start difference. First operand 162546 states and 672884 transitions. Second operand 3 states. [2019-12-27 20:35:05,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:35:05,681 INFO L93 Difference]: Finished difference Result 34413 states and 111772 transitions. [2019-12-27 20:35:05,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:35:05,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 20:35:05,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:35:05,757 INFO L225 Difference]: With dead ends: 34413 [2019-12-27 20:35:05,757 INFO L226 Difference]: Without dead ends: 34413 [2019-12-27 20:35:05,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:35:06,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34413 states. [2019-12-27 20:35:11,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34413 to 34413. [2019-12-27 20:35:11,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34413 states. [2019-12-27 20:35:11,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34413 states to 34413 states and 111772 transitions. [2019-12-27 20:35:11,753 INFO L78 Accepts]: Start accepts. Automaton has 34413 states and 111772 transitions. Word has length 13 [2019-12-27 20:35:11,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:35:11,753 INFO L462 AbstractCegarLoop]: Abstraction has 34413 states and 111772 transitions. [2019-12-27 20:35:11,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:35:11,754 INFO L276 IsEmpty]: Start isEmpty. Operand 34413 states and 111772 transitions. [2019-12-27 20:35:11,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 20:35:11,756 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:35:11,756 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:35:11,756 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:35:11,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:35:11,757 INFO L82 PathProgramCache]: Analyzing trace with hash 562012763, now seen corresponding path program 1 times [2019-12-27 20:35:11,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:35:11,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365021382] [2019-12-27 20:35:11,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:35:11,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:35:11,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:35:11,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365021382] [2019-12-27 20:35:11,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:35:11,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:35:11,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [587395933] [2019-12-27 20:35:11,828 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:35:11,830 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:35:11,832 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 20:35:11,833 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:35:11,833 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:35:11,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:35:11,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:35:11,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:35:11,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:35:11,834 INFO L87 Difference]: Start difference. First operand 34413 states and 111772 transitions. Second operand 3 states. [2019-12-27 20:35:12,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:35:12,038 INFO L93 Difference]: Finished difference Result 54627 states and 176362 transitions. [2019-12-27 20:35:12,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:35:12,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 20:35:12,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:35:12,133 INFO L225 Difference]: With dead ends: 54627 [2019-12-27 20:35:12,134 INFO L226 Difference]: Without dead ends: 54627 [2019-12-27 20:35:12,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:35:12,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54627 states. [2019-12-27 20:35:12,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54627 to 41131. [2019-12-27 20:35:12,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41131 states. [2019-12-27 20:35:12,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41131 states to 41131 states and 134258 transitions. [2019-12-27 20:35:12,954 INFO L78 Accepts]: Start accepts. Automaton has 41131 states and 134258 transitions. Word has length 16 [2019-12-27 20:35:12,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:35:12,955 INFO L462 AbstractCegarLoop]: Abstraction has 41131 states and 134258 transitions. [2019-12-27 20:35:12,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:35:12,955 INFO L276 IsEmpty]: Start isEmpty. Operand 41131 states and 134258 transitions. [2019-12-27 20:35:12,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 20:35:12,959 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:35:12,959 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:35:12,959 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:35:12,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:35:12,960 INFO L82 PathProgramCache]: Analyzing trace with hash 562138282, now seen corresponding path program 1 times [2019-12-27 20:35:12,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:35:12,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945555859] [2019-12-27 20:35:12,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:35:12,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:35:13,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:35:13,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945555859] [2019-12-27 20:35:13,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:35:13,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:35:13,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1778948178] [2019-12-27 20:35:13,041 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:35:13,044 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:35:13,046 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 20:35:13,047 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:35:13,047 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:35:13,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:35:13,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:35:13,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:35:13,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:35:13,048 INFO L87 Difference]: Start difference. First operand 41131 states and 134258 transitions. Second operand 4 states. [2019-12-27 20:35:13,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:35:13,813 INFO L93 Difference]: Finished difference Result 48927 states and 157520 transitions. [2019-12-27 20:35:13,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:35:13,813 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 20:35:13,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:35:13,926 INFO L225 Difference]: With dead ends: 48927 [2019-12-27 20:35:13,926 INFO L226 Difference]: Without dead ends: 48927 [2019-12-27 20:35:13,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:35:14,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48927 states. [2019-12-27 20:35:14,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48927 to 44953. [2019-12-27 20:35:14,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44953 states. [2019-12-27 20:35:14,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44953 states to 44953 states and 145741 transitions. [2019-12-27 20:35:14,726 INFO L78 Accepts]: Start accepts. Automaton has 44953 states and 145741 transitions. Word has length 16 [2019-12-27 20:35:14,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:35:14,726 INFO L462 AbstractCegarLoop]: Abstraction has 44953 states and 145741 transitions. [2019-12-27 20:35:14,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:35:14,726 INFO L276 IsEmpty]: Start isEmpty. Operand 44953 states and 145741 transitions. [2019-12-27 20:35:14,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 20:35:14,730 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:35:14,730 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:35:14,730 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:35:14,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:35:14,730 INFO L82 PathProgramCache]: Analyzing trace with hash 173692215, now seen corresponding path program 1 times [2019-12-27 20:35:14,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:35:14,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154875412] [2019-12-27 20:35:14,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:35:14,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:35:14,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:35:14,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154875412] [2019-12-27 20:35:14,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:35:14,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:35:14,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [543642540] [2019-12-27 20:35:14,806 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:35:14,807 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:35:14,810 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 20:35:14,810 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:35:14,810 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:35:14,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:35:14,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:35:14,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:35:14,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:35:14,811 INFO L87 Difference]: Start difference. First operand 44953 states and 145741 transitions. Second operand 4 states. [2019-12-27 20:35:15,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:35:15,214 INFO L93 Difference]: Finished difference Result 53251 states and 171579 transitions. [2019-12-27 20:35:15,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:35:15,215 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 20:35:15,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:35:15,310 INFO L225 Difference]: With dead ends: 53251 [2019-12-27 20:35:15,311 INFO L226 Difference]: Without dead ends: 53251 [2019-12-27 20:35:15,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:35:15,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53251 states. [2019-12-27 20:35:16,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53251 to 46409. [2019-12-27 20:35:16,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46409 states. [2019-12-27 20:35:16,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46409 states to 46409 states and 150674 transitions. [2019-12-27 20:35:16,552 INFO L78 Accepts]: Start accepts. Automaton has 46409 states and 150674 transitions. Word has length 16 [2019-12-27 20:35:16,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:35:16,552 INFO L462 AbstractCegarLoop]: Abstraction has 46409 states and 150674 transitions. [2019-12-27 20:35:16,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:35:16,552 INFO L276 IsEmpty]: Start isEmpty. Operand 46409 states and 150674 transitions. [2019-12-27 20:35:16,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 20:35:16,562 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:35:16,562 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:35:16,562 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:35:16,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:35:16,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1710143018, now seen corresponding path program 1 times [2019-12-27 20:35:16,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:35:16,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587992562] [2019-12-27 20:35:16,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:35:16,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:35:16,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:35:16,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587992562] [2019-12-27 20:35:16,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:35:16,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:35:16,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1199976667] [2019-12-27 20:35:16,775 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:35:16,778 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:35:16,788 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 72 transitions. [2019-12-27 20:35:16,788 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:35:16,791 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:35:16,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:35:16,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:35:16,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:35:16,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:35:16,792 INFO L87 Difference]: Start difference. First operand 46409 states and 150674 transitions. Second operand 7 states. [2019-12-27 20:35:18,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:35:18,075 INFO L93 Difference]: Finished difference Result 63407 states and 201418 transitions. [2019-12-27 20:35:18,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 20:35:18,076 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-27 20:35:18,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:35:18,180 INFO L225 Difference]: With dead ends: 63407 [2019-12-27 20:35:18,180 INFO L226 Difference]: Without dead ends: 63400 [2019-12-27 20:35:18,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 20:35:18,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63400 states. [2019-12-27 20:35:19,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63400 to 47584. [2019-12-27 20:35:19,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47584 states. [2019-12-27 20:35:19,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47584 states to 47584 states and 154270 transitions. [2019-12-27 20:35:19,443 INFO L78 Accepts]: Start accepts. Automaton has 47584 states and 154270 transitions. Word has length 22 [2019-12-27 20:35:19,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:35:19,443 INFO L462 AbstractCegarLoop]: Abstraction has 47584 states and 154270 transitions. [2019-12-27 20:35:19,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:35:19,444 INFO L276 IsEmpty]: Start isEmpty. Operand 47584 states and 154270 transitions. [2019-12-27 20:35:19,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 20:35:19,453 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:35:19,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] [2019-12-27 20:35:19,453 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:35:19,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:35:19,454 INFO L82 PathProgramCache]: Analyzing trace with hash 2075627383, now seen corresponding path program 1 times [2019-12-27 20:35:19,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:35:19,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866073100] [2019-12-27 20:35:19,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:35:19,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:35:19,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:35:19,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866073100] [2019-12-27 20:35:19,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:35:19,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:35:19,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [529273287] [2019-12-27 20:35:19,622 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:35:19,624 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:35:19,633 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 72 transitions. [2019-12-27 20:35:19,634 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:35:19,635 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:35:19,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:35:19,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:35:19,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:35:19,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:35:19,636 INFO L87 Difference]: Start difference. First operand 47584 states and 154270 transitions. Second operand 7 states. [2019-12-27 20:35:20,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:35:20,790 INFO L93 Difference]: Finished difference Result 66798 states and 212192 transitions. [2019-12-27 20:35:20,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 20:35:20,791 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-27 20:35:20,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:35:20,908 INFO L225 Difference]: With dead ends: 66798 [2019-12-27 20:35:20,908 INFO L226 Difference]: Without dead ends: 66791 [2019-12-27 20:35:20,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 20:35:21,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66791 states. [2019-12-27 20:35:22,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66791 to 46419. [2019-12-27 20:35:22,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46419 states. [2019-12-27 20:35:22,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46419 states to 46419 states and 150561 transitions. [2019-12-27 20:35:22,182 INFO L78 Accepts]: Start accepts. Automaton has 46419 states and 150561 transitions. Word has length 22 [2019-12-27 20:35:22,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:35:22,182 INFO L462 AbstractCegarLoop]: Abstraction has 46419 states and 150561 transitions. [2019-12-27 20:35:22,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:35:22,182 INFO L276 IsEmpty]: Start isEmpty. Operand 46419 states and 150561 transitions. [2019-12-27 20:35:22,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 20:35:22,194 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:35:22,194 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:35:22,194 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:35:22,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:35:22,194 INFO L82 PathProgramCache]: Analyzing trace with hash -433341706, now seen corresponding path program 1 times [2019-12-27 20:35:22,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:35:22,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132232488] [2019-12-27 20:35:22,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:35:22,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:35:22,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:35:22,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132232488] [2019-12-27 20:35:22,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:35:22,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:35:22,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [36825211] [2019-12-27 20:35:22,237 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:35:22,240 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:35:22,249 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 20:35:22,249 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:35:22,284 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:35:22,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:35:22,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:35:22,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:35:22,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:35:22,285 INFO L87 Difference]: Start difference. First operand 46419 states and 150561 transitions. Second operand 5 states. [2019-12-27 20:35:22,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:35:22,407 INFO L93 Difference]: Finished difference Result 18049 states and 55252 transitions. [2019-12-27 20:35:22,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:35:22,407 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 20:35:22,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:35:22,441 INFO L225 Difference]: With dead ends: 18049 [2019-12-27 20:35:22,441 INFO L226 Difference]: Without dead ends: 18049 [2019-12-27 20:35:22,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:35:22,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18049 states. [2019-12-27 20:35:22,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18049 to 17686. [2019-12-27 20:35:22,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17686 states. [2019-12-27 20:35:22,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17686 states to 17686 states and 54216 transitions. [2019-12-27 20:35:22,731 INFO L78 Accepts]: Start accepts. Automaton has 17686 states and 54216 transitions. Word has length 25 [2019-12-27 20:35:22,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:35:22,731 INFO L462 AbstractCegarLoop]: Abstraction has 17686 states and 54216 transitions. [2019-12-27 20:35:22,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:35:22,732 INFO L276 IsEmpty]: Start isEmpty. Operand 17686 states and 54216 transitions. [2019-12-27 20:35:22,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 20:35:22,743 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:35:22,743 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:35:22,743 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:35:22,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:35:22,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1225408676, now seen corresponding path program 1 times [2019-12-27 20:35:22,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:35:22,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502712469] [2019-12-27 20:35:22,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:35:22,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:35:22,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:35:22,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502712469] [2019-12-27 20:35:22,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:35:22,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:35:22,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1097231387] [2019-12-27 20:35:22,971 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:35:22,975 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:35:22,987 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 59 states and 90 transitions. [2019-12-27 20:35:22,987 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:35:23,140 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 20:35:23,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 20:35:23,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:35:23,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 20:35:23,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-27 20:35:23,142 INFO L87 Difference]: Start difference. First operand 17686 states and 54216 transitions. Second operand 10 states. [2019-12-27 20:35:24,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:35:24,789 INFO L93 Difference]: Finished difference Result 43111 states and 129974 transitions. [2019-12-27 20:35:24,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 20:35:24,790 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-12-27 20:35:24,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:35:24,854 INFO L225 Difference]: With dead ends: 43111 [2019-12-27 20:35:24,854 INFO L226 Difference]: Without dead ends: 43111 [2019-12-27 20:35:24,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-12-27 20:35:24,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43111 states. [2019-12-27 20:35:25,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43111 to 17830. [2019-12-27 20:35:25,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17830 states. [2019-12-27 20:35:25,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17830 states to 17830 states and 54765 transitions. [2019-12-27 20:35:25,274 INFO L78 Accepts]: Start accepts. Automaton has 17830 states and 54765 transitions. Word has length 26 [2019-12-27 20:35:25,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:35:25,274 INFO L462 AbstractCegarLoop]: Abstraction has 17830 states and 54765 transitions. [2019-12-27 20:35:25,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 20:35:25,274 INFO L276 IsEmpty]: Start isEmpty. Operand 17830 states and 54765 transitions. [2019-12-27 20:35:25,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 20:35:25,286 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:35:25,286 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:35:25,286 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:35:25,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:35:25,287 INFO L82 PathProgramCache]: Analyzing trace with hash -990805015, now seen corresponding path program 1 times [2019-12-27 20:35:25,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:35:25,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702411753] [2019-12-27 20:35:25,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:35:25,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:35:25,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:35:25,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702411753] [2019-12-27 20:35:25,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:35:25,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:35:25,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [738433561] [2019-12-27 20:35:25,490 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:35:25,494 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:35:25,511 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 65 states and 102 transitions. [2019-12-27 20:35:25,511 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:35:25,667 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 20:35:25,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 20:35:25,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:35:25,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 20:35:25,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-12-27 20:35:25,669 INFO L87 Difference]: Start difference. First operand 17830 states and 54765 transitions. Second operand 11 states. [2019-12-27 20:35:27,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:35:27,201 INFO L93 Difference]: Finished difference Result 49875 states and 149268 transitions. [2019-12-27 20:35:27,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 20:35:27,202 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2019-12-27 20:35:27,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:35:27,275 INFO L225 Difference]: With dead ends: 49875 [2019-12-27 20:35:27,275 INFO L226 Difference]: Without dead ends: 49875 [2019-12-27 20:35:27,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2019-12-27 20:35:27,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49875 states. [2019-12-27 20:35:27,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49875 to 17618. [2019-12-27 20:35:27,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17618 states. [2019-12-27 20:35:27,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17618 states to 17618 states and 54118 transitions. [2019-12-27 20:35:27,735 INFO L78 Accepts]: Start accepts. Automaton has 17618 states and 54118 transitions. Word has length 26 [2019-12-27 20:35:27,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:35:27,735 INFO L462 AbstractCegarLoop]: Abstraction has 17618 states and 54118 transitions. [2019-12-27 20:35:27,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 20:35:27,735 INFO L276 IsEmpty]: Start isEmpty. Operand 17618 states and 54118 transitions. [2019-12-27 20:35:27,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 20:35:27,748 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:35:27,748 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:35:27,748 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:35:27,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:35:27,748 INFO L82 PathProgramCache]: Analyzing trace with hash -2045967469, now seen corresponding path program 1 times [2019-12-27 20:35:27,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:35:27,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471202005] [2019-12-27 20:35:27,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:35:27,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:35:27,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:35:27,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471202005] [2019-12-27 20:35:27,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:35:27,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:35:27,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [660076885] [2019-12-27 20:35:27,850 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:35:27,854 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:35:27,859 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 20:35:27,860 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:35:27,860 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:35:27,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:35:27,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:35:27,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:35:27,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:35:27,861 INFO L87 Difference]: Start difference. First operand 17618 states and 54118 transitions. Second operand 5 states. [2019-12-27 20:35:28,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:35:28,292 INFO L93 Difference]: Finished difference Result 22269 states and 67256 transitions. [2019-12-27 20:35:28,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 20:35:28,293 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 20:35:28,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:35:28,323 INFO L225 Difference]: With dead ends: 22269 [2019-12-27 20:35:28,323 INFO L226 Difference]: Without dead ends: 22269 [2019-12-27 20:35:28,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:35:28,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22269 states. [2019-12-27 20:35:28,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22269 to 20881. [2019-12-27 20:35:28,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20881 states. [2019-12-27 20:35:28,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20881 states to 20881 states and 63766 transitions. [2019-12-27 20:35:28,624 INFO L78 Accepts]: Start accepts. Automaton has 20881 states and 63766 transitions. Word has length 27 [2019-12-27 20:35:28,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:35:28,624 INFO L462 AbstractCegarLoop]: Abstraction has 20881 states and 63766 transitions. [2019-12-27 20:35:28,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:35:28,624 INFO L276 IsEmpty]: Start isEmpty. Operand 20881 states and 63766 transitions. [2019-12-27 20:35:28,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 20:35:28,639 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:35:28,639 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:35:28,639 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:35:28,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:35:28,640 INFO L82 PathProgramCache]: Analyzing trace with hash -23775369, now seen corresponding path program 1 times [2019-12-27 20:35:28,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:35:28,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330722955] [2019-12-27 20:35:28,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:35:28,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:35:28,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:35:28,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330722955] [2019-12-27 20:35:28,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:35:28,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:35:28,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [481282432] [2019-12-27 20:35:28,714 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:35:28,719 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:35:28,727 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 29 states and 28 transitions. [2019-12-27 20:35:28,727 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:35:28,727 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:35:28,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:35:28,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:35:28,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:35:28,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:35:28,728 INFO L87 Difference]: Start difference. First operand 20881 states and 63766 transitions. Second operand 5 states. [2019-12-27 20:35:28,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:35:28,892 INFO L93 Difference]: Finished difference Result 21383 states and 65101 transitions. [2019-12-27 20:35:28,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:35:28,892 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 20:35:28,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:35:28,931 INFO L225 Difference]: With dead ends: 21383 [2019-12-27 20:35:28,932 INFO L226 Difference]: Without dead ends: 21383 [2019-12-27 20:35:28,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:35:29,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21383 states. [2019-12-27 20:35:29,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21383 to 21383. [2019-12-27 20:35:29,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21383 states. [2019-12-27 20:35:29,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21383 states to 21383 states and 65101 transitions. [2019-12-27 20:35:29,260 INFO L78 Accepts]: Start accepts. Automaton has 21383 states and 65101 transitions. Word has length 28 [2019-12-27 20:35:29,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:35:29,261 INFO L462 AbstractCegarLoop]: Abstraction has 21383 states and 65101 transitions. [2019-12-27 20:35:29,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:35:29,261 INFO L276 IsEmpty]: Start isEmpty. Operand 21383 states and 65101 transitions. [2019-12-27 20:35:29,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 20:35:29,278 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:35:29,278 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:35:29,278 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:35:29,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:35:29,279 INFO L82 PathProgramCache]: Analyzing trace with hash -994503224, now seen corresponding path program 1 times [2019-12-27 20:35:29,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:35:29,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135234613] [2019-12-27 20:35:29,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:35:29,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:35:29,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:35:29,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135234613] [2019-12-27 20:35:29,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:35:29,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:35:29,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1779000668] [2019-12-27 20:35:29,367 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:35:29,371 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:35:29,376 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 30 states and 29 transitions. [2019-12-27 20:35:29,376 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:35:29,376 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:35:29,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:35:29,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:35:29,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:35:29,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:35:29,377 INFO L87 Difference]: Start difference. First operand 21383 states and 65101 transitions. Second operand 5 states. [2019-12-27 20:35:29,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:35:29,698 INFO L93 Difference]: Finished difference Result 24683 states and 74014 transitions. [2019-12-27 20:35:29,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 20:35:29,698 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-27 20:35:29,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:35:29,732 INFO L225 Difference]: With dead ends: 24683 [2019-12-27 20:35:29,732 INFO L226 Difference]: Without dead ends: 24683 [2019-12-27 20:35:29,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:35:29,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24683 states. [2019-12-27 20:35:30,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24683 to 20707. [2019-12-27 20:35:30,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20707 states. [2019-12-27 20:35:30,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20707 states to 20707 states and 63172 transitions. [2019-12-27 20:35:30,057 INFO L78 Accepts]: Start accepts. Automaton has 20707 states and 63172 transitions. Word has length 29 [2019-12-27 20:35:30,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:35:30,058 INFO L462 AbstractCegarLoop]: Abstraction has 20707 states and 63172 transitions. [2019-12-27 20:35:30,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:35:30,058 INFO L276 IsEmpty]: Start isEmpty. Operand 20707 states and 63172 transitions. [2019-12-27 20:35:30,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 20:35:30,076 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:35:30,076 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:35:30,076 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:35:30,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:35:30,076 INFO L82 PathProgramCache]: Analyzing trace with hash 454456511, now seen corresponding path program 1 times [2019-12-27 20:35:30,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:35:30,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807519401] [2019-12-27 20:35:30,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:35:30,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:35:30,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:35:30,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807519401] [2019-12-27 20:35:30,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:35:30,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:35:30,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [685634082] [2019-12-27 20:35:30,261 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:35:30,266 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:35:30,285 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 63 states and 91 transitions. [2019-12-27 20:35:30,285 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:35:30,286 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:35:30,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 20:35:30,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:35:30,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 20:35:30,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:35:30,287 INFO L87 Difference]: Start difference. First operand 20707 states and 63172 transitions. Second operand 8 states. [2019-12-27 20:35:31,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:35:31,613 INFO L93 Difference]: Finished difference Result 31266 states and 93143 transitions. [2019-12-27 20:35:31,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 20:35:31,613 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-27 20:35:31,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:35:31,661 INFO L225 Difference]: With dead ends: 31266 [2019-12-27 20:35:31,662 INFO L226 Difference]: Without dead ends: 31266 [2019-12-27 20:35:31,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2019-12-27 20:35:31,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31266 states. [2019-12-27 20:35:32,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31266 to 23041. [2019-12-27 20:35:32,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23041 states. [2019-12-27 20:35:32,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23041 states to 23041 states and 70098 transitions. [2019-12-27 20:35:32,055 INFO L78 Accepts]: Start accepts. Automaton has 23041 states and 70098 transitions. Word has length 33 [2019-12-27 20:35:32,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:35:32,055 INFO L462 AbstractCegarLoop]: Abstraction has 23041 states and 70098 transitions. [2019-12-27 20:35:32,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 20:35:32,056 INFO L276 IsEmpty]: Start isEmpty. Operand 23041 states and 70098 transitions. [2019-12-27 20:35:32,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-27 20:35:32,078 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:35:32,078 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:35:32,078 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:35:32,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:35:32,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1086926900, now seen corresponding path program 1 times [2019-12-27 20:35:32,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:35:32,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428949066] [2019-12-27 20:35:32,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:35:32,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:35:32,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:35:32,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428949066] [2019-12-27 20:35:32,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:35:32,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:35:32,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [122732460] [2019-12-27 20:35:32,289 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:35:32,297 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:35:32,321 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 66 states and 95 transitions. [2019-12-27 20:35:32,322 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:35:32,322 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:35:32,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 20:35:32,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:35:32,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 20:35:32,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:35:32,323 INFO L87 Difference]: Start difference. First operand 23041 states and 70098 transitions. Second operand 8 states. [2019-12-27 20:35:33,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:35:33,579 INFO L93 Difference]: Finished difference Result 32724 states and 97602 transitions. [2019-12-27 20:35:33,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 20:35:33,580 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2019-12-27 20:35:33,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:35:33,626 INFO L225 Difference]: With dead ends: 32724 [2019-12-27 20:35:33,626 INFO L226 Difference]: Without dead ends: 32724 [2019-12-27 20:35:33,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2019-12-27 20:35:33,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32724 states. [2019-12-27 20:35:33,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32724 to 21920. [2019-12-27 20:35:33,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21920 states. [2019-12-27 20:35:34,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21920 states to 21920 states and 66861 transitions. [2019-12-27 20:35:34,018 INFO L78 Accepts]: Start accepts. Automaton has 21920 states and 66861 transitions. Word has length 35 [2019-12-27 20:35:34,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:35:34,018 INFO L462 AbstractCegarLoop]: Abstraction has 21920 states and 66861 transitions. [2019-12-27 20:35:34,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 20:35:34,018 INFO L276 IsEmpty]: Start isEmpty. Operand 21920 states and 66861 transitions. [2019-12-27 20:35:34,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 20:35:34,042 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:35:34,042 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] [2019-12-27 20:35:34,042 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:35:34,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:35:34,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1061116233, now seen corresponding path program 1 times [2019-12-27 20:35:34,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:35:34,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544590641] [2019-12-27 20:35:34,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:35:34,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:35:34,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:35:34,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544590641] [2019-12-27 20:35:34,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:35:34,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 20:35:34,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1301656382] [2019-12-27 20:35:34,248 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:35:34,254 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:35:34,284 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 89 states and 139 transitions. [2019-12-27 20:35:34,284 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:35:34,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:35:34,433 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-27 20:35:34,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 20:35:34,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:35:34,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 20:35:34,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-12-27 20:35:34,434 INFO L87 Difference]: Start difference. First operand 21920 states and 66861 transitions. Second operand 13 states. [2019-12-27 20:35:35,303 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 21 [2019-12-27 20:35:37,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:35:37,384 INFO L93 Difference]: Finished difference Result 46766 states and 137162 transitions. [2019-12-27 20:35:37,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-27 20:35:37,385 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2019-12-27 20:35:37,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:35:37,449 INFO L225 Difference]: With dead ends: 46766 [2019-12-27 20:35:37,449 INFO L226 Difference]: Without dead ends: 46766 [2019-12-27 20:35:37,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=355, Invalid=1127, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 20:35:37,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46766 states. [2019-12-27 20:35:37,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46766 to 23121. [2019-12-27 20:35:37,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23121 states. [2019-12-27 20:35:37,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23121 states to 23121 states and 70319 transitions. [2019-12-27 20:35:37,943 INFO L78 Accepts]: Start accepts. Automaton has 23121 states and 70319 transitions. Word has length 37 [2019-12-27 20:35:37,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:35:37,943 INFO L462 AbstractCegarLoop]: Abstraction has 23121 states and 70319 transitions. [2019-12-27 20:35:37,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 20:35:37,943 INFO L276 IsEmpty]: Start isEmpty. Operand 23121 states and 70319 transitions. [2019-12-27 20:35:37,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 20:35:37,974 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:35:37,974 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] [2019-12-27 20:35:37,974 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:35:37,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:35:37,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1548882337, now seen corresponding path program 2 times [2019-12-27 20:35:37,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:35:37,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35006107] [2019-12-27 20:35:37,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:35:37,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:35:38,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:35:38,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35006107] [2019-12-27 20:35:38,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:35:38,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 20:35:38,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1178918983] [2019-12-27 20:35:38,187 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:35:38,194 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:35:38,219 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 87 states and 135 transitions. [2019-12-27 20:35:38,220 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:35:38,351 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 20:35:38,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 20:35:38,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:35:38,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 20:35:38,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-12-27 20:35:38,352 INFO L87 Difference]: Start difference. First operand 23121 states and 70319 transitions. Second operand 12 states. [2019-12-27 20:35:40,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:35:40,562 INFO L93 Difference]: Finished difference Result 64632 states and 189250 transitions. [2019-12-27 20:35:40,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 20:35:40,563 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2019-12-27 20:35:40,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:35:40,654 INFO L225 Difference]: With dead ends: 64632 [2019-12-27 20:35:40,654 INFO L226 Difference]: Without dead ends: 64632 [2019-12-27 20:35:40,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=238, Invalid=754, Unknown=0, NotChecked=0, Total=992 [2019-12-27 20:35:41,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64632 states. [2019-12-27 20:35:41,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64632 to 22389. [2019-12-27 20:35:41,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22389 states. [2019-12-27 20:35:41,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22389 states to 22389 states and 68009 transitions. [2019-12-27 20:35:41,417 INFO L78 Accepts]: Start accepts. Automaton has 22389 states and 68009 transitions. Word has length 37 [2019-12-27 20:35:41,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:35:41,417 INFO L462 AbstractCegarLoop]: Abstraction has 22389 states and 68009 transitions. [2019-12-27 20:35:41,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 20:35:41,417 INFO L276 IsEmpty]: Start isEmpty. Operand 22389 states and 68009 transitions. [2019-12-27 20:35:41,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 20:35:41,436 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:35:41,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] [2019-12-27 20:35:41,436 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:35:41,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:35:41,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1485923537, now seen corresponding path program 1 times [2019-12-27 20:35:41,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:35:41,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000243378] [2019-12-27 20:35:41,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:35:41,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:35:41,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:35:41,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000243378] [2019-12-27 20:35:41,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:35:41,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:35:41,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [34444972] [2019-12-27 20:35:41,481 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:35:41,488 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:35:41,559 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 196 states and 411 transitions. [2019-12-27 20:35:41,559 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:35:41,599 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 20:35:41,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:35:41,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:35:41,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:35:41,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:35:41,601 INFO L87 Difference]: Start difference. First operand 22389 states and 68009 transitions. Second operand 4 states. [2019-12-27 20:35:42,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:35:42,040 INFO L93 Difference]: Finished difference Result 53440 states and 161587 transitions. [2019-12-27 20:35:42,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:35:42,041 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-27 20:35:42,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:35:42,107 INFO L225 Difference]: With dead ends: 53440 [2019-12-27 20:35:42,107 INFO L226 Difference]: Without dead ends: 33944 [2019-12-27 20:35:42,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:35:42,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33944 states. [2019-12-27 20:35:42,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33944 to 22871. [2019-12-27 20:35:42,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22871 states. [2019-12-27 20:35:42,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22871 states to 22871 states and 67817 transitions. [2019-12-27 20:35:42,523 INFO L78 Accepts]: Start accepts. Automaton has 22871 states and 67817 transitions. Word has length 39 [2019-12-27 20:35:42,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:35:42,524 INFO L462 AbstractCegarLoop]: Abstraction has 22871 states and 67817 transitions. [2019-12-27 20:35:42,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:35:42,524 INFO L276 IsEmpty]: Start isEmpty. Operand 22871 states and 67817 transitions. [2019-12-27 20:35:42,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 20:35:42,546 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:35:42,546 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:35:42,546 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:35:42,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:35:42,546 INFO L82 PathProgramCache]: Analyzing trace with hash 252616620, now seen corresponding path program 1 times [2019-12-27 20:35:42,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:35:42,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433555919] [2019-12-27 20:35:42,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:35:42,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:35:42,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:35:42,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433555919] [2019-12-27 20:35:42,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:35:42,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 20:35:42,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [128506429] [2019-12-27 20:35:42,781 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:35:42,790 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:35:42,840 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 94 states and 147 transitions. [2019-12-27 20:35:42,841 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:35:42,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:35:43,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:35:43,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:35:43,222 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-27 20:35:43,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 20:35:43,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:35:43,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 20:35:43,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2019-12-27 20:35:43,224 INFO L87 Difference]: Start difference. First operand 22871 states and 67817 transitions. Second operand 16 states. [2019-12-27 20:35:48,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:35:48,340 INFO L93 Difference]: Finished difference Result 59312 states and 172616 transitions. [2019-12-27 20:35:48,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-27 20:35:48,341 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2019-12-27 20:35:48,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:35:48,426 INFO L225 Difference]: With dead ends: 59312 [2019-12-27 20:35:48,426 INFO L226 Difference]: Without dead ends: 59312 [2019-12-27 20:35:48,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 9 SyntacticMatches, 5 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=457, Invalid=1349, Unknown=0, NotChecked=0, Total=1806 [2019-12-27 20:35:48,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59312 states. [2019-12-27 20:35:48,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59312 to 21476. [2019-12-27 20:35:48,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21476 states. [2019-12-27 20:35:48,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21476 states to 21476 states and 63875 transitions. [2019-12-27 20:35:48,969 INFO L78 Accepts]: Start accepts. Automaton has 21476 states and 63875 transitions. Word has length 39 [2019-12-27 20:35:48,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:35:48,970 INFO L462 AbstractCegarLoop]: Abstraction has 21476 states and 63875 transitions. [2019-12-27 20:35:48,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 20:35:48,970 INFO L276 IsEmpty]: Start isEmpty. Operand 21476 states and 63875 transitions. [2019-12-27 20:35:48,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 20:35:48,988 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:35:48,988 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:35:48,988 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:35:48,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:35:48,988 INFO L82 PathProgramCache]: Analyzing trace with hash 157045846, now seen corresponding path program 2 times [2019-12-27 20:35:48,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:35:48,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903964302] [2019-12-27 20:35:48,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:35:49,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:35:49,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:35:49,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903964302] [2019-12-27 20:35:49,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:35:49,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 20:35:49,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [66085009] [2019-12-27 20:35:49,187 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:35:49,195 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:35:49,225 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 85 states and 129 transitions. [2019-12-27 20:35:49,225 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:35:49,378 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 20:35:49,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 20:35:49,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:35:49,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 20:35:49,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-27 20:35:49,380 INFO L87 Difference]: Start difference. First operand 21476 states and 63875 transitions. Second operand 11 states. [2019-12-27 20:35:52,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:35:52,371 INFO L93 Difference]: Finished difference Result 51249 states and 147844 transitions. [2019-12-27 20:35:52,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 20:35:52,371 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2019-12-27 20:35:52,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:35:52,442 INFO L225 Difference]: With dead ends: 51249 [2019-12-27 20:35:52,442 INFO L226 Difference]: Without dead ends: 51249 [2019-12-27 20:35:52,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2019-12-27 20:35:52,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51249 states. [2019-12-27 20:35:52,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51249 to 19432. [2019-12-27 20:35:52,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19432 states. [2019-12-27 20:35:52,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19432 states to 19432 states and 58123 transitions. [2019-12-27 20:35:52,892 INFO L78 Accepts]: Start accepts. Automaton has 19432 states and 58123 transitions. Word has length 39 [2019-12-27 20:35:52,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:35:52,892 INFO L462 AbstractCegarLoop]: Abstraction has 19432 states and 58123 transitions. [2019-12-27 20:35:52,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 20:35:52,893 INFO L276 IsEmpty]: Start isEmpty. Operand 19432 states and 58123 transitions. [2019-12-27 20:35:52,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 20:35:52,911 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:35:52,911 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:35:52,912 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:35:52,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:35:52,912 INFO L82 PathProgramCache]: Analyzing trace with hash 594517850, now seen corresponding path program 1 times [2019-12-27 20:35:52,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:35:52,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746373191] [2019-12-27 20:35:52,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:35:52,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:35:52,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:35:52,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746373191] [2019-12-27 20:35:52,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:35:52,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:35:52,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [515876258] [2019-12-27 20:35:52,993 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:35:53,002 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:35:53,067 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 223 states and 475 transitions. [2019-12-27 20:35:53,067 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:35:53,154 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 20:35:53,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 20:35:53,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:35:53,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 20:35:53,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:35:53,155 INFO L87 Difference]: Start difference. First operand 19432 states and 58123 transitions. Second operand 8 states. [2019-12-27 20:35:53,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:35:53,892 INFO L93 Difference]: Finished difference Result 27659 states and 81928 transitions. [2019-12-27 20:35:53,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 20:35:53,892 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2019-12-27 20:35:53,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:35:53,930 INFO L225 Difference]: With dead ends: 27659 [2019-12-27 20:35:53,931 INFO L226 Difference]: Without dead ends: 27659 [2019-12-27 20:35:53,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:35:54,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27659 states. [2019-12-27 20:35:54,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27659 to 25671. [2019-12-27 20:35:54,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25671 states. [2019-12-27 20:35:54,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25671 states to 25671 states and 76589 transitions. [2019-12-27 20:35:54,307 INFO L78 Accepts]: Start accepts. Automaton has 25671 states and 76589 transitions. Word has length 40 [2019-12-27 20:35:54,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:35:54,307 INFO L462 AbstractCegarLoop]: Abstraction has 25671 states and 76589 transitions. [2019-12-27 20:35:54,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 20:35:54,307 INFO L276 IsEmpty]: Start isEmpty. Operand 25671 states and 76589 transitions. [2019-12-27 20:35:54,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 20:35:54,332 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:35:54,332 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:35:54,332 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:35:54,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:35:54,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1706121534, now seen corresponding path program 2 times [2019-12-27 20:35:54,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:35:54,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833503532] [2019-12-27 20:35:54,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:35:54,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:35:54,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:35:54,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833503532] [2019-12-27 20:35:54,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:35:54,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:35:54,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [816927553] [2019-12-27 20:35:54,401 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:35:54,410 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:35:54,489 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 203 states and 424 transitions. [2019-12-27 20:35:54,489 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:35:54,499 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 20:35:54,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:35:54,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:35:54,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:35:54,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:35:54,501 INFO L87 Difference]: Start difference. First operand 25671 states and 76589 transitions. Second operand 4 states. [2019-12-27 20:35:54,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:35:54,861 INFO L93 Difference]: Finished difference Result 34102 states and 99854 transitions. [2019-12-27 20:35:54,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:35:54,862 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-27 20:35:54,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:35:54,905 INFO L225 Difference]: With dead ends: 34102 [2019-12-27 20:35:54,905 INFO L226 Difference]: Without dead ends: 34102 [2019-12-27 20:35:54,906 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-27 20:35:55,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34102 states. [2019-12-27 20:35:55,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34102 to 25610. [2019-12-27 20:35:55,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25610 states. [2019-12-27 20:35:55,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25610 states to 25610 states and 75578 transitions. [2019-12-27 20:35:55,483 INFO L78 Accepts]: Start accepts. Automaton has 25610 states and 75578 transitions. Word has length 40 [2019-12-27 20:35:55,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:35:55,483 INFO L462 AbstractCegarLoop]: Abstraction has 25610 states and 75578 transitions. [2019-12-27 20:35:55,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:35:55,484 INFO L276 IsEmpty]: Start isEmpty. Operand 25610 states and 75578 transitions. [2019-12-27 20:35:55,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 20:35:55,506 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:35:55,506 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:35:55,506 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:35:55,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:35:55,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1403753262, now seen corresponding path program 1 times [2019-12-27 20:35:55,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:35:55,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627014546] [2019-12-27 20:35:55,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:35:55,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:35:55,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:35:55,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627014546] [2019-12-27 20:35:55,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:35:55,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:35:55,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [22004363] [2019-12-27 20:35:55,558 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:35:55,577 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:35:55,653 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 180 states and 358 transitions. [2019-12-27 20:35:55,653 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:35:55,667 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:35:55,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:35:55,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:35:55,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:35:55,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:35:55,668 INFO L87 Difference]: Start difference. First operand 25610 states and 75578 transitions. Second operand 6 states. [2019-12-27 20:35:55,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:35:55,778 INFO L93 Difference]: Finished difference Result 24156 states and 72223 transitions. [2019-12-27 20:35:55,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:35:55,778 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-27 20:35:55,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:35:55,808 INFO L225 Difference]: With dead ends: 24156 [2019-12-27 20:35:55,809 INFO L226 Difference]: Without dead ends: 22354 [2019-12-27 20:35:55,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:35:55,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22354 states. [2019-12-27 20:35:56,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22354 to 21304. [2019-12-27 20:35:56,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21304 states. [2019-12-27 20:35:56,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21304 states to 21304 states and 65473 transitions. [2019-12-27 20:35:56,123 INFO L78 Accepts]: Start accepts. Automaton has 21304 states and 65473 transitions. Word has length 41 [2019-12-27 20:35:56,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:35:56,123 INFO L462 AbstractCegarLoop]: Abstraction has 21304 states and 65473 transitions. [2019-12-27 20:35:56,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:35:56,124 INFO L276 IsEmpty]: Start isEmpty. Operand 21304 states and 65473 transitions. [2019-12-27 20:35:56,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 20:35:56,143 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:35:56,143 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-27 20:35:56,143 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:35:56,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:35:56,144 INFO L82 PathProgramCache]: Analyzing trace with hash -2084577993, now seen corresponding path program 1 times [2019-12-27 20:35:56,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:35:56,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927246853] [2019-12-27 20:35:56,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:35:56,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:35:56,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:35:56,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927246853] [2019-12-27 20:35:56,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:35:56,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:35:56,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [486093641] [2019-12-27 20:35:56,239 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:35:56,266 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:35:56,645 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 342 states and 700 transitions. [2019-12-27 20:35:56,646 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:35:56,741 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 20:35:56,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 20:35:56,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:35:56,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 20:35:56,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:35:56,742 INFO L87 Difference]: Start difference. First operand 21304 states and 65473 transitions. Second operand 9 states. [2019-12-27 20:35:57,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:35:57,962 INFO L93 Difference]: Finished difference Result 27908 states and 84712 transitions. [2019-12-27 20:35:57,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 20:35:57,962 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 20:35:57,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:35:57,999 INFO L225 Difference]: With dead ends: 27908 [2019-12-27 20:35:57,999 INFO L226 Difference]: Without dead ends: 27908 [2019-12-27 20:35:58,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-12-27 20:35:58,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27908 states. [2019-12-27 20:35:58,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27908 to 22437. [2019-12-27 20:35:58,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22437 states. [2019-12-27 20:35:58,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22437 states to 22437 states and 68885 transitions. [2019-12-27 20:35:58,484 INFO L78 Accepts]: Start accepts. Automaton has 22437 states and 68885 transitions. Word has length 65 [2019-12-27 20:35:58,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:35:58,484 INFO L462 AbstractCegarLoop]: Abstraction has 22437 states and 68885 transitions. [2019-12-27 20:35:58,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 20:35:58,484 INFO L276 IsEmpty]: Start isEmpty. Operand 22437 states and 68885 transitions. [2019-12-27 20:35:58,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 20:35:58,505 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:35:58,505 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-27 20:35:58,505 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:35:58,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:35:58,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1236323897, now seen corresponding path program 2 times [2019-12-27 20:35:58,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:35:58,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610647188] [2019-12-27 20:35:58,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:35:58,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:35:58,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:35:58,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610647188] [2019-12-27 20:35:58,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:35:58,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:35:58,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [388778531] [2019-12-27 20:35:58,572 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:35:58,591 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:35:58,831 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 233 states and 434 transitions. [2019-12-27 20:35:58,831 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:35:58,832 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:35:58,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:35:58,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:35:58,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:35:58,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:35:58,833 INFO L87 Difference]: Start difference. First operand 22437 states and 68885 transitions. Second operand 3 states. [2019-12-27 20:35:58,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:35:58,910 INFO L93 Difference]: Finished difference Result 22436 states and 68883 transitions. [2019-12-27 20:35:58,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:35:58,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 20:35:58,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:35:58,941 INFO L225 Difference]: With dead ends: 22436 [2019-12-27 20:35:58,941 INFO L226 Difference]: Without dead ends: 22436 [2019-12-27 20:35:58,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:35:59,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22436 states. [2019-12-27 20:35:59,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22436 to 19066. [2019-12-27 20:35:59,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19066 states. [2019-12-27 20:35:59,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19066 states to 19066 states and 59289 transitions. [2019-12-27 20:35:59,259 INFO L78 Accepts]: Start accepts. Automaton has 19066 states and 59289 transitions. Word has length 65 [2019-12-27 20:35:59,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:35:59,260 INFO L462 AbstractCegarLoop]: Abstraction has 19066 states and 59289 transitions. [2019-12-27 20:35:59,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:35:59,260 INFO L276 IsEmpty]: Start isEmpty. Operand 19066 states and 59289 transitions. [2019-12-27 20:35:59,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 20:35:59,278 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:35:59,278 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:35:59,278 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-27 20:35:59,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:35:59,279 INFO L82 PathProgramCache]: Analyzing trace with hash -2123111745, now seen corresponding path program 1 times [2019-12-27 20:35:59,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:35:59,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266814862] [2019-12-27 20:35:59,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:35:59,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:35:59,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:35:59,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266814862] [2019-12-27 20:35:59,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:35:59,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 20:35:59,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2146718447] [2019-12-27 20:35:59,392 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:35:59,412 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:35:59,972 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 408 states and 867 transitions. [2019-12-27 20:35:59,972 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:36:00,193 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 25 times. [2019-12-27 20:36:00,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 20:36:00,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:36:00,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 20:36:00,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-12-27 20:36:00,194 INFO L87 Difference]: Start difference. First operand 19066 states and 59289 transitions. Second operand 15 states. [2019-12-27 20:36:05,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:36:05,026 INFO L93 Difference]: Finished difference Result 42480 states and 127539 transitions. [2019-12-27 20:36:05,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-12-27 20:36:05,026 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 66 [2019-12-27 20:36:05,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:36:05,083 INFO L225 Difference]: With dead ends: 42480 [2019-12-27 20:36:05,083 INFO L226 Difference]: Without dead ends: 42480 [2019-12-27 20:36:05,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 39 SyntacticMatches, 6 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 894 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=617, Invalid=2805, Unknown=0, NotChecked=0, Total=3422 [2019-12-27 20:36:05,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42480 states. [2019-12-27 20:36:05,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42480 to 19732. [2019-12-27 20:36:05,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19732 states. [2019-12-27 20:36:05,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19732 states to 19732 states and 61221 transitions. [2019-12-27 20:36:05,547 INFO L78 Accepts]: Start accepts. Automaton has 19732 states and 61221 transitions. Word has length 66 [2019-12-27 20:36:05,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:36:05,547 INFO L462 AbstractCegarLoop]: Abstraction has 19732 states and 61221 transitions. [2019-12-27 20:36:05,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 20:36:05,548 INFO L276 IsEmpty]: Start isEmpty. Operand 19732 states and 61221 transitions. [2019-12-27 20:36:05,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 20:36:05,569 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:36:05,569 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:36:05,569 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-27 20:36:05,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:36:05,569 INFO L82 PathProgramCache]: Analyzing trace with hash -411146043, now seen corresponding path program 2 times [2019-12-27 20:36:05,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:36:05,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408077421] [2019-12-27 20:36:05,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:36:05,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:36:05,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:36:05,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408077421] [2019-12-27 20:36:05,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:36:05,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 20:36:05,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1779837180] [2019-12-27 20:36:05,903 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:36:05,922 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:36:06,162 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 217 states and 395 transitions. [2019-12-27 20:36:06,162 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:36:06,534 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 20:36:06,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 20:36:06,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:36:06,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 20:36:06,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-27 20:36:06,535 INFO L87 Difference]: Start difference. First operand 19732 states and 61221 transitions. Second operand 15 states. [2019-12-27 20:36:09,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:36:09,242 INFO L93 Difference]: Finished difference Result 38243 states and 117817 transitions. [2019-12-27 20:36:09,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 20:36:09,243 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 66 [2019-12-27 20:36:09,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:36:09,280 INFO L225 Difference]: With dead ends: 38243 [2019-12-27 20:36:09,280 INFO L226 Difference]: Without dead ends: 26866 [2019-12-27 20:36:09,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=147, Invalid=665, Unknown=0, NotChecked=0, Total=812 [2019-12-27 20:36:09,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26866 states. [2019-12-27 20:36:09,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26866 to 22006. [2019-12-27 20:36:09,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22006 states. [2019-12-27 20:36:09,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22006 states to 22006 states and 67807 transitions. [2019-12-27 20:36:09,654 INFO L78 Accepts]: Start accepts. Automaton has 22006 states and 67807 transitions. Word has length 66 [2019-12-27 20:36:09,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:36:09,654 INFO L462 AbstractCegarLoop]: Abstraction has 22006 states and 67807 transitions. [2019-12-27 20:36:09,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 20:36:09,654 INFO L276 IsEmpty]: Start isEmpty. Operand 22006 states and 67807 transitions. [2019-12-27 20:36:09,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 20:36:09,678 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:36:09,678 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:36:09,678 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-27 20:36:09,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:36:09,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1459295381, now seen corresponding path program 3 times [2019-12-27 20:36:09,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:36:09,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445435867] [2019-12-27 20:36:09,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:36:09,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:36:10,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:36:10,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445435867] [2019-12-27 20:36:10,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:36:10,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 20:36:10,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [178637477] [2019-12-27 20:36:10,129 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:36:10,144 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:36:10,393 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 210 states and 375 transitions. [2019-12-27 20:36:10,393 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:36:10,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:36:10,930 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 26 times. [2019-12-27 20:36:10,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-27 20:36:10,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:36:10,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-27 20:36:10,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2019-12-27 20:36:10,931 INFO L87 Difference]: Start difference. First operand 22006 states and 67807 transitions. Second operand 23 states. [2019-12-27 20:36:17,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:36:17,456 INFO L93 Difference]: Finished difference Result 33380 states and 101666 transitions. [2019-12-27 20:36:17,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-12-27 20:36:17,457 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 66 [2019-12-27 20:36:17,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:36:17,498 INFO L225 Difference]: With dead ends: 33380 [2019-12-27 20:36:17,499 INFO L226 Difference]: Without dead ends: 29884 [2019-12-27 20:36:17,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 13 SyntacticMatches, 11 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 878 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=500, Invalid=3406, Unknown=0, NotChecked=0, Total=3906 [2019-12-27 20:36:17,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29884 states. [2019-12-27 20:36:17,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29884 to 23914. [2019-12-27 20:36:17,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23914 states. [2019-12-27 20:36:17,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23914 states to 23914 states and 73285 transitions. [2019-12-27 20:36:17,893 INFO L78 Accepts]: Start accepts. Automaton has 23914 states and 73285 transitions. Word has length 66 [2019-12-27 20:36:17,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:36:17,893 INFO L462 AbstractCegarLoop]: Abstraction has 23914 states and 73285 transitions. [2019-12-27 20:36:17,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-27 20:36:17,893 INFO L276 IsEmpty]: Start isEmpty. Operand 23914 states and 73285 transitions. [2019-12-27 20:36:17,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 20:36:17,919 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:36:17,919 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:36:17,919 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-27 20:36:17,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:36:17,919 INFO L82 PathProgramCache]: Analyzing trace with hash 227474065, now seen corresponding path program 4 times [2019-12-27 20:36:17,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:36:17,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868425572] [2019-12-27 20:36:17,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:36:17,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:36:17,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:36:17,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868425572] [2019-12-27 20:36:17,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:36:17,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:36:17,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1186358170] [2019-12-27 20:36:17,997 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:36:18,011 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:36:18,269 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 291 states and 580 transitions. [2019-12-27 20:36:18,270 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:36:18,273 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 20:36:18,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:36:18,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:36:18,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:36:18,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:36:18,274 INFO L87 Difference]: Start difference. First operand 23914 states and 73285 transitions. Second operand 3 states. [2019-12-27 20:36:18,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:36:18,400 INFO L93 Difference]: Finished difference Result 27786 states and 84500 transitions. [2019-12-27 20:36:18,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:36:18,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 20:36:18,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:36:18,436 INFO L225 Difference]: With dead ends: 27786 [2019-12-27 20:36:18,436 INFO L226 Difference]: Without dead ends: 27786 [2019-12-27 20:36:18,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:36:18,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27786 states. [2019-12-27 20:36:18,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27786 to 23593. [2019-12-27 20:36:18,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23593 states. [2019-12-27 20:36:18,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23593 states to 23593 states and 72343 transitions. [2019-12-27 20:36:18,982 INFO L78 Accepts]: Start accepts. Automaton has 23593 states and 72343 transitions. Word has length 66 [2019-12-27 20:36:18,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:36:18,982 INFO L462 AbstractCegarLoop]: Abstraction has 23593 states and 72343 transitions. [2019-12-27 20:36:18,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:36:18,983 INFO L276 IsEmpty]: Start isEmpty. Operand 23593 states and 72343 transitions. [2019-12-27 20:36:19,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:36:19,005 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:36:19,005 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:36:19,006 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-27 20:36:19,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:36:19,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1309527475, now seen corresponding path program 1 times [2019-12-27 20:36:19,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:36:19,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421538931] [2019-12-27 20:36:19,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:36:19,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:36:19,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:36:19,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421538931] [2019-12-27 20:36:19,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:36:19,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 20:36:19,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1868385204] [2019-12-27 20:36:19,358 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:36:19,368 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:36:19,617 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 329 states and 665 transitions. [2019-12-27 20:36:19,618 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:36:19,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:36:20,176 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 33 times. [2019-12-27 20:36:20,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-27 20:36:20,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:36:20,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-27 20:36:20,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2019-12-27 20:36:20,177 INFO L87 Difference]: Start difference. First operand 23593 states and 72343 transitions. Second operand 21 states. [2019-12-27 20:36:25,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:36:25,470 INFO L93 Difference]: Finished difference Result 32925 states and 98450 transitions. [2019-12-27 20:36:25,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-12-27 20:36:25,470 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 67 [2019-12-27 20:36:25,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:36:25,511 INFO L225 Difference]: With dead ends: 32925 [2019-12-27 20:36:25,511 INFO L226 Difference]: Without dead ends: 29810 [2019-12-27 20:36:25,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 12 SyntacticMatches, 18 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 850 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=422, Invalid=3000, Unknown=0, NotChecked=0, Total=3422 [2019-12-27 20:36:25,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29810 states. [2019-12-27 20:36:25,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29810 to 24847. [2019-12-27 20:36:25,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24847 states. [2019-12-27 20:36:26,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24847 states to 24847 states and 75816 transitions. [2019-12-27 20:36:26,042 INFO L78 Accepts]: Start accepts. Automaton has 24847 states and 75816 transitions. Word has length 67 [2019-12-27 20:36:26,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:36:26,042 INFO L462 AbstractCegarLoop]: Abstraction has 24847 states and 75816 transitions. [2019-12-27 20:36:26,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-27 20:36:26,042 INFO L276 IsEmpty]: Start isEmpty. Operand 24847 states and 75816 transitions. [2019-12-27 20:36:26,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:36:26,067 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:36:26,067 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:36:26,067 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-27 20:36:26,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:36:26,067 INFO L82 PathProgramCache]: Analyzing trace with hash 2031700337, now seen corresponding path program 2 times [2019-12-27 20:36:26,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:36:26,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119273737] [2019-12-27 20:36:26,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:36:26,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:36:26,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:36:26,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119273737] [2019-12-27 20:36:26,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:36:26,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 20:36:26,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [546085714] [2019-12-27 20:36:26,412 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:36:26,421 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:36:26,754 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 406 states and 860 transitions. [2019-12-27 20:36:26,754 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:36:27,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 20:36:27,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:36:27,386 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 41 times. [2019-12-27 20:36:27,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 20:36:27,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:36:27,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 20:36:27,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2019-12-27 20:36:27,387 INFO L87 Difference]: Start difference. First operand 24847 states and 75816 transitions. Second operand 22 states. [2019-12-27 20:36:33,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:36:33,255 INFO L93 Difference]: Finished difference Result 47595 states and 140821 transitions. [2019-12-27 20:36:33,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-12-27 20:36:33,256 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 67 [2019-12-27 20:36:33,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:36:33,307 INFO L225 Difference]: With dead ends: 47595 [2019-12-27 20:36:33,307 INFO L226 Difference]: Without dead ends: 39480 [2019-12-27 20:36:33,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 16 SyntacticMatches, 22 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1155 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=545, Invalid=3615, Unknown=0, NotChecked=0, Total=4160 [2019-12-27 20:36:33,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39480 states. [2019-12-27 20:36:33,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39480 to 29148. [2019-12-27 20:36:33,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29148 states. [2019-12-27 20:36:33,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29148 states to 29148 states and 88360 transitions. [2019-12-27 20:36:33,818 INFO L78 Accepts]: Start accepts. Automaton has 29148 states and 88360 transitions. Word has length 67 [2019-12-27 20:36:33,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:36:33,819 INFO L462 AbstractCegarLoop]: Abstraction has 29148 states and 88360 transitions. [2019-12-27 20:36:33,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-27 20:36:33,819 INFO L276 IsEmpty]: Start isEmpty. Operand 29148 states and 88360 transitions. [2019-12-27 20:36:33,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:36:33,852 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:36:33,852 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:36:33,852 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-27 20:36:33,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:36:33,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1973635833, now seen corresponding path program 3 times [2019-12-27 20:36:33,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:36:33,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859283505] [2019-12-27 20:36:33,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:36:33,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:36:33,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:36:33,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859283505] [2019-12-27 20:36:33,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:36:33,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:36:33,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1274409190] [2019-12-27 20:36:33,944 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:36:33,958 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:36:34,382 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 351 states and 712 transitions. [2019-12-27 20:36:34,382 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:36:34,532 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 20:36:34,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 20:36:34,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:36:34,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 20:36:34,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 20:36:34,534 INFO L87 Difference]: Start difference. First operand 29148 states and 88360 transitions. Second operand 10 states. [2019-12-27 20:36:35,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:36:35,603 INFO L93 Difference]: Finished difference Result 66946 states and 201540 transitions. [2019-12-27 20:36:35,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 20:36:35,603 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-27 20:36:35,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:36:35,676 INFO L225 Difference]: With dead ends: 66946 [2019-12-27 20:36:35,676 INFO L226 Difference]: Without dead ends: 51579 [2019-12-27 20:36:35,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 10 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2019-12-27 20:36:35,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51579 states. [2019-12-27 20:36:36,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51579 to 30064. [2019-12-27 20:36:36,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30064 states. [2019-12-27 20:36:36,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30064 states to 30064 states and 90937 transitions. [2019-12-27 20:36:36,554 INFO L78 Accepts]: Start accepts. Automaton has 30064 states and 90937 transitions. Word has length 67 [2019-12-27 20:36:36,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:36:36,555 INFO L462 AbstractCegarLoop]: Abstraction has 30064 states and 90937 transitions. [2019-12-27 20:36:36,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 20:36:36,555 INFO L276 IsEmpty]: Start isEmpty. Operand 30064 states and 90937 transitions. [2019-12-27 20:36:36,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:36:36,591 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:36:36,591 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:36:36,591 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-27 20:36:36,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:36:36,591 INFO L82 PathProgramCache]: Analyzing trace with hash -799581389, now seen corresponding path program 4 times [2019-12-27 20:36:36,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:36:36,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688285530] [2019-12-27 20:36:36,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:36:36,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:36:36,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:36:36,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688285530] [2019-12-27 20:36:36,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:36:36,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 20:36:36,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2012196596] [2019-12-27 20:36:36,919 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:36:36,930 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:36:37,132 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 259 states and 495 transitions. [2019-12-27 20:36:37,132 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:36:37,536 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 24 times. [2019-12-27 20:36:37,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 20:36:37,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:36:37,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 20:36:37,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2019-12-27 20:36:37,537 INFO L87 Difference]: Start difference. First operand 30064 states and 90937 transitions. Second operand 18 states. [2019-12-27 20:36:40,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:36:40,221 INFO L93 Difference]: Finished difference Result 36686 states and 110064 transitions. [2019-12-27 20:36:40,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-27 20:36:40,222 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 67 [2019-12-27 20:36:40,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:36:40,269 INFO L225 Difference]: With dead ends: 36686 [2019-12-27 20:36:40,269 INFO L226 Difference]: Without dead ends: 34084 [2019-12-27 20:36:40,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 11 SyntacticMatches, 13 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=223, Invalid=1337, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 20:36:40,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34084 states. [2019-12-27 20:36:40,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34084 to 31545. [2019-12-27 20:36:40,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31545 states. [2019-12-27 20:36:40,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31545 states to 31545 states and 95324 transitions. [2019-12-27 20:36:40,728 INFO L78 Accepts]: Start accepts. Automaton has 31545 states and 95324 transitions. Word has length 67 [2019-12-27 20:36:40,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:36:40,728 INFO L462 AbstractCegarLoop]: Abstraction has 31545 states and 95324 transitions. [2019-12-27 20:36:40,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 20:36:40,728 INFO L276 IsEmpty]: Start isEmpty. Operand 31545 states and 95324 transitions. [2019-12-27 20:36:40,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:36:40,760 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:36:40,760 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:36:40,760 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-27 20:36:40,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:36:40,760 INFO L82 PathProgramCache]: Analyzing trace with hash -77408527, now seen corresponding path program 5 times [2019-12-27 20:36:40,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:36:40,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631840298] [2019-12-27 20:36:40,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:36:40,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:36:41,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:36:41,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631840298] [2019-12-27 20:36:41,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:36:41,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 20:36:41,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1939791047] [2019-12-27 20:36:41,075 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:36:41,089 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:36:41,528 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 336 states and 690 transitions. [2019-12-27 20:36:41,528 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:36:41,971 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 32 times. [2019-12-27 20:36:41,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 20:36:41,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:36:41,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 20:36:41,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2019-12-27 20:36:41,972 INFO L87 Difference]: Start difference. First operand 31545 states and 95324 transitions. Second operand 19 states. [2019-12-27 20:36:47,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:36:47,009 INFO L93 Difference]: Finished difference Result 54874 states and 163145 transitions. [2019-12-27 20:36:47,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-12-27 20:36:47,010 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2019-12-27 20:36:47,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:36:47,066 INFO L225 Difference]: With dead ends: 54874 [2019-12-27 20:36:47,066 INFO L226 Difference]: Without dead ends: 40654 [2019-12-27 20:36:47,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 15 SyntacticMatches, 16 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1302 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=760, Invalid=4210, Unknown=0, NotChecked=0, Total=4970 [2019-12-27 20:36:47,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40654 states. [2019-12-27 20:36:47,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40654 to 28510. [2019-12-27 20:36:47,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28510 states. [2019-12-27 20:36:47,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28510 states to 28510 states and 86227 transitions. [2019-12-27 20:36:47,569 INFO L78 Accepts]: Start accepts. Automaton has 28510 states and 86227 transitions. Word has length 67 [2019-12-27 20:36:47,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:36:47,569 INFO L462 AbstractCegarLoop]: Abstraction has 28510 states and 86227 transitions. [2019-12-27 20:36:47,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 20:36:47,569 INFO L276 IsEmpty]: Start isEmpty. Operand 28510 states and 86227 transitions. [2019-12-27 20:36:47,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:36:47,598 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:36:47,598 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:36:47,598 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-27 20:36:47,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:36:47,599 INFO L82 PathProgramCache]: Analyzing trace with hash 776047703, now seen corresponding path program 6 times [2019-12-27 20:36:47,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:36:47,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579194343] [2019-12-27 20:36:47,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:36:47,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:36:47,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:36:47,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579194343] [2019-12-27 20:36:47,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:36:47,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 20:36:47,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1686213520] [2019-12-27 20:36:47,903 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:36:47,917 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:36:48,530 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 331 states and 673 transitions. [2019-12-27 20:36:48,530 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:36:48,888 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 28 times. [2019-12-27 20:36:48,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 20:36:48,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:36:48,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 20:36:48,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2019-12-27 20:36:48,889 INFO L87 Difference]: Start difference. First operand 28510 states and 86227 transitions. Second operand 17 states. [2019-12-27 20:36:51,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:36:51,764 INFO L93 Difference]: Finished difference Result 39247 states and 117549 transitions. [2019-12-27 20:36:51,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 20:36:51,765 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-12-27 20:36:51,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:36:51,812 INFO L225 Difference]: With dead ends: 39247 [2019-12-27 20:36:51,812 INFO L226 Difference]: Without dead ends: 34185 [2019-12-27 20:36:51,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 12 SyntacticMatches, 15 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=180, Invalid=812, Unknown=0, NotChecked=0, Total=992 [2019-12-27 20:36:51,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34185 states. [2019-12-27 20:36:52,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34185 to 28234. [2019-12-27 20:36:52,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28234 states. [2019-12-27 20:36:52,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28234 states to 28234 states and 85463 transitions. [2019-12-27 20:36:52,252 INFO L78 Accepts]: Start accepts. Automaton has 28234 states and 85463 transitions. Word has length 67 [2019-12-27 20:36:52,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:36:52,252 INFO L462 AbstractCegarLoop]: Abstraction has 28234 states and 85463 transitions. [2019-12-27 20:36:52,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 20:36:52,252 INFO L276 IsEmpty]: Start isEmpty. Operand 28234 states and 85463 transitions. [2019-12-27 20:36:52,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:36:52,282 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:36:52,282 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:36:52,282 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-27 20:36:52,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:36:52,283 INFO L82 PathProgramCache]: Analyzing trace with hash 2000871715, now seen corresponding path program 7 times [2019-12-27 20:36:52,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:36:52,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182528093] [2019-12-27 20:36:52,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:36:52,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:36:52,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:36:52,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182528093] [2019-12-27 20:36:52,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:36:52,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 20:36:52,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [787872436] [2019-12-27 20:36:52,750 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:36:52,761 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:36:52,962 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 263 states and 491 transitions. [2019-12-27 20:36:52,962 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:36:53,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:36:53,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-27 20:36:53,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:36:53,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:36:53,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:36:53,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:36:54,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:36:54,215 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-12-27 20:36:54,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:36:54,480 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 36 times. [2019-12-27 20:36:54,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-12-27 20:36:54,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:36:54,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-12-27 20:36:54,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=978, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 20:36:54,481 INFO L87 Difference]: Start difference. First operand 28234 states and 85463 transitions. Second operand 34 states. [2019-12-27 20:37:03,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:37:03,541 INFO L93 Difference]: Finished difference Result 51364 states and 152847 transitions. [2019-12-27 20:37:03,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-12-27 20:37:03,542 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 67 [2019-12-27 20:37:03,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:37:03,606 INFO L225 Difference]: With dead ends: 51364 [2019-12-27 20:37:03,606 INFO L226 Difference]: Without dead ends: 47865 [2019-12-27 20:37:03,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 12 SyntacticMatches, 8 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1531 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=664, Invalid=5036, Unknown=0, NotChecked=0, Total=5700 [2019-12-27 20:37:03,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47865 states. [2019-12-27 20:37:04,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47865 to 28054. [2019-12-27 20:37:04,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28054 states. [2019-12-27 20:37:04,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28054 states to 28054 states and 84918 transitions. [2019-12-27 20:37:04,165 INFO L78 Accepts]: Start accepts. Automaton has 28054 states and 84918 transitions. Word has length 67 [2019-12-27 20:37:04,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:37:04,165 INFO L462 AbstractCegarLoop]: Abstraction has 28054 states and 84918 transitions. [2019-12-27 20:37:04,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-12-27 20:37:04,166 INFO L276 IsEmpty]: Start isEmpty. Operand 28054 states and 84918 transitions. [2019-12-27 20:37:04,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:37:04,194 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:37:04,194 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:37:04,194 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-27 20:37:04,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:37:04,195 INFO L82 PathProgramCache]: Analyzing trace with hash 556474099, now seen corresponding path program 8 times [2019-12-27 20:37:04,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:37:04,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418974114] [2019-12-27 20:37:04,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:37:04,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:37:04,382 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 5 [2019-12-27 20:37:04,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:37:04,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418974114] [2019-12-27 20:37:04,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:37:04,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 20:37:04,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1507172342] [2019-12-27 20:37:04,922 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:37:04,936 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:37:05,130 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 245 states and 446 transitions. [2019-12-27 20:37:05,130 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:37:05,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 20:37:05,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:37:05,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-27 20:37:05,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:37:05,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 20:37:05,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:37:05,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:37:05,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:37:05,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-27 20:37:05,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:37:05,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:37:05,939 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-12-27 20:37:05,941 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 26 times. [2019-12-27 20:37:05,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-27 20:37:05,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:37:05,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-27 20:37:05,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=763, Unknown=0, NotChecked=0, Total=870 [2019-12-27 20:37:05,942 INFO L87 Difference]: Start difference. First operand 28054 states and 84918 transitions. Second operand 30 states. [2019-12-27 20:37:14,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:37:14,356 INFO L93 Difference]: Finished difference Result 48654 states and 145905 transitions. [2019-12-27 20:37:14,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-12-27 20:37:14,357 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 67 [2019-12-27 20:37:14,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:37:14,422 INFO L225 Difference]: With dead ends: 48654 [2019-12-27 20:37:14,422 INFO L226 Difference]: Without dead ends: 47783 [2019-12-27 20:37:14,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1333 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=741, Invalid=5111, Unknown=0, NotChecked=0, Total=5852 [2019-12-27 20:37:14,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47783 states. [2019-12-27 20:37:15,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47783 to 28608. [2019-12-27 20:37:15,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28608 states. [2019-12-27 20:37:15,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28608 states to 28608 states and 86446 transitions. [2019-12-27 20:37:15,150 INFO L78 Accepts]: Start accepts. Automaton has 28608 states and 86446 transitions. Word has length 67 [2019-12-27 20:37:15,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:37:15,151 INFO L462 AbstractCegarLoop]: Abstraction has 28608 states and 86446 transitions. [2019-12-27 20:37:15,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-27 20:37:15,151 INFO L276 IsEmpty]: Start isEmpty. Operand 28608 states and 86446 transitions. [2019-12-27 20:37:15,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:37:15,183 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:37:15,183 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:37:15,183 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:37:15,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:37:15,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1278646961, now seen corresponding path program 9 times [2019-12-27 20:37:15,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:37:15,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747800825] [2019-12-27 20:37:15,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:37:15,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:37:15,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:37:15,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747800825] [2019-12-27 20:37:15,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:37:15,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 20:37:15,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1501237207] [2019-12-27 20:37:15,541 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:37:15,550 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:37:15,799 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 316 states and 626 transitions. [2019-12-27 20:37:15,799 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:37:15,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:37:16,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-27 20:37:16,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:37:16,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 20:37:16,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:37:16,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:37:16,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-27 20:37:16,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:37:16,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 20:37:16,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:37:16,642 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 34 times. [2019-12-27 20:37:16,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-27 20:37:16,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:37:16,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-27 20:37:16,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=752, Unknown=0, NotChecked=0, Total=870 [2019-12-27 20:37:16,644 INFO L87 Difference]: Start difference. First operand 28608 states and 86446 transitions. Second operand 30 states. [2019-12-27 20:37:24,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:37:24,250 INFO L93 Difference]: Finished difference Result 55983 states and 166790 transitions. [2019-12-27 20:37:24,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-12-27 20:37:24,250 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 67 [2019-12-27 20:37:24,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:37:24,341 INFO L225 Difference]: With dead ends: 55983 [2019-12-27 20:37:24,342 INFO L226 Difference]: Without dead ends: 53512 [2019-12-27 20:37:24,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 16 SyntacticMatches, 6 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1472 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=815, Invalid=5191, Unknown=0, NotChecked=0, Total=6006 [2019-12-27 20:37:24,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53512 states. [2019-12-27 20:37:24,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53512 to 27348. [2019-12-27 20:37:24,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27348 states. [2019-12-27 20:37:24,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27348 states to 27348 states and 83165 transitions. [2019-12-27 20:37:24,922 INFO L78 Accepts]: Start accepts. Automaton has 27348 states and 83165 transitions. Word has length 67 [2019-12-27 20:37:24,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:37:24,922 INFO L462 AbstractCegarLoop]: Abstraction has 27348 states and 83165 transitions. [2019-12-27 20:37:24,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-27 20:37:24,922 INFO L276 IsEmpty]: Start isEmpty. Operand 27348 states and 83165 transitions. [2019-12-27 20:37:24,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:37:24,951 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:37:24,951 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:37:24,951 INFO L410 AbstractCegarLoop]: === Iteration 40 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:37:24,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:37:24,952 INFO L82 PathProgramCache]: Analyzing trace with hash -185379867, now seen corresponding path program 10 times [2019-12-27 20:37:24,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:37:24,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134100713] [2019-12-27 20:37:24,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:37:24,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:37:25,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:37:25,079 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 20:37:25,079 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 20:37:25,083 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [893] [893] ULTIMATE.startENTRY-->L825: Formula: (let ((.cse0 (store |v_#valid_62| 0 0))) (and (= 0 v_~z$r_buff1_thd2~0_19) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~z$w_buff1~0_25) (= 0 v_~weak$$choice0~0_8) (= 0 v_~z$r_buff1_thd0~0_24) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t660~0.base_21| 4)) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff0_thd0~0_20 0) (= 0 v_~__unbuffered_cnt~0_20) (= |v_#NULL.offset_6| 0) (= 0 v_~z$flush_delayed~0_13) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t660~0.base_21|) (= v_~__unbuffered_p2_EBX~0_16 0) (= 0 v_~z$r_buff1_thd3~0_52) (= 0 v_~z$r_buff1_thd1~0_18) (= v_~x~0_10 0) (< 0 |v_#StackHeapBarrier_15|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t660~0.base_21|)) (= v_~z$read_delayed_var~0.base_6 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t660~0.base_21| 1) |v_#valid_60|) (= 0 v_~z$w_buff1_used~0_73) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t660~0.base_21| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t660~0.base_21|) |v_ULTIMATE.start_main_~#t660~0.offset_16| 0)) |v_#memory_int_19|) (= v_~y~0_15 0) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= v_~z$r_buff0_thd1~0_27 0) (= v_~z$read_delayed~0_7 0) (= v_~z$mem_tmp~0_10 0) (= v_~z$r_buff0_thd3~0_80 0) (= v_~main$tmp_guard1~0_14 0) (= v_~z~0_27 0) (= |v_ULTIMATE.start_main_~#t660~0.offset_16| 0) (= 0 v_~__unbuffered_p0_EAX~0_16) (= 0 v_~z$w_buff0~0_25) (= 0 v_~__unbuffered_p2_EAX~0_14) (= v_~z$r_buff0_thd2~0_21 0) (= v_~z$w_buff0_used~0_116 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t662~0.base=|v_ULTIMATE.start_main_~#t662~0.base_19|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_19, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_9|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_9|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_22|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_20, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ULTIMATE.start_main_~#t660~0.offset=|v_ULTIMATE.start_main_~#t660~0.offset_16|, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~z$mem_tmp~0=v_~z$mem_tmp~0_10, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_18, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_80, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x~0=v_~x~0_10, ULTIMATE.start_main_~#t661~0.offset=|v_ULTIMATE.start_main_~#t661~0.offset_15|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_25, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_11|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_9|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_24, ULTIMATE.start_main_~#t660~0.base=|v_ULTIMATE.start_main_~#t660~0.base_21|, ~y~0=v_~y~0_15, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_21, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_25, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_52, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t662~0.offset=|v_ULTIMATE.start_main_~#t662~0.offset_15|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_27, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_27, ULTIMATE.start_main_~#t661~0.base=|v_ULTIMATE.start_main_~#t661~0.base_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t662~0.base, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t660~0.offset, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t661~0.offset, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t660~0.base, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t662~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ULTIMATE.start_main_~#t661~0.base] because there is no mapped edge [2019-12-27 20:37:25,084 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L4-->L746: Formula: (and (= v_~z$r_buff0_thd0~0_16 v_~z$r_buff1_thd0~0_11) (= v_~z$r_buff0_thd3~0_48 v_~z$r_buff1_thd3~0_33) (= v_~z$r_buff0_thd2~0_15 v_~z$r_buff1_thd2~0_11) (= v_~z$r_buff0_thd1~0_18 1) (not (= 0 v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6)) (= v_~__unbuffered_p0_EAX~0_6 v_~x~0_5) (= v_~z$r_buff0_thd1~0_19 v_~z$r_buff1_thd1~0_11)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_16, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_48, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_19, ~x~0=v_~x~0_5, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_16, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_33, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_11, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_11, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_11, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_48, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_18, ~x~0=v_~x~0_5, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 20:37:25,085 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L825-1-->L827: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t661~0.base_11|)) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t661~0.base_11| 1) |v_#valid_31|) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t661~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t661~0.base_11|) |v_ULTIMATE.start_main_~#t661~0.offset_10| 1))) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t661~0.base_11| 4) |v_#length_15|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t661~0.base_11|) (= |v_ULTIMATE.start_main_~#t661~0.offset_10| 0) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t661~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t661~0.offset=|v_ULTIMATE.start_main_~#t661~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t661~0.base=|v_ULTIMATE.start_main_~#t661~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t661~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t661~0.base] because there is no mapped edge [2019-12-27 20:37:25,087 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [855] [855] L827-1-->L829: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t662~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t662~0.base_12|) |v_ULTIMATE.start_main_~#t662~0.offset_10| 2)) |v_#memory_int_11|) (not (= |v_ULTIMATE.start_main_~#t662~0.base_12| 0)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t662~0.base_12|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t662~0.base_12| 4) |v_#length_13|) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t662~0.base_12|)) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t662~0.base_12| 1)) (= |v_ULTIMATE.start_main_~#t662~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t662~0.offset=|v_ULTIMATE.start_main_~#t662~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t662~0.base=|v_ULTIMATE.start_main_~#t662~0.base_12|, #valid=|v_#valid_29|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t662~0.offset, ULTIMATE.start_main_~#t662~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-27 20:37:25,089 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L766-2-->L766-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork2_#t~ite9_Out-311583057| |P1Thread1of1ForFork2_#t~ite10_Out-311583057|)) (.cse1 (= (mod ~z$w_buff1_used~0_In-311583057 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In-311583057 256)))) (or (and .cse0 (not .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out-311583057| ~z$w_buff1~0_In-311583057) (not .cse2)) (and .cse0 (or .cse1 .cse2) (= |P1Thread1of1ForFork2_#t~ite9_Out-311583057| ~z~0_In-311583057)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-311583057, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-311583057, ~z$w_buff1~0=~z$w_buff1~0_In-311583057, ~z~0=~z~0_In-311583057} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-311583057|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-311583057, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out-311583057|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-311583057, ~z$w_buff1~0=~z$w_buff1~0_In-311583057, ~z~0=~z~0_In-311583057} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 20:37:25,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L792-->L792-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-305149005 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite23_Out-305149005| |P2Thread1of1ForFork0_#t~ite24_Out-305149005|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-305149005 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In-305149005 256)) (and (= (mod ~z$w_buff1_used~0_In-305149005 256) 0) .cse1) (and (= 0 (mod ~z$r_buff1_thd3~0_In-305149005 256)) .cse1))) (= ~z$w_buff1~0_In-305149005 |P2Thread1of1ForFork0_#t~ite23_Out-305149005|)) (and (= |P2Thread1of1ForFork0_#t~ite23_In-305149005| |P2Thread1of1ForFork0_#t~ite23_Out-305149005|) (not .cse0) (= ~z$w_buff1~0_In-305149005 |P2Thread1of1ForFork0_#t~ite24_Out-305149005|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-305149005, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-305149005, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In-305149005|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-305149005, ~z$w_buff1~0=~z$w_buff1~0_In-305149005, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-305149005, ~weak$$choice2~0=~weak$$choice2~0_In-305149005} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-305149005, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out-305149005|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-305149005, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out-305149005|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-305149005, ~z$w_buff1~0=~z$w_buff1~0_In-305149005, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-305149005, ~weak$$choice2~0=~weak$$choice2~0_In-305149005} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-27 20:37:25,093 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L794-->L794-8: Formula: (let ((.cse2 (= |P2Thread1of1ForFork0_#t~ite30_Out244828431| |P2Thread1of1ForFork0_#t~ite29_Out244828431|)) (.cse1 (= (mod ~z$w_buff0_used~0_In244828431 256) 0)) (.cse4 (= 0 (mod ~z$w_buff1_used~0_In244828431 256))) (.cse6 (= (mod ~z$r_buff0_thd3~0_In244828431 256) 0)) (.cse5 (= (mod ~z$r_buff1_thd3~0_In244828431 256) 0)) (.cse0 (= 0 (mod ~weak$$choice2~0_In244828431 256)))) (or (let ((.cse3 (not .cse6))) (and .cse0 (not .cse1) .cse2 (or .cse3 (not .cse4)) (or .cse3 (not .cse5)) (= |P2Thread1of1ForFork0_#t~ite28_Out244828431| |P2Thread1of1ForFork0_#t~ite29_Out244828431|) (= |P2Thread1of1ForFork0_#t~ite28_Out244828431| 0))) (and (= |P2Thread1of1ForFork0_#t~ite28_In244828431| |P2Thread1of1ForFork0_#t~ite28_Out244828431|) (or (and .cse0 .cse2 (= ~z$w_buff1_used~0_In244828431 |P2Thread1of1ForFork0_#t~ite29_Out244828431|) (or .cse1 (and .cse6 .cse4) (and .cse6 .cse5))) (and (= |P2Thread1of1ForFork0_#t~ite29_In244828431| |P2Thread1of1ForFork0_#t~ite29_Out244828431|) (= |P2Thread1of1ForFork0_#t~ite30_Out244828431| ~z$w_buff1_used~0_In244828431) (not .cse0)))))) InVars {P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_In244828431|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In244828431, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In244828431, ~z$w_buff1_used~0=~z$w_buff1_used~0_In244828431, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In244828431, ~weak$$choice2~0=~weak$$choice2~0_In244828431, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In244828431|} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out244828431|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In244828431, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In244828431, ~z$w_buff1_used~0=~z$w_buff1_used~0_In244828431, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In244828431, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out244828431|, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out244828431|, ~weak$$choice2~0=~weak$$choice2~0_In244828431} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 20:37:25,093 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L795-->L796: Formula: (and (= v_~z$r_buff0_thd3~0_57 v_~z$r_buff0_thd3~0_56) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_57, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_8|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_56, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_7|, ~weak$$choice2~0=v_~weak$$choice2~0_20} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 20:37:25,094 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L798-->L802: Formula: (and (= v_~z~0_21 v_~z$mem_tmp~0_5) (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_21} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 20:37:25,095 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L802-2-->L802-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork0_#t~ite39_Out-1575603247| |P2Thread1of1ForFork0_#t~ite38_Out-1575603247|)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1575603247 256))) (.cse1 (= (mod ~z$r_buff1_thd3~0_In-1575603247 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite38_Out-1575603247| ~z$w_buff1~0_In-1575603247) (not .cse1) (not .cse2)) (and .cse0 (= |P2Thread1of1ForFork0_#t~ite38_Out-1575603247| ~z~0_In-1575603247) (or .cse2 .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1575603247, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1575603247, ~z$w_buff1~0=~z$w_buff1~0_In-1575603247, ~z~0=~z~0_In-1575603247} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out-1575603247|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-1575603247|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1575603247, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1575603247, ~z$w_buff1~0=~z$w_buff1~0_In-1575603247, ~z~0=~z~0_In-1575603247} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 20:37:25,096 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L803-->L803-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-342507147 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-342507147 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-342507147 |P2Thread1of1ForFork0_#t~ite40_Out-342507147|)) (and (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out-342507147|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-342507147, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-342507147} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-342507147, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-342507147|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-342507147} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 20:37:25,097 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L804-->L804-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In511786061 256))) (.cse1 (= (mod ~z$r_buff1_thd3~0_In511786061 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In511786061 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd3~0_In511786061 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite41_Out511786061| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite41_Out511786061| ~z$w_buff1_used~0_In511786061) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In511786061, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In511786061, ~z$w_buff1_used~0=~z$w_buff1_used~0_In511786061, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In511786061} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In511786061, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In511786061, ~z$w_buff1_used~0=~z$w_buff1_used~0_In511786061, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In511786061, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out511786061|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 20:37:25,097 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L805-->L805-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1117586418 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1117586418 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out-1117586418|)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out-1117586418| ~z$r_buff0_thd3~0_In-1117586418) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1117586418, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1117586418} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1117586418, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1117586418, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-1117586418|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 20:37:25,098 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L806-->L806-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In-1544142985 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd3~0_In-1544142985 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1544142985 256))) (.cse0 (= (mod ~z$r_buff1_thd3~0_In-1544142985 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In-1544142985 |P2Thread1of1ForFork0_#t~ite43_Out-1544142985|) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork0_#t~ite43_Out-1544142985| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1544142985, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1544142985, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1544142985, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1544142985} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-1544142985|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1544142985, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1544142985, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1544142985, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1544142985} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 20:37:25,098 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L806-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~z$r_buff1_thd3~0_47 |v_P2Thread1of1ForFork0_#t~ite43_8|) (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_47, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 20:37:25,099 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L747-->L747-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In-52592568 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-52592568 256) 0))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork1_#t~ite5_Out-52592568| 0)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork1_#t~ite5_Out-52592568| ~z$w_buff0_used~0_In-52592568)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-52592568, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-52592568} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-52592568|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-52592568, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-52592568} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 20:37:25,099 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L748-->L748-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd1~0_In348207494 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In348207494 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In348207494 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In348207494 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite6_Out348207494| 0)) (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In348207494 |P0Thread1of1ForFork1_#t~ite6_Out348207494|) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In348207494, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In348207494, ~z$w_buff1_used~0=~z$w_buff1_used~0_In348207494, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In348207494} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In348207494, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out348207494|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In348207494, ~z$w_buff1_used~0=~z$w_buff1_used~0_In348207494, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In348207494} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 20:37:25,100 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L749-->L750: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In336969440 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In336969440 256) 0))) (or (and (= 0 ~z$r_buff0_thd1~0_Out336969440) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd1~0_In336969440 ~z$r_buff0_thd1~0_Out336969440) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In336969440, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In336969440} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In336969440, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out336969440|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out336969440} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 20:37:25,100 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L750-->L750-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd1~0_In-890459935 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-890459935 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In-890459935 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-890459935 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out-890459935| ~z$r_buff1_thd1~0_In-890459935) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite8_Out-890459935| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-890459935, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-890459935, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-890459935, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-890459935} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-890459935|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-890459935, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-890459935, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-890459935, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-890459935} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 20:37:25,100 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L750-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_13 |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|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_13, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 20:37:25,101 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L767-->L767-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In-1699601099 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1699601099 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite11_Out-1699601099| 0) (not .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite11_Out-1699601099| ~z$w_buff0_used~0_In-1699601099) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1699601099, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1699601099} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1699601099, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-1699601099|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1699601099} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 20:37:25,101 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L768-->L768-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd2~0_In-1874813449 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-1874813449 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-1874813449 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd2~0_In-1874813449 256) 0))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite12_Out-1874813449|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite12_Out-1874813449| ~z$w_buff1_used~0_In-1874813449) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1874813449, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1874813449, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1874813449, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1874813449} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1874813449, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1874813449, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1874813449, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1874813449|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1874813449} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 20:37:25,102 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L769-->L769-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In34353392 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd2~0_In34353392 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite13_Out34353392| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd2~0_In34353392 |P1Thread1of1ForFork2_#t~ite13_Out34353392|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In34353392, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In34353392} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In34353392, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out34353392|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In34353392} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 20:37:25,103 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L770-->L770-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In539115753 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In539115753 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In539115753 256))) (.cse1 (= (mod ~z$r_buff1_thd2~0_In539115753 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd2~0_In539115753 |P1Thread1of1ForFork2_#t~ite14_Out539115753|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork2_#t~ite14_Out539115753|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In539115753, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In539115753, ~z$w_buff1_used~0=~z$w_buff1_used~0_In539115753, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In539115753} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In539115753, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In539115753, ~z$w_buff1_used~0=~z$w_buff1_used~0_In539115753, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out539115753|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In539115753} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 20:37:25,103 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L770-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite14_8| v_~z$r_buff1_thd2~0_15) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_7|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 20:37:25,103 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L829-1-->L835: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_4 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_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 20:37:25,104 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L835-2-->L835-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-415066752 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-415066752 256)))) (or (and (not .cse0) (= ~z$w_buff1~0_In-415066752 |ULTIMATE.start_main_#t~ite47_Out-415066752|) (not .cse1)) (and (= ~z~0_In-415066752 |ULTIMATE.start_main_#t~ite47_Out-415066752|) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-415066752, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-415066752, ~z$w_buff1~0=~z$w_buff1~0_In-415066752, ~z~0=~z~0_In-415066752} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-415066752, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-415066752|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-415066752, ~z$w_buff1~0=~z$w_buff1~0_In-415066752, ~z~0=~z~0_In-415066752} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 20:37:25,104 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L835-4-->L836: Formula: (= v_~z~0_20 |v_ULTIMATE.start_main_#t~ite47_7|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_7|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|, ~z~0=v_~z~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48, ~z~0] because there is no mapped edge [2019-12-27 20:37:25,104 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L836-->L836-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-320790815 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-320790815 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite49_Out-320790815| 0)) (and (= |ULTIMATE.start_main_#t~ite49_Out-320790815| ~z$w_buff0_used~0_In-320790815) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-320790815, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-320790815} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-320790815, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-320790815, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-320790815|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 20:37:25,105 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L837-->L837-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In1354054074 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In1354054074 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1354054074 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In1354054074 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite50_Out1354054074|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~z$w_buff1_used~0_In1354054074 |ULTIMATE.start_main_#t~ite50_Out1354054074|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1354054074, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1354054074, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1354054074, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1354054074} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1354054074|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1354054074, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1354054074, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1354054074, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1354054074} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 20:37:25,106 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L838-->L838-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1171494852 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1171494852 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite51_Out1171494852| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite51_Out1171494852| ~z$r_buff0_thd0~0_In1171494852) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1171494852, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1171494852} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1171494852, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1171494852|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1171494852} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 20:37:25,106 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L839-->L839-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In114371051 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In114371051 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In114371051 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In114371051 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In114371051 |ULTIMATE.start_main_#t~ite52_Out114371051|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out114371051|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In114371051, ~z$w_buff0_used~0=~z$w_buff0_used~0_In114371051, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In114371051, ~z$w_buff1_used~0=~z$w_buff1_used~0_In114371051} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out114371051|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In114371051, ~z$w_buff0_used~0=~z$w_buff0_used~0_In114371051, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In114371051, ~z$w_buff1_used~0=~z$w_buff1_used~0_In114371051} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 20:37:25,107 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L839-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_7 2) (= v_~__unbuffered_p0_EAX~0_9 0) (= |v_ULTIMATE.start_main_#t~ite52_10| v_~z$r_buff1_thd0~0_16) (= v_~__unbuffered_p2_EBX~0_9 0) (= 2 v_~y~0_8) (= v_~main$tmp_guard1~0_6 0) (= (mod v_~main$tmp_guard1~0_6 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_10|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~y~0=v_~y~0_8} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_9|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~y~0=v_~y~0_8, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 20:37:25,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:37:25 BasicIcfg [2019-12-27 20:37:25,223 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 20:37:25,225 INFO L168 Benchmark]: Toolchain (without parser) took 196458.45 ms. Allocated memory was 136.3 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 99.5 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-27 20:37:25,225 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 136.3 MB. Free memory was 119.5 MB in the beginning and 119.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 20:37:25,226 INFO L168 Benchmark]: CACSL2BoogieTranslator took 797.24 ms. Allocated memory was 136.3 MB in the beginning and 201.3 MB in the end (delta: 65.0 MB). Free memory was 99.1 MB in the beginning and 155.0 MB in the end (delta: -55.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. [2019-12-27 20:37:25,226 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.95 ms. Allocated memory is still 201.3 MB. Free memory was 155.0 MB in the beginning and 152.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 20:37:25,226 INFO L168 Benchmark]: Boogie Preprocessor took 44.03 ms. Allocated memory is still 201.3 MB. Free memory was 152.3 MB in the beginning and 149.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 20:37:25,228 INFO L168 Benchmark]: RCFGBuilder took 818.55 ms. Allocated memory is still 201.3 MB. Free memory was 149.4 MB in the beginning and 99.4 MB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 7.1 GB. [2019-12-27 20:37:25,228 INFO L168 Benchmark]: TraceAbstraction took 194731.08 ms. Allocated memory was 201.3 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 99.4 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-27 20:37:25,230 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 136.3 MB. Free memory was 119.5 MB in the beginning and 119.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 797.24 ms. Allocated memory was 136.3 MB in the beginning and 201.3 MB in the end (delta: 65.0 MB). Free memory was 99.1 MB in the beginning and 155.0 MB in the end (delta: -55.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.95 ms. Allocated memory is still 201.3 MB. Free memory was 155.0 MB in the beginning and 152.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.03 ms. Allocated memory is still 201.3 MB. Free memory was 152.3 MB in the beginning and 149.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 818.55 ms. Allocated memory is still 201.3 MB. Free memory was 149.4 MB in the beginning and 99.4 MB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 194731.08 ms. Allocated memory was 201.3 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 99.4 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 176 ProgramPointsBefore, 94 ProgramPointsAfterwards, 213 TransitionsBefore, 104 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 31 ChoiceCompositions, 6462 VarBasedMoverChecksPositive, 197 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 84223 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L825] FCALL, FORK 0 pthread_create(&t660, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] 1 z$w_buff1 = z$w_buff0 [L732] 1 z$w_buff0 = 1 [L733] 1 z$w_buff1_used = z$w_buff0_used [L734] 1 z$w_buff0_used = (_Bool)1 [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L827] FCALL, FORK 0 pthread_create(&t661, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 x = 1 [L763] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L829] FCALL, FORK 0 pthread_create(&t662, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 2 [L783] 3 __unbuffered_p2_EAX = y [L786] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L787] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L788] 3 z$flush_delayed = weak$$choice2 [L789] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=1, y=2, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=1, y=2, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L766] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L791] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=2, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L792] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L793] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=2, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L794] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L796] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L797] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=1, y=2, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L803] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L804] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L805] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L746] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L747] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L748] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L767] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L768] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L769] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L835] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L837] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L838] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 194.3s, OverallIterations: 40, TraceHistogramMax: 1, AutomataDifference: 100.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 10420 SDtfs, 18336 SDslu, 53538 SDs, 0 SdLazy, 63596 SolverSat, 1630 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 55.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1356 GetRequests, 259 SyntacticMatches, 173 SemanticMatches, 924 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11389 ImplicationChecksByTransitivity, 28.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162546occurred 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: 46.6s AutomataMinimizationTime, 39 MinimizatonAttempts, 487047 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 1724 NumberOfCodeBlocks, 1724 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1618 ConstructedInterpolants, 0 QuantifiedInterpolants, 547452 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 39 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...