/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix025_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 16:27:03,452 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 16:27:03,455 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 16:27:03,467 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 16:27:03,467 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 16:27:03,468 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 16:27:03,470 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 16:27:03,472 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 16:27:03,473 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 16:27:03,474 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 16:27:03,475 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 16:27:03,476 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 16:27:03,477 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 16:27:03,478 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 16:27:03,479 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 16:27:03,480 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 16:27:03,481 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 16:27:03,481 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 16:27:03,483 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 16:27:03,486 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 16:27:03,487 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 16:27:03,488 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 16:27:03,490 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 16:27:03,491 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 16:27:03,493 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 16:27:03,497 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 16:27:03,497 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 16:27:03,498 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 16:27:03,499 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 16:27:03,500 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 16:27:03,500 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 16:27:03,504 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 16:27:03,505 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 16:27:03,506 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 16:27:03,509 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 16:27:03,509 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 16:27:03,510 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 16:27:03,510 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 16:27:03,510 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 16:27:03,511 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 16:27:03,514 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 16:27:03,515 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 16:27:03,540 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 16:27:03,541 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 16:27:03,542 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 16:27:03,542 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 16:27:03,542 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 16:27:03,543 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 16:27:03,543 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 16:27:03,543 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 16:27:03,543 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 16:27:03,543 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 16:27:03,544 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 16:27:03,544 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 16:27:03,545 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 16:27:03,545 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 16:27:03,545 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 16:27:03,545 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 16:27:03,545 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 16:27:03,546 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 16:27:03,546 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 16:27:03,546 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 16:27:03,546 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 16:27:03,546 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:27:03,547 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 16:27:03,548 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 16:27:03,548 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 16:27:03,548 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 16:27:03,548 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 16:27:03,548 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 16:27:03,549 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 16:27:03,549 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 16:27:03,549 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 16:27:03,854 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 16:27:03,865 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 16:27:03,869 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 16:27:03,871 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 16:27:03,871 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 16:27:03,872 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix025_tso.opt.i [2019-12-27 16:27:03,951 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48974c63c/342fb68be33b48ebada3d2d2965eb80d/FLAGf0e26e690 [2019-12-27 16:27:04,595 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 16:27:04,596 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix025_tso.opt.i [2019-12-27 16:27:04,627 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48974c63c/342fb68be33b48ebada3d2d2965eb80d/FLAGf0e26e690 [2019-12-27 16:27:04,786 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48974c63c/342fb68be33b48ebada3d2d2965eb80d [2019-12-27 16:27:04,800 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 16:27:04,802 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 16:27:04,805 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 16:27:04,805 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 16:27:04,809 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 16:27:04,810 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:27:04" (1/1) ... [2019-12-27 16:27:04,813 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c9a81ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:27:04, skipping insertion in model container [2019-12-27 16:27:04,814 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:27:04" (1/1) ... [2019-12-27 16:27:04,822 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 16:27:04,893 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 16:27:05,397 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:27:05,420 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 16:27:05,527 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:27:05,601 INFO L208 MainTranslator]: Completed translation [2019-12-27 16:27:05,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:27:05 WrapperNode [2019-12-27 16:27:05,601 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 16:27:05,602 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 16:27:05,602 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 16:27:05,602 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 16:27:05,609 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:27:05" (1/1) ... [2019-12-27 16:27:05,630 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:27:05" (1/1) ... [2019-12-27 16:27:05,666 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 16:27:05,666 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 16:27:05,667 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 16:27:05,667 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 16:27:05,676 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:27:05" (1/1) ... [2019-12-27 16:27:05,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:27:05" (1/1) ... [2019-12-27 16:27:05,683 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:27:05" (1/1) ... [2019-12-27 16:27:05,683 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:27:05" (1/1) ... [2019-12-27 16:27:05,695 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:27:05" (1/1) ... [2019-12-27 16:27:05,702 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:27:05" (1/1) ... [2019-12-27 16:27:05,708 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:27:05" (1/1) ... [2019-12-27 16:27:05,713 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 16:27:05,714 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 16:27:05,714 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 16:27:05,714 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 16:27:05,715 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:27:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:27:05,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 16:27:05,770 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 16:27:05,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 16:27:05,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 16:27:05,770 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 16:27:05,770 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 16:27:05,771 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 16:27:05,771 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 16:27:05,771 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 16:27:05,771 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 16:27:05,771 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 16:27:05,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 16:27:05,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 16:27:05,774 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 16:27:06,539 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 16:27:06,539 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 16:27:06,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:27:06 BoogieIcfgContainer [2019-12-27 16:27:06,541 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 16:27:06,542 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 16:27:06,543 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 16:27:06,546 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 16:27:06,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:27:04" (1/3) ... [2019-12-27 16:27:06,547 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29583368 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:27:06, skipping insertion in model container [2019-12-27 16:27:06,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:27:05" (2/3) ... [2019-12-27 16:27:06,548 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29583368 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:27:06, skipping insertion in model container [2019-12-27 16:27:06,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:27:06" (3/3) ... [2019-12-27 16:27:06,550 INFO L109 eAbstractionObserver]: Analyzing ICFG mix025_tso.opt.i [2019-12-27 16:27:06,561 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 16:27:06,561 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 16:27:06,569 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 16:27:06,570 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 16:27:06,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,613 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,614 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,614 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,615 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,615 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,642 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,643 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,650 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,651 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,677 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,679 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,679 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,679 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,679 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,679 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,681 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,691 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,691 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,691 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,693 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,693 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:27:06,712 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 16:27:06,736 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 16:27:06,736 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 16:27:06,736 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 16:27:06,736 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 16:27:06,736 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 16:27:06,737 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 16:27:06,737 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 16:27:06,737 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 16:27:06,756 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-27 16:27:06,759 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 16:27:06,898 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 16:27:06,898 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:27:06,918 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 16:27:06,942 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 16:27:06,997 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 16:27:06,998 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:27:07,007 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 16:27:07,029 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 16:27:07,030 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 16:27:12,136 WARN L192 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 16:27:12,254 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 16:27:12,519 INFO L206 etLargeBlockEncoding]: Checked pairs total: 130103 [2019-12-27 16:27:12,519 INFO L214 etLargeBlockEncoding]: Total number of compositions: 120 [2019-12-27 16:27:12,523 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 105 transitions [2019-12-27 16:27:33,629 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 122102 states. [2019-12-27 16:27:33,631 INFO L276 IsEmpty]: Start isEmpty. Operand 122102 states. [2019-12-27 16:27:33,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 16:27:33,636 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:27:33,637 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 16:27:33,637 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:27:33,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:27:33,643 INFO L82 PathProgramCache]: Analyzing trace with hash 913940, now seen corresponding path program 1 times [2019-12-27 16:27:33,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:27:33,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205362765] [2019-12-27 16:27:33,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:27:33,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:27:33,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:27:33,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205362765] [2019-12-27 16:27:33,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:27:33,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:27:33,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1418005316] [2019-12-27 16:27:33,891 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:27:33,895 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:27:33,904 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 16:27:33,905 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:27:33,908 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:27:33,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:27:33,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:27:33,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:27:33,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:27:33,926 INFO L87 Difference]: Start difference. First operand 122102 states. Second operand 3 states. [2019-12-27 16:27:38,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:27:38,435 INFO L93 Difference]: Finished difference Result 121140 states and 517588 transitions. [2019-12-27 16:27:38,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:27:38,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 16:27:38,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:27:39,291 INFO L225 Difference]: With dead ends: 121140 [2019-12-27 16:27:39,291 INFO L226 Difference]: Without dead ends: 107958 [2019-12-27 16:27:39,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:27:43,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107958 states. [2019-12-27 16:27:46,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107958 to 107958. [2019-12-27 16:27:46,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107958 states. [2019-12-27 16:27:46,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107958 states to 107958 states and 460128 transitions. [2019-12-27 16:27:46,991 INFO L78 Accepts]: Start accepts. Automaton has 107958 states and 460128 transitions. Word has length 3 [2019-12-27 16:27:46,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:27:46,992 INFO L462 AbstractCegarLoop]: Abstraction has 107958 states and 460128 transitions. [2019-12-27 16:27:46,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:27:46,992 INFO L276 IsEmpty]: Start isEmpty. Operand 107958 states and 460128 transitions. [2019-12-27 16:27:46,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 16:27:46,996 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:27:46,996 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:27:46,997 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:27:46,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:27:46,997 INFO L82 PathProgramCache]: Analyzing trace with hash 2082409598, now seen corresponding path program 1 times [2019-12-27 16:27:46,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:27:46,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290179407] [2019-12-27 16:27:46,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:27:47,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:27:47,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:27:47,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290179407] [2019-12-27 16:27:47,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:27:47,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:27:47,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1263898296] [2019-12-27 16:27:47,085 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:27:47,087 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:27:47,090 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 16:27:47,090 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:27:47,091 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:27:47,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:27:47,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:27:47,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:27:47,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:27:47,093 INFO L87 Difference]: Start difference. First operand 107958 states and 460128 transitions. Second operand 4 states. [2019-12-27 16:27:52,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:27:52,456 INFO L93 Difference]: Finished difference Result 172022 states and 703369 transitions. [2019-12-27 16:27:52,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:27:52,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 16:27:52,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:27:53,061 INFO L225 Difference]: With dead ends: 172022 [2019-12-27 16:27:53,061 INFO L226 Difference]: Without dead ends: 171924 [2019-12-27 16:27:53,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:27:58,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171924 states. [2019-12-27 16:28:04,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171924 to 156115. [2019-12-27 16:28:04,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156115 states. [2019-12-27 16:28:05,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156115 states to 156115 states and 647087 transitions. [2019-12-27 16:28:05,494 INFO L78 Accepts]: Start accepts. Automaton has 156115 states and 647087 transitions. Word has length 11 [2019-12-27 16:28:05,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:28:05,494 INFO L462 AbstractCegarLoop]: Abstraction has 156115 states and 647087 transitions. [2019-12-27 16:28:05,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:28:05,494 INFO L276 IsEmpty]: Start isEmpty. Operand 156115 states and 647087 transitions. [2019-12-27 16:28:05,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 16:28:05,500 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:28:05,500 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:28:05,500 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:28:05,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:28:05,501 INFO L82 PathProgramCache]: Analyzing trace with hash 594088235, now seen corresponding path program 1 times [2019-12-27 16:28:05,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:28:05,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594896579] [2019-12-27 16:28:05,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:28:05,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:28:05,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:28:05,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594896579] [2019-12-27 16:28:05,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:28:05,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:28:05,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [327101355] [2019-12-27 16:28:05,592 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:28:05,596 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:28:05,601 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 16:28:05,602 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:28:05,602 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:28:05,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:28:05,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:28:05,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:28:05,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:28:05,605 INFO L87 Difference]: Start difference. First operand 156115 states and 647087 transitions. Second operand 3 states. [2019-12-27 16:28:05,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:28:05,755 INFO L93 Difference]: Finished difference Result 33388 states and 108650 transitions. [2019-12-27 16:28:05,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:28:05,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 16:28:05,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:28:05,823 INFO L225 Difference]: With dead ends: 33388 [2019-12-27 16:28:05,823 INFO L226 Difference]: Without dead ends: 33388 [2019-12-27 16:28:05,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:28:10,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33388 states. [2019-12-27 16:28:11,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33388 to 33388. [2019-12-27 16:28:11,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33388 states. [2019-12-27 16:28:11,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33388 states to 33388 states and 108650 transitions. [2019-12-27 16:28:11,182 INFO L78 Accepts]: Start accepts. Automaton has 33388 states and 108650 transitions. Word has length 13 [2019-12-27 16:28:11,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:28:11,182 INFO L462 AbstractCegarLoop]: Abstraction has 33388 states and 108650 transitions. [2019-12-27 16:28:11,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:28:11,183 INFO L276 IsEmpty]: Start isEmpty. Operand 33388 states and 108650 transitions. [2019-12-27 16:28:11,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 16:28:11,186 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:28:11,186 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:28:11,186 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:28:11,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:28:11,187 INFO L82 PathProgramCache]: Analyzing trace with hash -805978823, now seen corresponding path program 1 times [2019-12-27 16:28:11,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:28:11,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755707456] [2019-12-27 16:28:11,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:28:11,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:28:11,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 16:28:11,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755707456] [2019-12-27 16:28:11,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:28:11,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:28:11,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [220882258] [2019-12-27 16:28:11,261 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:28:11,263 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:28:11,265 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 16:28:11,265 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:28:11,265 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:28:11,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:28:11,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:28:11,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:28:11,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:28:11,266 INFO L87 Difference]: Start difference. First operand 33388 states and 108650 transitions. Second operand 3 states. [2019-12-27 16:28:11,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:28:11,487 INFO L93 Difference]: Finished difference Result 52822 states and 170897 transitions. [2019-12-27 16:28:11,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:28:11,488 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 16:28:11,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:28:11,597 INFO L225 Difference]: With dead ends: 52822 [2019-12-27 16:28:11,597 INFO L226 Difference]: Without dead ends: 52822 [2019-12-27 16:28:11,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:28:11,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52822 states. [2019-12-27 16:28:12,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52822 to 39094. [2019-12-27 16:28:12,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39094 states. [2019-12-27 16:28:12,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39094 states to 39094 states and 127496 transitions. [2019-12-27 16:28:12,404 INFO L78 Accepts]: Start accepts. Automaton has 39094 states and 127496 transitions. Word has length 16 [2019-12-27 16:28:12,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:28:12,405 INFO L462 AbstractCegarLoop]: Abstraction has 39094 states and 127496 transitions. [2019-12-27 16:28:12,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:28:12,405 INFO L276 IsEmpty]: Start isEmpty. Operand 39094 states and 127496 transitions. [2019-12-27 16:28:12,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 16:28:12,408 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:28:12,408 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:28:12,409 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:28:12,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:28:12,409 INFO L82 PathProgramCache]: Analyzing trace with hash -805853304, now seen corresponding path program 1 times [2019-12-27 16:28:12,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:28:12,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518155985] [2019-12-27 16:28:12,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:28:12,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:28:12,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:28:12,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518155985] [2019-12-27 16:28:12,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:28:12,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:28:12,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [804199982] [2019-12-27 16:28:12,524 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:28:12,526 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:28:12,529 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 16:28:12,529 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:28:12,529 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:28:12,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:28:12,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:28:12,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:28:12,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:28:12,530 INFO L87 Difference]: Start difference. First operand 39094 states and 127496 transitions. Second operand 4 states. [2019-12-27 16:28:12,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:28:12,922 INFO L93 Difference]: Finished difference Result 46903 states and 150848 transitions. [2019-12-27 16:28:12,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:28:12,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 16:28:12,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:28:12,999 INFO L225 Difference]: With dead ends: 46903 [2019-12-27 16:28:12,999 INFO L226 Difference]: Without dead ends: 46903 [2019-12-27 16:28:13,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:28:13,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46903 states. [2019-12-27 16:28:14,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46903 to 42953. [2019-12-27 16:28:14,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42953 states. [2019-12-27 16:28:14,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42953 states to 42953 states and 139113 transitions. [2019-12-27 16:28:14,217 INFO L78 Accepts]: Start accepts. Automaton has 42953 states and 139113 transitions. Word has length 16 [2019-12-27 16:28:14,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:28:14,217 INFO L462 AbstractCegarLoop]: Abstraction has 42953 states and 139113 transitions. [2019-12-27 16:28:14,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:28:14,217 INFO L276 IsEmpty]: Start isEmpty. Operand 42953 states and 139113 transitions. [2019-12-27 16:28:14,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 16:28:14,221 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:28:14,221 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:28:14,221 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:28:14,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:28:14,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1222928522, now seen corresponding path program 1 times [2019-12-27 16:28:14,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:28:14,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188381767] [2019-12-27 16:28:14,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:28:14,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:28:14,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:28:14,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188381767] [2019-12-27 16:28:14,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:28:14,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:28:14,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1989888430] [2019-12-27 16:28:14,280 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:28:14,282 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:28:14,284 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 16:28:14,285 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:28:14,285 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:28:14,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:28:14,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:28:14,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:28:14,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:28:14,286 INFO L87 Difference]: Start difference. First operand 42953 states and 139113 transitions. Second operand 4 states. [2019-12-27 16:28:14,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:28:14,667 INFO L93 Difference]: Finished difference Result 51478 states and 165621 transitions. [2019-12-27 16:28:14,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:28:14,670 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 16:28:14,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:28:14,791 INFO L225 Difference]: With dead ends: 51478 [2019-12-27 16:28:14,791 INFO L226 Difference]: Without dead ends: 51478 [2019-12-27 16:28:14,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:28:15,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51478 states. [2019-12-27 16:28:15,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51478 to 44383. [2019-12-27 16:28:15,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44383 states. [2019-12-27 16:28:15,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44383 states to 44383 states and 143934 transitions. [2019-12-27 16:28:15,690 INFO L78 Accepts]: Start accepts. Automaton has 44383 states and 143934 transitions. Word has length 16 [2019-12-27 16:28:15,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:28:15,690 INFO L462 AbstractCegarLoop]: Abstraction has 44383 states and 143934 transitions. [2019-12-27 16:28:15,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:28:15,691 INFO L276 IsEmpty]: Start isEmpty. Operand 44383 states and 143934 transitions. [2019-12-27 16:28:15,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 16:28:15,700 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:28:15,700 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:28:15,700 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:28:15,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:28:15,700 INFO L82 PathProgramCache]: Analyzing trace with hash -655013944, now seen corresponding path program 1 times [2019-12-27 16:28:15,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:28:15,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635292711] [2019-12-27 16:28:15,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:28:15,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:28:15,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:28:15,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635292711] [2019-12-27 16:28:15,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:28:15,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:28:15,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [124053926] [2019-12-27 16:28:15,831 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:28:15,835 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:28:15,845 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 72 transitions. [2019-12-27 16:28:15,845 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:28:15,848 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:28:15,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:28:15,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:28:15,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:28:15,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:28:15,849 INFO L87 Difference]: Start difference. First operand 44383 states and 143934 transitions. Second operand 6 states. [2019-12-27 16:28:17,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:28:17,030 INFO L93 Difference]: Finished difference Result 61274 states and 194553 transitions. [2019-12-27 16:28:17,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 16:28:17,030 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 16:28:17,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:28:17,136 INFO L225 Difference]: With dead ends: 61274 [2019-12-27 16:28:17,136 INFO L226 Difference]: Without dead ends: 61260 [2019-12-27 16:28:17,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-27 16:28:17,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61260 states. [2019-12-27 16:28:17,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61260 to 45714. [2019-12-27 16:28:17,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45714 states. [2019-12-27 16:28:17,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45714 states to 45714 states and 148005 transitions. [2019-12-27 16:28:17,988 INFO L78 Accepts]: Start accepts. Automaton has 45714 states and 148005 transitions. Word has length 22 [2019-12-27 16:28:17,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:28:17,988 INFO L462 AbstractCegarLoop]: Abstraction has 45714 states and 148005 transitions. [2019-12-27 16:28:17,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:28:17,988 INFO L276 IsEmpty]: Start isEmpty. Operand 45714 states and 148005 transitions. [2019-12-27 16:28:17,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 16:28:17,997 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:28:17,997 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:28:17,998 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:28:17,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:28:17,998 INFO L82 PathProgramCache]: Analyzing trace with hash -2032339914, now seen corresponding path program 1 times [2019-12-27 16:28:17,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:28:17,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802834864] [2019-12-27 16:28:17,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:28:18,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:28:18,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:28:18,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802834864] [2019-12-27 16:28:18,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:28:18,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:28:18,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1831552760] [2019-12-27 16:28:18,058 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:28:18,061 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:28:18,070 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 72 transitions. [2019-12-27 16:28:18,070 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:28:18,071 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:28:18,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:28:18,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:28:18,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:28:18,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:28:18,072 INFO L87 Difference]: Start difference. First operand 45714 states and 148005 transitions. Second operand 5 states. [2019-12-27 16:28:18,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:28:18,811 INFO L93 Difference]: Finished difference Result 64138 states and 202903 transitions. [2019-12-27 16:28:18,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 16:28:18,811 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 16:28:18,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:28:18,946 INFO L225 Difference]: With dead ends: 64138 [2019-12-27 16:28:18,947 INFO L226 Difference]: Without dead ends: 64124 [2019-12-27 16:28:18,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:28:19,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64124 states. [2019-12-27 16:28:20,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64124 to 44294. [2019-12-27 16:28:20,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44294 states. [2019-12-27 16:28:20,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44294 states to 44294 states and 143524 transitions. [2019-12-27 16:28:20,430 INFO L78 Accepts]: Start accepts. Automaton has 44294 states and 143524 transitions. Word has length 22 [2019-12-27 16:28:20,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:28:20,430 INFO L462 AbstractCegarLoop]: Abstraction has 44294 states and 143524 transitions. [2019-12-27 16:28:20,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:28:20,431 INFO L276 IsEmpty]: Start isEmpty. Operand 44294 states and 143524 transitions. [2019-12-27 16:28:20,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 16:28:20,442 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:28:20,443 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:28:20,443 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:28:20,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:28:20,443 INFO L82 PathProgramCache]: Analyzing trace with hash -701847110, now seen corresponding path program 1 times [2019-12-27 16:28:20,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:28:20,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035657906] [2019-12-27 16:28:20,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:28:20,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:28:20,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:28:20,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035657906] [2019-12-27 16:28:20,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:28:20,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:28:20,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1477928787] [2019-12-27 16:28:20,487 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:28:20,491 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:28:20,502 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 16:28:20,502 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:28:20,538 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:28:20,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:28:20,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:28:20,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:28:20,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:28:20,539 INFO L87 Difference]: Start difference. First operand 44294 states and 143524 transitions. Second operand 5 states. [2019-12-27 16:28:20,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:28:20,627 INFO L93 Difference]: Finished difference Result 17338 states and 53060 transitions. [2019-12-27 16:28:20,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:28:20,627 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 16:28:20,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:28:20,654 INFO L225 Difference]: With dead ends: 17338 [2019-12-27 16:28:20,654 INFO L226 Difference]: Without dead ends: 17338 [2019-12-27 16:28:20,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:28:20,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17338 states. [2019-12-27 16:28:20,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17338 to 16975. [2019-12-27 16:28:20,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16975 states. [2019-12-27 16:28:20,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16975 states to 16975 states and 52024 transitions. [2019-12-27 16:28:20,901 INFO L78 Accepts]: Start accepts. Automaton has 16975 states and 52024 transitions. Word has length 25 [2019-12-27 16:28:20,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:28:20,902 INFO L462 AbstractCegarLoop]: Abstraction has 16975 states and 52024 transitions. [2019-12-27 16:28:20,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:28:20,902 INFO L276 IsEmpty]: Start isEmpty. Operand 16975 states and 52024 transitions. [2019-12-27 16:28:20,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 16:28:20,914 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:28:20,914 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 16:28:20,914 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:28:20,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:28:20,914 INFO L82 PathProgramCache]: Analyzing trace with hash 987898618, now seen corresponding path program 1 times [2019-12-27 16:28:20,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:28:20,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226670219] [2019-12-27 16:28:20,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:28:20,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:28:21,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:28:21,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226670219] [2019-12-27 16:28:21,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:28:21,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:28:21,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1191478324] [2019-12-27 16:28:21,078 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:28:21,083 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:28:21,101 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 59 states and 90 transitions. [2019-12-27 16:28:21,101 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:28:21,241 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 16:28:21,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 16:28:21,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:28:21,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 16:28:21,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:28:21,243 INFO L87 Difference]: Start difference. First operand 16975 states and 52024 transitions. Second operand 9 states. [2019-12-27 16:28:22,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:28:22,886 INFO L93 Difference]: Finished difference Result 43054 states and 129571 transitions. [2019-12-27 16:28:22,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 16:28:22,886 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2019-12-27 16:28:22,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:28:22,960 INFO L225 Difference]: With dead ends: 43054 [2019-12-27 16:28:22,961 INFO L226 Difference]: Without dead ends: 43054 [2019-12-27 16:28:22,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-12-27 16:28:23,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43054 states. [2019-12-27 16:28:23,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43054 to 18618. [2019-12-27 16:28:23,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18618 states. [2019-12-27 16:28:23,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18618 states to 18618 states and 57592 transitions. [2019-12-27 16:28:23,387 INFO L78 Accepts]: Start accepts. Automaton has 18618 states and 57592 transitions. Word has length 26 [2019-12-27 16:28:23,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:28:23,388 INFO L462 AbstractCegarLoop]: Abstraction has 18618 states and 57592 transitions. [2019-12-27 16:28:23,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 16:28:23,388 INFO L276 IsEmpty]: Start isEmpty. Operand 18618 states and 57592 transitions. [2019-12-27 16:28:23,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 16:28:23,402 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:28:23,402 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 16:28:23,402 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:28:23,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:28:23,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1083173402, now seen corresponding path program 1 times [2019-12-27 16:28:23,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:28:23,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844610716] [2019-12-27 16:28:23,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:28:23,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:28:23,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:28:23,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844610716] [2019-12-27 16:28:23,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:28:23,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:28:23,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1482903412] [2019-12-27 16:28:23,475 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:28:23,478 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:28:23,484 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 27 states and 26 transitions. [2019-12-27 16:28:23,485 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:28:23,485 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:28:23,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:28:23,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:28:23,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:28:23,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:28:23,486 INFO L87 Difference]: Start difference. First operand 18618 states and 57592 transitions. Second operand 5 states. [2019-12-27 16:28:23,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:28:23,819 INFO L93 Difference]: Finished difference Result 23822 states and 72344 transitions. [2019-12-27 16:28:23,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:28:23,819 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 16:28:23,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:28:23,853 INFO L225 Difference]: With dead ends: 23822 [2019-12-27 16:28:23,853 INFO L226 Difference]: Without dead ends: 23822 [2019-12-27 16:28:23,853 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 16:28:23,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23822 states. [2019-12-27 16:28:24,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23822 to 22356. [2019-12-27 16:28:24,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22356 states. [2019-12-27 16:28:24,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22356 states to 22356 states and 68638 transitions. [2019-12-27 16:28:24,187 INFO L78 Accepts]: Start accepts. Automaton has 22356 states and 68638 transitions. Word has length 26 [2019-12-27 16:28:24,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:28:24,188 INFO L462 AbstractCegarLoop]: Abstraction has 22356 states and 68638 transitions. [2019-12-27 16:28:24,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:28:24,188 INFO L276 IsEmpty]: Start isEmpty. Operand 22356 states and 68638 transitions. [2019-12-27 16:28:24,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 16:28:24,207 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:28:24,207 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:28:24,207 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:28:24,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:28:24,208 INFO L82 PathProgramCache]: Analyzing trace with hash -799804073, now seen corresponding path program 1 times [2019-12-27 16:28:24,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:28:24,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293064032] [2019-12-27 16:28:24,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:28:24,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:28:24,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:28:24,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293064032] [2019-12-27 16:28:24,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:28:24,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:28:24,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [303512051] [2019-12-27 16:28:24,531 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:28:24,536 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:28:24,543 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 29 states and 28 transitions. [2019-12-27 16:28:24,543 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:28:24,544 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:28:24,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:28:24,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:28:24,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:28:24,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:28:24,546 INFO L87 Difference]: Start difference. First operand 22356 states and 68638 transitions. Second operand 5 states. [2019-12-27 16:28:24,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:28:24,968 INFO L93 Difference]: Finished difference Result 25959 states and 78461 transitions. [2019-12-27 16:28:24,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:28:24,968 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 16:28:24,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:28:25,007 INFO L225 Difference]: With dead ends: 25959 [2019-12-27 16:28:25,007 INFO L226 Difference]: Without dead ends: 25959 [2019-12-27 16:28:25,007 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 16:28:25,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25959 states. [2019-12-27 16:28:25,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25959 to 21331. [2019-12-27 16:28:25,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21331 states. [2019-12-27 16:28:25,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21331 states to 21331 states and 65521 transitions. [2019-12-27 16:28:25,349 INFO L78 Accepts]: Start accepts. Automaton has 21331 states and 65521 transitions. Word has length 28 [2019-12-27 16:28:25,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:28:25,349 INFO L462 AbstractCegarLoop]: Abstraction has 21331 states and 65521 transitions. [2019-12-27 16:28:25,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:28:25,350 INFO L276 IsEmpty]: Start isEmpty. Operand 21331 states and 65521 transitions. [2019-12-27 16:28:25,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 16:28:25,373 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:28:25,374 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:28:25,374 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:28:25,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:28:25,374 INFO L82 PathProgramCache]: Analyzing trace with hash -145847770, now seen corresponding path program 1 times [2019-12-27 16:28:25,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:28:25,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948983313] [2019-12-27 16:28:25,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:28:25,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:28:25,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:28:25,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948983313] [2019-12-27 16:28:25,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:28:25,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:28:25,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1724877958] [2019-12-27 16:28:25,474 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:28:25,481 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:28:25,499 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 61 states and 88 transitions. [2019-12-27 16:28:25,499 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:28:25,500 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:28:25,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:28:25,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:28:25,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:28:25,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:28:25,501 INFO L87 Difference]: Start difference. First operand 21331 states and 65521 transitions. Second operand 6 states. [2019-12-27 16:28:26,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:28:26,234 INFO L93 Difference]: Finished difference Result 30406 states and 91010 transitions. [2019-12-27 16:28:26,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 16:28:26,234 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-27 16:28:26,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:28:26,279 INFO L225 Difference]: With dead ends: 30406 [2019-12-27 16:28:26,279 INFO L226 Difference]: Without dead ends: 30406 [2019-12-27 16:28:26,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 16:28:26,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30406 states. [2019-12-27 16:28:26,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30406 to 23182. [2019-12-27 16:28:26,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23182 states. [2019-12-27 16:28:26,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23182 states to 23182 states and 70921 transitions. [2019-12-27 16:28:26,684 INFO L78 Accepts]: Start accepts. Automaton has 23182 states and 70921 transitions. Word has length 32 [2019-12-27 16:28:26,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:28:26,685 INFO L462 AbstractCegarLoop]: Abstraction has 23182 states and 70921 transitions. [2019-12-27 16:28:26,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:28:26,685 INFO L276 IsEmpty]: Start isEmpty. Operand 23182 states and 70921 transitions. [2019-12-27 16:28:26,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 16:28:26,709 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:28:26,709 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:28:26,709 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:28:26,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:28:26,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1380765993, now seen corresponding path program 1 times [2019-12-27 16:28:26,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:28:26,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009271935] [2019-12-27 16:28:26,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:28:26,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:28:26,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:28:26,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009271935] [2019-12-27 16:28:26,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:28:26,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:28:26,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [750388589] [2019-12-27 16:28:26,799 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:28:26,806 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:28:26,831 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 65 states and 94 transitions. [2019-12-27 16:28:26,831 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:28:26,832 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:28:26,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:28:26,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:28:26,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:28:26,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:28:26,833 INFO L87 Difference]: Start difference. First operand 23182 states and 70921 transitions. Second operand 6 states. [2019-12-27 16:28:27,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:28:27,474 INFO L93 Difference]: Finished difference Result 31090 states and 93185 transitions. [2019-12-27 16:28:27,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 16:28:27,475 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-27 16:28:27,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:28:27,520 INFO L225 Difference]: With dead ends: 31090 [2019-12-27 16:28:27,520 INFO L226 Difference]: Without dead ends: 31090 [2019-12-27 16:28:27,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 16:28:27,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31090 states. [2019-12-27 16:28:27,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31090 to 21825. [2019-12-27 16:28:27,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21825 states. [2019-12-27 16:28:27,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21825 states to 21825 states and 66855 transitions. [2019-12-27 16:28:27,896 INFO L78 Accepts]: Start accepts. Automaton has 21825 states and 66855 transitions. Word has length 34 [2019-12-27 16:28:27,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:28:27,896 INFO L462 AbstractCegarLoop]: Abstraction has 21825 states and 66855 transitions. [2019-12-27 16:28:27,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:28:27,897 INFO L276 IsEmpty]: Start isEmpty. Operand 21825 states and 66855 transitions. [2019-12-27 16:28:27,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 16:28:27,920 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:28:27,920 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:28:27,920 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:28:27,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:28:27,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1372962452, now seen corresponding path program 1 times [2019-12-27 16:28:27,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:28:27,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868159811] [2019-12-27 16:28:27,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:28:27,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:28:27,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:28:27,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868159811] [2019-12-27 16:28:27,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:28:27,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:28:27,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1062138901] [2019-12-27 16:28:27,984 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:28:27,993 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:28:28,307 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 196 states and 411 transitions. [2019-12-27 16:28:28,308 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:28:28,310 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:28:28,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:28:28,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:28:28,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:28:28,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:28:28,311 INFO L87 Difference]: Start difference. First operand 21825 states and 66855 transitions. Second operand 3 states. [2019-12-27 16:28:28,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:28:28,406 INFO L93 Difference]: Finished difference Result 21824 states and 66853 transitions. [2019-12-27 16:28:28,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:28:28,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 16:28:28,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:28:28,437 INFO L225 Difference]: With dead ends: 21824 [2019-12-27 16:28:28,437 INFO L226 Difference]: Without dead ends: 21824 [2019-12-27 16:28:28,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:28:28,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21824 states. [2019-12-27 16:28:28,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21824 to 21824. [2019-12-27 16:28:28,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21824 states. [2019-12-27 16:28:28,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21824 states to 21824 states and 66853 transitions. [2019-12-27 16:28:28,749 INFO L78 Accepts]: Start accepts. Automaton has 21824 states and 66853 transitions. Word has length 39 [2019-12-27 16:28:28,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:28:28,750 INFO L462 AbstractCegarLoop]: Abstraction has 21824 states and 66853 transitions. [2019-12-27 16:28:28,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:28:28,750 INFO L276 IsEmpty]: Start isEmpty. Operand 21824 states and 66853 transitions. [2019-12-27 16:28:28,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 16:28:28,780 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:28:28,781 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:28:28,781 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:28:28,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:28:28,781 INFO L82 PathProgramCache]: Analyzing trace with hash -2062304393, now seen corresponding path program 1 times [2019-12-27 16:28:28,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:28:28,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023782128] [2019-12-27 16:28:28,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:28:28,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:28:28,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:28:28,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023782128] [2019-12-27 16:28:28,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:28:28,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:28:28,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1330168990] [2019-12-27 16:28:28,863 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:28:28,871 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:28:28,964 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 223 states and 475 transitions. [2019-12-27 16:28:28,964 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:28:29,008 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 16:28:29,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:28:29,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:28:29,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:28:29,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:28:29,010 INFO L87 Difference]: Start difference. First operand 21824 states and 66853 transitions. Second operand 7 states. [2019-12-27 16:28:29,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:28:29,927 INFO L93 Difference]: Finished difference Result 30711 states and 93132 transitions. [2019-12-27 16:28:29,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 16:28:29,927 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-27 16:28:29,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:28:29,971 INFO L225 Difference]: With dead ends: 30711 [2019-12-27 16:28:29,972 INFO L226 Difference]: Without dead ends: 30711 [2019-12-27 16:28:29,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:28:30,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30711 states. [2019-12-27 16:28:30,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30711 to 28075. [2019-12-27 16:28:30,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28075 states. [2019-12-27 16:28:30,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28075 states to 28075 states and 85865 transitions. [2019-12-27 16:28:30,395 INFO L78 Accepts]: Start accepts. Automaton has 28075 states and 85865 transitions. Word has length 40 [2019-12-27 16:28:30,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:28:30,395 INFO L462 AbstractCegarLoop]: Abstraction has 28075 states and 85865 transitions. [2019-12-27 16:28:30,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:28:30,395 INFO L276 IsEmpty]: Start isEmpty. Operand 28075 states and 85865 transitions. [2019-12-27 16:28:30,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 16:28:30,434 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:28:30,435 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:28:30,435 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:28:30,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:28:30,435 INFO L82 PathProgramCache]: Analyzing trace with hash -950700709, now seen corresponding path program 2 times [2019-12-27 16:28:30,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:28:30,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141143283] [2019-12-27 16:28:30,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:28:30,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:28:30,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:28:30,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141143283] [2019-12-27 16:28:30,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:28:30,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:28:30,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1873112791] [2019-12-27 16:28:30,498 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:28:30,506 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:28:30,581 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 203 states and 424 transitions. [2019-12-27 16:28:30,581 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:28:30,636 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 16:28:30,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:28:30,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:28:30,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:28:30,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:28:30,637 INFO L87 Difference]: Start difference. First operand 28075 states and 85865 transitions. Second operand 7 states. [2019-12-27 16:28:30,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:28:30,758 INFO L93 Difference]: Finished difference Result 26652 states and 82541 transitions. [2019-12-27 16:28:30,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:28:30,759 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-27 16:28:30,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:28:30,797 INFO L225 Difference]: With dead ends: 26652 [2019-12-27 16:28:30,798 INFO L226 Difference]: Without dead ends: 26652 [2019-12-27 16:28:30,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:28:30,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26652 states. [2019-12-27 16:28:31,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26652 to 25230. [2019-12-27 16:28:31,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25230 states. [2019-12-27 16:28:31,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25230 states to 25230 states and 78659 transitions. [2019-12-27 16:28:31,585 INFO L78 Accepts]: Start accepts. Automaton has 25230 states and 78659 transitions. Word has length 40 [2019-12-27 16:28:31,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:28:31,585 INFO L462 AbstractCegarLoop]: Abstraction has 25230 states and 78659 transitions. [2019-12-27 16:28:31,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:28:31,585 INFO L276 IsEmpty]: Start isEmpty. Operand 25230 states and 78659 transitions. [2019-12-27 16:28:31,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 16:28:31,611 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:28:31,611 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:28:31,612 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:28:31,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:28:31,612 INFO L82 PathProgramCache]: Analyzing trace with hash 20161267, now seen corresponding path program 1 times [2019-12-27 16:28:31,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:28:31,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667912040] [2019-12-27 16:28:31,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:28:31,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:28:31,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:28:31,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667912040] [2019-12-27 16:28:31,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:28:31,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:28:31,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1320491241] [2019-12-27 16:28:31,741 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:28:31,765 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:28:31,977 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 262 states and 476 transitions. [2019-12-27 16:28:31,977 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:28:31,988 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 16:28:31,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:28:31,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:28:31,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:28:31,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:28:31,989 INFO L87 Difference]: Start difference. First operand 25230 states and 78659 transitions. Second operand 7 states. [2019-12-27 16:28:32,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:28:32,581 INFO L93 Difference]: Finished difference Result 71709 states and 221840 transitions. [2019-12-27 16:28:32,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 16:28:32,582 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-27 16:28:32,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:28:32,667 INFO L225 Difference]: With dead ends: 71709 [2019-12-27 16:28:32,667 INFO L226 Difference]: Without dead ends: 54885 [2019-12-27 16:28:32,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-27 16:28:32,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54885 states. [2019-12-27 16:28:33,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54885 to 29473. [2019-12-27 16:28:33,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29473 states. [2019-12-27 16:28:33,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29473 states to 29473 states and 92353 transitions. [2019-12-27 16:28:33,296 INFO L78 Accepts]: Start accepts. Automaton has 29473 states and 92353 transitions. Word has length 63 [2019-12-27 16:28:33,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:28:33,296 INFO L462 AbstractCegarLoop]: Abstraction has 29473 states and 92353 transitions. [2019-12-27 16:28:33,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:28:33,296 INFO L276 IsEmpty]: Start isEmpty. Operand 29473 states and 92353 transitions. [2019-12-27 16:28:33,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 16:28:33,327 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:28:33,327 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:28:33,327 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:28:33,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:28:33,328 INFO L82 PathProgramCache]: Analyzing trace with hash 618170621, now seen corresponding path program 2 times [2019-12-27 16:28:33,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:28:33,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639248550] [2019-12-27 16:28:33,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:28:33,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:28:33,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:28:33,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639248550] [2019-12-27 16:28:33,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:28:33,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:28:33,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1326498470] [2019-12-27 16:28:33,418 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:28:33,438 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:28:34,262 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 297 states and 553 transitions. [2019-12-27 16:28:34,262 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:28:34,370 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 16:28:34,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 16:28:34,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:28:34,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 16:28:34,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:28:34,372 INFO L87 Difference]: Start difference. First operand 29473 states and 92353 transitions. Second operand 9 states. [2019-12-27 16:28:36,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:28:36,648 INFO L93 Difference]: Finished difference Result 90278 states and 279021 transitions. [2019-12-27 16:28:36,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 16:28:36,648 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2019-12-27 16:28:36,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:28:36,756 INFO L225 Difference]: With dead ends: 90278 [2019-12-27 16:28:36,756 INFO L226 Difference]: Without dead ends: 67664 [2019-12-27 16:28:36,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2019-12-27 16:28:36,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67664 states. [2019-12-27 16:28:37,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67664 to 33599. [2019-12-27 16:28:37,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33599 states. [2019-12-27 16:28:37,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33599 states to 33599 states and 104861 transitions. [2019-12-27 16:28:37,560 INFO L78 Accepts]: Start accepts. Automaton has 33599 states and 104861 transitions. Word has length 63 [2019-12-27 16:28:37,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:28:37,560 INFO L462 AbstractCegarLoop]: Abstraction has 33599 states and 104861 transitions. [2019-12-27 16:28:37,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 16:28:37,560 INFO L276 IsEmpty]: Start isEmpty. Operand 33599 states and 104861 transitions. [2019-12-27 16:28:37,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 16:28:37,604 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:28:37,604 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:28:37,604 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:28:37,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:28:37,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1826673419, now seen corresponding path program 3 times [2019-12-27 16:28:37,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:28:37,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703251229] [2019-12-27 16:28:37,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:28:37,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:28:37,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:28:37,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703251229] [2019-12-27 16:28:37,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:28:37,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:28:37,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [945296338] [2019-12-27 16:28:37,702 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:28:37,721 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:28:37,962 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 216 states and 398 transitions. [2019-12-27 16:28:37,962 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:28:38,014 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 16:28:38,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 16:28:38,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:28:38,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 16:28:38,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:28:38,016 INFO L87 Difference]: Start difference. First operand 33599 states and 104861 transitions. Second operand 8 states. [2019-12-27 16:28:40,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:28:40,041 INFO L93 Difference]: Finished difference Result 93921 states and 286113 transitions. [2019-12-27 16:28:40,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 16:28:40,042 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-27 16:28:40,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:28:40,168 INFO L225 Difference]: With dead ends: 93921 [2019-12-27 16:28:40,168 INFO L226 Difference]: Without dead ends: 82515 [2019-12-27 16:28:40,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2019-12-27 16:28:40,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82515 states. [2019-12-27 16:28:41,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82515 to 33907. [2019-12-27 16:28:41,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33907 states. [2019-12-27 16:28:41,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33907 states to 33907 states and 105812 transitions. [2019-12-27 16:28:41,074 INFO L78 Accepts]: Start accepts. Automaton has 33907 states and 105812 transitions. Word has length 63 [2019-12-27 16:28:41,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:28:41,074 INFO L462 AbstractCegarLoop]: Abstraction has 33907 states and 105812 transitions. [2019-12-27 16:28:41,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 16:28:41,075 INFO L276 IsEmpty]: Start isEmpty. Operand 33907 states and 105812 transitions. [2019-12-27 16:28:41,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 16:28:41,113 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:28:41,113 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:28:41,113 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:28:41,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:28:41,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1896779851, now seen corresponding path program 4 times [2019-12-27 16:28:41,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:28:41,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780050202] [2019-12-27 16:28:41,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:28:41,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:28:41,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:28:41,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780050202] [2019-12-27 16:28:41,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:28:41,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 16:28:41,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1440945872] [2019-12-27 16:28:41,225 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:28:41,243 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:28:41,547 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 235 states and 403 transitions. [2019-12-27 16:28:41,547 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:28:41,633 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 16:28:41,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:28:41,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:28:41,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:28:41,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:28:41,634 INFO L87 Difference]: Start difference. First operand 33907 states and 105812 transitions. Second operand 7 states. [2019-12-27 16:28:42,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:28:42,742 INFO L93 Difference]: Finished difference Result 43275 states and 132538 transitions. [2019-12-27 16:28:42,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 16:28:42,742 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-27 16:28:42,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:28:42,806 INFO L225 Difference]: With dead ends: 43275 [2019-12-27 16:28:42,807 INFO L226 Difference]: Without dead ends: 43051 [2019-12-27 16:28:42,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 20 SyntacticMatches, 8 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2019-12-27 16:28:42,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43051 states. [2019-12-27 16:28:43,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43051 to 36821. [2019-12-27 16:28:43,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36821 states. [2019-12-27 16:28:43,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36821 states to 36821 states and 114489 transitions. [2019-12-27 16:28:43,799 INFO L78 Accepts]: Start accepts. Automaton has 36821 states and 114489 transitions. Word has length 63 [2019-12-27 16:28:43,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:28:43,799 INFO L462 AbstractCegarLoop]: Abstraction has 36821 states and 114489 transitions. [2019-12-27 16:28:43,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:28:43,799 INFO L276 IsEmpty]: Start isEmpty. Operand 36821 states and 114489 transitions. [2019-12-27 16:28:43,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 16:28:43,848 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:28:43,848 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:28:43,848 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:28:43,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:28:43,848 INFO L82 PathProgramCache]: Analyzing trace with hash 232911163, now seen corresponding path program 5 times [2019-12-27 16:28:43,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:28:43,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398473455] [2019-12-27 16:28:43,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:28:43,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:28:43,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:28:43,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398473455] [2019-12-27 16:28:43,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:28:43,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:28:43,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [503032540] [2019-12-27 16:28:43,915 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:28:43,933 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:28:44,105 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 220 states and 357 transitions. [2019-12-27 16:28:44,105 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:28:44,106 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:28:44,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:28:44,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:28:44,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:28:44,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:28:44,107 INFO L87 Difference]: Start difference. First operand 36821 states and 114489 transitions. Second operand 3 states. [2019-12-27 16:28:44,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:28:44,226 INFO L93 Difference]: Finished difference Result 36820 states and 114487 transitions. [2019-12-27 16:28:44,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:28:44,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-12-27 16:28:44,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:28:44,282 INFO L225 Difference]: With dead ends: 36820 [2019-12-27 16:28:44,282 INFO L226 Difference]: Without dead ends: 36820 [2019-12-27 16:28:44,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:28:44,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36820 states. [2019-12-27 16:28:44,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36820 to 30678. [2019-12-27 16:28:44,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30678 states. [2019-12-27 16:28:44,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30678 states to 30678 states and 96940 transitions. [2019-12-27 16:28:44,814 INFO L78 Accepts]: Start accepts. Automaton has 30678 states and 96940 transitions. Word has length 63 [2019-12-27 16:28:44,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:28:44,814 INFO L462 AbstractCegarLoop]: Abstraction has 30678 states and 96940 transitions. [2019-12-27 16:28:44,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:28:44,814 INFO L276 IsEmpty]: Start isEmpty. Operand 30678 states and 96940 transitions. [2019-12-27 16:28:44,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 16:28:44,849 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:28:44,850 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:28:44,850 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:28:44,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:28:44,850 INFO L82 PathProgramCache]: Analyzing trace with hash 2010713375, now seen corresponding path program 1 times [2019-12-27 16:28:44,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:28:44,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230661822] [2019-12-27 16:28:44,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:28:44,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:28:44,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:28:44,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230661822] [2019-12-27 16:28:44,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:28:44,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:28:44,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1794551170] [2019-12-27 16:28:44,927 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:28:44,945 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:28:45,235 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 212 states and 341 transitions. [2019-12-27 16:28:45,235 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:28:45,249 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:28:45,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:28:45,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:28:45,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:28:45,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:28:45,250 INFO L87 Difference]: Start difference. First operand 30678 states and 96940 transitions. Second operand 4 states. [2019-12-27 16:28:45,556 WARN L192 SmtUtils]: Spent 300.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-12-27 16:28:45,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:28:45,887 INFO L93 Difference]: Finished difference Result 34776 states and 107200 transitions. [2019-12-27 16:28:45,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:28:45,887 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-12-27 16:28:45,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:28:45,939 INFO L225 Difference]: With dead ends: 34776 [2019-12-27 16:28:45,939 INFO L226 Difference]: Without dead ends: 34776 [2019-12-27 16:28:45,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:28:46,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34776 states. [2019-12-27 16:28:46,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34776 to 23273. [2019-12-27 16:28:46,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23273 states. [2019-12-27 16:28:46,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23273 states to 23273 states and 71895 transitions. [2019-12-27 16:28:46,362 INFO L78 Accepts]: Start accepts. Automaton has 23273 states and 71895 transitions. Word has length 64 [2019-12-27 16:28:46,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:28:46,362 INFO L462 AbstractCegarLoop]: Abstraction has 23273 states and 71895 transitions. [2019-12-27 16:28:46,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:28:46,362 INFO L276 IsEmpty]: Start isEmpty. Operand 23273 states and 71895 transitions. [2019-12-27 16:28:46,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:28:46,391 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:28:46,391 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 16:28:46,391 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:28:46,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:28:46,392 INFO L82 PathProgramCache]: Analyzing trace with hash -668679299, now seen corresponding path program 1 times [2019-12-27 16:28:46,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:28:46,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039613758] [2019-12-27 16:28:46,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:28:46,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:28:46,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:28:46,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039613758] [2019-12-27 16:28:46,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:28:46,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:28:46,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1755542393] [2019-12-27 16:28:46,486 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:28:46,506 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:28:46,776 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 323 states and 654 transitions. [2019-12-27 16:28:46,777 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:28:46,828 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 16:28:46,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 16:28:46,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:28:46,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 16:28:46,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:28:46,830 INFO L87 Difference]: Start difference. First operand 23273 states and 71895 transitions. Second operand 8 states. [2019-12-27 16:28:47,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:28:47,940 INFO L93 Difference]: Finished difference Result 31443 states and 95690 transitions. [2019-12-27 16:28:47,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 16:28:47,940 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 16:28:47,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:28:47,986 INFO L225 Difference]: With dead ends: 31443 [2019-12-27 16:28:47,986 INFO L226 Difference]: Without dead ends: 31443 [2019-12-27 16:28:47,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-12-27 16:28:48,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31443 states. [2019-12-27 16:28:48,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31443 to 24351. [2019-12-27 16:28:48,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24351 states. [2019-12-27 16:28:48,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24351 states to 24351 states and 75078 transitions. [2019-12-27 16:28:48,408 INFO L78 Accepts]: Start accepts. Automaton has 24351 states and 75078 transitions. Word has length 65 [2019-12-27 16:28:48,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:28:48,408 INFO L462 AbstractCegarLoop]: Abstraction has 24351 states and 75078 transitions. [2019-12-27 16:28:48,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 16:28:48,408 INFO L276 IsEmpty]: Start isEmpty. Operand 24351 states and 75078 transitions. [2019-12-27 16:28:48,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:28:48,435 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:28:48,435 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:28:48,435 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:28:48,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:28:48,435 INFO L82 PathProgramCache]: Analyzing trace with hash 339295601, now seen corresponding path program 2 times [2019-12-27 16:28:48,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:28:48,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594844540] [2019-12-27 16:28:48,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:28:48,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:28:48,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:28:48,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594844540] [2019-12-27 16:28:48,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:28:48,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 16:28:48,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1360813237] [2019-12-27 16:28:48,531 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:28:48,555 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:28:49,237 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 392 states and 829 transitions. [2019-12-27 16:28:49,238 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:28:49,348 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 16:28:49,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 16:28:49,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:28:49,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 16:28:49,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-27 16:28:49,350 INFO L87 Difference]: Start difference. First operand 24351 states and 75078 transitions. Second operand 11 states. [2019-12-27 16:28:52,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:28:52,423 INFO L93 Difference]: Finished difference Result 45364 states and 135995 transitions. [2019-12-27 16:28:52,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-27 16:28:52,423 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-27 16:28:52,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:28:52,492 INFO L225 Difference]: With dead ends: 45364 [2019-12-27 16:28:52,492 INFO L226 Difference]: Without dead ends: 45148 [2019-12-27 16:28:52,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 32 SyntacticMatches, 6 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=240, Invalid=1020, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 16:28:52,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45148 states. [2019-12-27 16:28:52,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45148 to 23119. [2019-12-27 16:28:52,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23119 states. [2019-12-27 16:28:52,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23119 states to 23119 states and 71238 transitions. [2019-12-27 16:28:52,994 INFO L78 Accepts]: Start accepts. Automaton has 23119 states and 71238 transitions. Word has length 65 [2019-12-27 16:28:52,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:28:52,994 INFO L462 AbstractCegarLoop]: Abstraction has 23119 states and 71238 transitions. [2019-12-27 16:28:52,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 16:28:52,995 INFO L276 IsEmpty]: Start isEmpty. Operand 23119 states and 71238 transitions. [2019-12-27 16:28:53,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:28:53,018 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:28:53,019 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 16:28:53,019 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:28:53,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:28:53,019 INFO L82 PathProgramCache]: Analyzing trace with hash 903189921, now seen corresponding path program 3 times [2019-12-27 16:28:53,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:28:53,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108594471] [2019-12-27 16:28:53,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:28:53,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:28:53,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:28:53,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108594471] [2019-12-27 16:28:53,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:28:53,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 16:28:53,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1076417191] [2019-12-27 16:28:53,191 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:28:53,210 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:28:53,379 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 213 states and 387 transitions. [2019-12-27 16:28:53,379 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:28:53,487 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 16:28:53,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 16:28:53,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:28:53,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 16:28:53,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-27 16:28:53,488 INFO L87 Difference]: Start difference. First operand 23119 states and 71238 transitions. Second operand 13 states. [2019-12-27 16:28:55,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:28:55,585 INFO L93 Difference]: Finished difference Result 36199 states and 110776 transitions. [2019-12-27 16:28:55,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 16:28:55,585 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2019-12-27 16:28:55,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:28:55,644 INFO L225 Difference]: With dead ends: 36199 [2019-12-27 16:28:55,644 INFO L226 Difference]: Without dead ends: 29388 [2019-12-27 16:28:55,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-12-27 16:28:55,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29388 states. [2019-12-27 16:28:56,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29388 to 23685. [2019-12-27 16:28:56,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23685 states. [2019-12-27 16:28:56,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23685 states to 23685 states and 72569 transitions. [2019-12-27 16:28:56,057 INFO L78 Accepts]: Start accepts. Automaton has 23685 states and 72569 transitions. Word has length 65 [2019-12-27 16:28:56,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:28:56,057 INFO L462 AbstractCegarLoop]: Abstraction has 23685 states and 72569 transitions. [2019-12-27 16:28:56,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 16:28:56,057 INFO L276 IsEmpty]: Start isEmpty. Operand 23685 states and 72569 transitions. [2019-12-27 16:28:56,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:28:56,085 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:28:56,085 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 16:28:56,085 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 16:28:56,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:28:56,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1050757295, now seen corresponding path program 4 times [2019-12-27 16:28:56,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:28:56,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72508667] [2019-12-27 16:28:56,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:28:56,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:28:56,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:28:56,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72508667] [2019-12-27 16:28:56,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:28:56,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 16:28:56,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1273355752] [2019-12-27 16:28:56,522 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:28:56,542 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:28:56,766 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 206 states and 367 transitions. [2019-12-27 16:28:56,766 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:28:56,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 16:28:56,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:28:56,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 16:28:56,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:28:57,106 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 16:28:57,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 16:28:57,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:28:57,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 16:28:57,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2019-12-27 16:28:57,107 INFO L87 Difference]: Start difference. First operand 23685 states and 72569 transitions. Second operand 20 states. [2019-12-27 16:29:05,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:29:05,386 INFO L93 Difference]: Finished difference Result 58195 states and 176431 transitions. [2019-12-27 16:29:05,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-12-27 16:29:05,387 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 65 [2019-12-27 16:29:05,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:29:05,469 INFO L225 Difference]: With dead ends: 58195 [2019-12-27 16:29:05,469 INFO L226 Difference]: Without dead ends: 54770 [2019-12-27 16:29:05,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 6 SyntacticMatches, 7 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2260 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1015, Invalid=6467, Unknown=0, NotChecked=0, Total=7482 [2019-12-27 16:29:05,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54770 states. [2019-12-27 16:29:06,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54770 to 27719. [2019-12-27 16:29:06,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27719 states. [2019-12-27 16:29:06,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27719 states to 27719 states and 84396 transitions. [2019-12-27 16:29:06,061 INFO L78 Accepts]: Start accepts. Automaton has 27719 states and 84396 transitions. Word has length 65 [2019-12-27 16:29:06,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:29:06,061 INFO L462 AbstractCegarLoop]: Abstraction has 27719 states and 84396 transitions. [2019-12-27 16:29:06,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 16:29:06,061 INFO L276 IsEmpty]: Start isEmpty. Operand 27719 states and 84396 transitions. [2019-12-27 16:29:06,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:29:06,093 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:29:06,093 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 16:29:06,093 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 16:29:06,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:29:06,094 INFO L82 PathProgramCache]: Analyzing trace with hash -330874671, now seen corresponding path program 5 times [2019-12-27 16:29:06,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:29:06,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723876571] [2019-12-27 16:29:06,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:29:06,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:29:06,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:29:06,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723876571] [2019-12-27 16:29:06,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:29:06,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 16:29:06,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [445379917] [2019-12-27 16:29:06,428 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:29:06,444 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:29:06,774 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 279 states and 547 transitions. [2019-12-27 16:29:06,774 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:29:06,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:29:07,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:29:07,261 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 16:29:07,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-27 16:29:07,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:29:07,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-27 16:29:07,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2019-12-27 16:29:07,262 INFO L87 Difference]: Start difference. First operand 27719 states and 84396 transitions. Second operand 21 states. [2019-12-27 16:29:15,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:29:15,412 INFO L93 Difference]: Finished difference Result 68278 states and 204529 transitions. [2019-12-27 16:29:15,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-12-27 16:29:15,413 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 65 [2019-12-27 16:29:15,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:29:15,498 INFO L225 Difference]: With dead ends: 68278 [2019-12-27 16:29:15,499 INFO L226 Difference]: Without dead ends: 57230 [2019-12-27 16:29:15,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 10 SyntacticMatches, 8 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1561 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=900, Invalid=4800, Unknown=0, NotChecked=0, Total=5700 [2019-12-27 16:29:15,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57230 states. [2019-12-27 16:29:16,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57230 to 23456. [2019-12-27 16:29:16,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23456 states. [2019-12-27 16:29:16,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23456 states to 23456 states and 71768 transitions. [2019-12-27 16:29:16,068 INFO L78 Accepts]: Start accepts. Automaton has 23456 states and 71768 transitions. Word has length 65 [2019-12-27 16:29:16,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:29:16,068 INFO L462 AbstractCegarLoop]: Abstraction has 23456 states and 71768 transitions. [2019-12-27 16:29:16,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-27 16:29:16,068 INFO L276 IsEmpty]: Start isEmpty. Operand 23456 states and 71768 transitions. [2019-12-27 16:29:16,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:29:16,091 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:29:16,091 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 16:29:16,092 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 16:29:16,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:29:16,092 INFO L82 PathProgramCache]: Analyzing trace with hash -131369463, now seen corresponding path program 6 times [2019-12-27 16:29:16,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:29:16,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058148044] [2019-12-27 16:29:16,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:29:16,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:29:16,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:29:16,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058148044] [2019-12-27 16:29:16,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:29:16,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 16:29:16,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1086938625] [2019-12-27 16:29:16,257 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:29:16,271 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:29:16,545 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 283 states and 533 transitions. [2019-12-27 16:29:16,546 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:29:16,782 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 16:29:16,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 16:29:16,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:29:16,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 16:29:16,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-27 16:29:16,783 INFO L87 Difference]: Start difference. First operand 23456 states and 71768 transitions. Second operand 13 states. [2019-12-27 16:29:18,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:29:18,475 INFO L93 Difference]: Finished difference Result 31886 states and 96855 transitions. [2019-12-27 16:29:18,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 16:29:18,475 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2019-12-27 16:29:18,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:29:18,514 INFO L225 Difference]: With dead ends: 31886 [2019-12-27 16:29:18,514 INFO L226 Difference]: Without dead ends: 26858 [2019-12-27 16:29:18,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 8 SyntacticMatches, 10 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2019-12-27 16:29:18,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26858 states. [2019-12-27 16:29:19,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26858 to 23082. [2019-12-27 16:29:19,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23082 states. [2019-12-27 16:29:19,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23082 states to 23082 states and 70727 transitions. [2019-12-27 16:29:19,166 INFO L78 Accepts]: Start accepts. Automaton has 23082 states and 70727 transitions. Word has length 65 [2019-12-27 16:29:19,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:29:19,166 INFO L462 AbstractCegarLoop]: Abstraction has 23082 states and 70727 transitions. [2019-12-27 16:29:19,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 16:29:19,167 INFO L276 IsEmpty]: Start isEmpty. Operand 23082 states and 70727 transitions. [2019-12-27 16:29:19,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:29:19,190 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:29:19,190 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 16:29:19,190 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 16:29:19,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:29:19,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1019867375, now seen corresponding path program 7 times [2019-12-27 16:29:19,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:29:19,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929674162] [2019-12-27 16:29:19,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:29:19,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:29:19,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:29:19,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929674162] [2019-12-27 16:29:19,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:29:19,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:29:19,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1148038568] [2019-12-27 16:29:19,275 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:29:19,288 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:29:19,500 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 187 states and 310 transitions. [2019-12-27 16:29:19,500 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:29:19,501 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:29:19,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:29:19,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:29:19,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:29:19,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:29:19,502 INFO L87 Difference]: Start difference. First operand 23082 states and 70727 transitions. Second operand 4 states. [2019-12-27 16:29:19,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:29:19,632 INFO L93 Difference]: Finished difference Result 27417 states and 83662 transitions. [2019-12-27 16:29:19,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:29:19,632 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 16:29:19,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:29:19,669 INFO L225 Difference]: With dead ends: 27417 [2019-12-27 16:29:19,670 INFO L226 Difference]: Without dead ends: 27417 [2019-12-27 16:29:19,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 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 16:29:19,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27417 states. [2019-12-27 16:29:20,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27417 to 23125. [2019-12-27 16:29:20,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23125 states. [2019-12-27 16:29:20,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23125 states to 23125 states and 71029 transitions. [2019-12-27 16:29:20,051 INFO L78 Accepts]: Start accepts. Automaton has 23125 states and 71029 transitions. Word has length 65 [2019-12-27 16:29:20,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:29:20,051 INFO L462 AbstractCegarLoop]: Abstraction has 23125 states and 71029 transitions. [2019-12-27 16:29:20,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:29:20,051 INFO L276 IsEmpty]: Start isEmpty. Operand 23125 states and 71029 transitions. [2019-12-27 16:29:20,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:29:20,077 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:29:20,077 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:29:20,077 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 16:29:20,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:29:20,077 INFO L82 PathProgramCache]: Analyzing trace with hash 38318619, now seen corresponding path program 1 times [2019-12-27 16:29:20,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:29:20,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056542413] [2019-12-27 16:29:20,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:29:20,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:29:20,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:29:20,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056542413] [2019-12-27 16:29:20,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:29:20,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 16:29:20,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1146134652] [2019-12-27 16:29:20,290 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:29:20,299 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:29:20,548 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 328 states and 668 transitions. [2019-12-27 16:29:20,548 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:29:20,854 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 26 times. [2019-12-27 16:29:20,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 16:29:20,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:29:20,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 16:29:20,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-27 16:29:20,855 INFO L87 Difference]: Start difference. First operand 23125 states and 71029 transitions. Second operand 15 states. [2019-12-27 16:29:25,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:29:25,492 INFO L93 Difference]: Finished difference Result 69045 states and 209778 transitions. [2019-12-27 16:29:25,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-12-27 16:29:25,492 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 66 [2019-12-27 16:29:25,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:29:25,580 INFO L225 Difference]: With dead ends: 69045 [2019-12-27 16:29:25,580 INFO L226 Difference]: Without dead ends: 60549 [2019-12-27 16:29:25,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 13 SyntacticMatches, 11 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1948 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=834, Invalid=5018, Unknown=0, NotChecked=0, Total=5852 [2019-12-27 16:29:25,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60549 states. [2019-12-27 16:29:26,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60549 to 22744. [2019-12-27 16:29:26,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22744 states. [2019-12-27 16:29:26,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22744 states to 22744 states and 69779 transitions. [2019-12-27 16:29:26,153 INFO L78 Accepts]: Start accepts. Automaton has 22744 states and 69779 transitions. Word has length 66 [2019-12-27 16:29:26,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:29:26,154 INFO L462 AbstractCegarLoop]: Abstraction has 22744 states and 69779 transitions. [2019-12-27 16:29:26,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 16:29:26,154 INFO L276 IsEmpty]: Start isEmpty. Operand 22744 states and 69779 transitions. [2019-12-27 16:29:26,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:29:26,176 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:29:26,176 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:29:26,176 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 16:29:26,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:29:26,177 INFO L82 PathProgramCache]: Analyzing trace with hash 620198601, now seen corresponding path program 2 times [2019-12-27 16:29:26,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:29:26,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438175447] [2019-12-27 16:29:26,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:29:26,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:29:26,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:29:26,291 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 16:29:26,292 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 16:29:26,296 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] ULTIMATE.startENTRY-->L825: Formula: (let ((.cse0 (store |v_#valid_71| 0 0))) (and (= v_~z$w_buff0_used~0_749 0) (= v_~weak$$choice2~0_132 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t678~0.base_22|) (= 0 v_~weak$$choice0~0_14) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_6| 0) (= v_~z$r_buff0_thd1~0_380 0) (= v_~z$r_buff0_thd2~0_184 0) (= v_~__unbuffered_cnt~0_128 0) (= v_~y~0_48 0) (= v_~z$mem_tmp~0_24 0) (< 0 |v_#StackHeapBarrier_15|) (= v_~z$r_buff1_thd0~0_296 0) (= |v_#memory_int_19| (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t678~0.base_22| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t678~0.base_22|) |v_ULTIMATE.start_main_~#t678~0.offset_16| 0))) (= v_~z$read_delayed_var~0.base_6 0) (= v_~__unbuffered_p2_EBX~0_50 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t678~0.base_22| 1) |v_#valid_69|) (= v_~z$w_buff1_used~0_500 0) (= v_~z$r_buff0_thd0~0_197 0) (= 0 |v_#NULL.base_6|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t678~0.base_22| 4)) (= 0 v_~z$flush_delayed~0_43) (= 0 v_~__unbuffered_p0_EAX~0_233) (= (select .cse0 |v_ULTIMATE.start_main_~#t678~0.base_22|) 0) (= v_~z$read_delayed~0_7 0) (= 0 v_~z$r_buff1_thd3~0_396) (= v_~z$r_buff1_thd1~0_267 0) (= 0 v_~__unbuffered_p2_EAX~0_37) (= 0 |v_ULTIMATE.start_main_~#t678~0.offset_16|) (= v_~z$w_buff0~0_256 0) (= v_~main$tmp_guard0~0_22 0) (= 0 v_~z$r_buff0_thd3~0_379) (= v_~z$r_buff1_thd2~0_280 0) (= v_~z$w_buff1~0_199 0) (= 0 v_~x~0_133) (= v_~z~0_182 0) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t678~0.offset=|v_ULTIMATE.start_main_~#t678~0.offset_16|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_280, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_63|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_113|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_223|, ULTIMATE.start_main_~#t680~0.offset=|v_ULTIMATE.start_main_~#t680~0.offset_14|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_76|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_197, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_233, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_37, ULTIMATE.start_main_~#t680~0.base=|v_ULTIMATE.start_main_~#t680~0.base_17|, ~z$mem_tmp~0=v_~z$mem_tmp~0_24, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_50, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_500, ~z$flush_delayed~0=v_~z$flush_delayed~0_43, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_267, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_379, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_128, ~x~0=v_~x~0_133, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_199, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_45|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t679~0.base=|v_ULTIMATE.start_main_~#t679~0.base_19|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_33|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_296, ~y~0=v_~y~0_48, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_184, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_19|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_749, ~z$w_buff0~0=v_~z$w_buff0~0_256, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_396, ULTIMATE.start_main_~#t679~0.offset=|v_ULTIMATE.start_main_~#t679~0.offset_14|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_182, ULTIMATE.start_main_~#t678~0.base=|v_ULTIMATE.start_main_~#t678~0.base_22|, ~weak$$choice2~0=v_~weak$$choice2~0_132, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_380} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t678~0.offset, ~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_~#t680~0.offset, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t680~0.base, ~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, ~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_~#t679~0.base, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~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, ULTIMATE.start_main_~#t679~0.offset, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ULTIMATE.start_main_~#t678~0.base, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 16:29:26,297 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L4-->L746: Formula: (and (= v_~z$r_buff0_thd1~0_29 v_~z$r_buff1_thd1~0_17) (not (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10 0)) (= v_~z$r_buff0_thd2~0_25 v_~z$r_buff1_thd2~0_17) (= v_~z$r_buff0_thd3~0_70 v_~z$r_buff1_thd3~0_54) (= v_~z$r_buff0_thd1~0_28 1) (= v_~z$r_buff0_thd0~0_26 v_~z$r_buff1_thd0~0_23) (= v_~x~0_9 v_~__unbuffered_p0_EAX~0_11)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_26, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_70, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_29, ~x~0=v_~x~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_11, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_26, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_54, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_23, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_17, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_17, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_70, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_28, ~x~0=v_~x~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 16:29:26,298 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L825-1-->L827: Formula: (and (not (= |v_ULTIMATE.start_main_~#t679~0.base_11| 0)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t679~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t679~0.base_11|) |v_ULTIMATE.start_main_~#t679~0.offset_10| 1)) |v_#memory_int_13|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t679~0.base_11| 4)) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t679~0.base_11|)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t679~0.base_11| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t679~0.base_11|) (= 0 |v_ULTIMATE.start_main_~#t679~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t679~0.base=|v_ULTIMATE.start_main_~#t679~0.base_11|, #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_~#t679~0.offset=|v_ULTIMATE.start_main_~#t679~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t679~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t679~0.offset] because there is no mapped edge [2019-12-27 16:29:26,299 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [856] [856] L827-1-->L829: Formula: (and (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t680~0.base_12|) 0) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t680~0.base_12| 1)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t680~0.base_12| 4)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t680~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t680~0.base_12|) |v_ULTIMATE.start_main_~#t680~0.offset_10| 2)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t680~0.base_12|) (= |v_ULTIMATE.start_main_~#t680~0.offset_10| 0) (not (= |v_ULTIMATE.start_main_~#t680~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t680~0.offset=|v_ULTIMATE.start_main_~#t680~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_29|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t680~0.base=|v_ULTIMATE.start_main_~#t680~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t680~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t680~0.base] because there is no mapped edge [2019-12-27 16:29:26,302 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L766-2-->L766-5: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-1468621749 256))) (.cse2 (= |P1Thread1of1ForFork2_#t~ite9_Out-1468621749| |P1Thread1of1ForFork2_#t~ite10_Out-1468621749|)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1468621749 256)))) (or (and (or .cse0 .cse1) .cse2 (= |P1Thread1of1ForFork2_#t~ite9_Out-1468621749| ~z~0_In-1468621749)) (and (not .cse1) .cse2 (not .cse0) (= |P1Thread1of1ForFork2_#t~ite9_Out-1468621749| ~z$w_buff1~0_In-1468621749)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1468621749, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1468621749, ~z$w_buff1~0=~z$w_buff1~0_In-1468621749, ~z~0=~z~0_In-1468621749} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-1468621749|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1468621749, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out-1468621749|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1468621749, ~z$w_buff1~0=~z$w_buff1~0_In-1468621749, ~z~0=~z~0_In-1468621749} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 16:29:26,303 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L792-->L792-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1325484193 256) 0))) (or (and .cse0 (= ~z$w_buff1~0_In1325484193 |P2Thread1of1ForFork0_#t~ite23_Out1325484193|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1325484193 256)))) (or (and (= (mod ~z$w_buff1_used~0_In1325484193 256) 0) .cse1) (and (= 0 (mod ~z$r_buff1_thd3~0_In1325484193 256)) .cse1) (= 0 (mod ~z$w_buff0_used~0_In1325484193 256)))) (= |P2Thread1of1ForFork0_#t~ite24_Out1325484193| |P2Thread1of1ForFork0_#t~ite23_Out1325484193|)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite24_Out1325484193| ~z$w_buff1~0_In1325484193) (= |P2Thread1of1ForFork0_#t~ite23_In1325484193| |P2Thread1of1ForFork0_#t~ite23_Out1325484193|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1325484193, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1325484193, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In1325484193|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1325484193, ~z$w_buff1~0=~z$w_buff1~0_In1325484193, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1325484193, ~weak$$choice2~0=~weak$$choice2~0_In1325484193} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1325484193, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out1325484193|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1325484193, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out1325484193|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1325484193, ~z$w_buff1~0=~z$w_buff1~0_In1325484193, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1325484193, ~weak$$choice2~0=~weak$$choice2~0_In1325484193} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-27 16:29:26,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L794-->L794-8: Formula: (let ((.cse4 (= 0 (mod ~z$w_buff0_used~0_In-2100730564 256))) (.cse1 (= (mod ~z$r_buff1_thd3~0_In-2100730564 256) 0)) (.cse0 (= (mod ~weak$$choice2~0_In-2100730564 256) 0)) (.cse5 (= |P2Thread1of1ForFork0_#t~ite29_Out-2100730564| |P2Thread1of1ForFork0_#t~ite30_Out-2100730564|)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-2100730564 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In-2100730564 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite28_In-2100730564| |P2Thread1of1ForFork0_#t~ite28_Out-2100730564|) (or (and (= |P2Thread1of1ForFork0_#t~ite29_Out-2100730564| |P2Thread1of1ForFork0_#t~ite29_In-2100730564|) (= ~z$w_buff1_used~0_In-2100730564 |P2Thread1of1ForFork0_#t~ite30_Out-2100730564|) (not .cse0)) (and (or (and .cse1 .cse2) (and .cse3 .cse2) .cse4) .cse0 .cse5 (= ~z$w_buff1_used~0_In-2100730564 |P2Thread1of1ForFork0_#t~ite29_Out-2100730564|)))) (let ((.cse6 (not .cse2))) (and (= |P2Thread1of1ForFork0_#t~ite28_Out-2100730564| 0) (not .cse4) (or (not .cse1) .cse6) .cse0 .cse5 (or (not .cse3) .cse6) (= |P2Thread1of1ForFork0_#t~ite29_Out-2100730564| |P2Thread1of1ForFork0_#t~ite28_Out-2100730564|))))) InVars {P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_In-2100730564|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2100730564, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2100730564, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2100730564, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2100730564, ~weak$$choice2~0=~weak$$choice2~0_In-2100730564, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In-2100730564|} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-2100730564|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2100730564, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2100730564, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2100730564, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2100730564, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out-2100730564|, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-2100730564|, ~weak$$choice2~0=~weak$$choice2~0_In-2100730564} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 16:29:26,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [890] [890] L794-8-->L796: Formula: (and (= v_~z$w_buff1_used~0_493 |v_P2Thread1of1ForFork0_#t~ite30_38|) (not (= (mod v_~weak$$choice2~0_130 256) 0)) (= v_~z$r_buff0_thd3~0_373 v_~z$r_buff0_thd3~0_372)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_373, P2Thread1of1ForFork0_#t~ite30=|v_P2Thread1of1ForFork0_#t~ite30_38|, ~weak$$choice2~0=v_~weak$$choice2~0_130} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_39|, P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_15|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_31|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_493, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_372, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_23|, P2Thread1of1ForFork0_#t~ite30=|v_P2Thread1of1ForFork0_#t~ite30_37|, ~weak$$choice2~0=v_~weak$$choice2~0_130, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_49|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31, P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 16:29:26,306 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L798-->L802: Formula: (and (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= 0 v_~z$flush_delayed~0_9) (= v_~z~0_46 v_~z$mem_tmp~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_46} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 16:29:26,307 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L802-2-->L802-5: Formula: (let ((.cse1 (= |P2Thread1of1ForFork0_#t~ite39_Out876823225| |P2Thread1of1ForFork0_#t~ite38_Out876823225|)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In876823225 256))) (.cse0 (= (mod ~z$r_buff1_thd3~0_In876823225 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite38_Out876823225| ~z$w_buff1~0_In876823225) (not .cse0) .cse1 (not .cse2)) (and (= |P2Thread1of1ForFork0_#t~ite38_Out876823225| ~z~0_In876823225) .cse1 (or .cse2 .cse0)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In876823225, ~z$w_buff1_used~0=~z$w_buff1_used~0_In876823225, ~z$w_buff1~0=~z$w_buff1~0_In876823225, ~z~0=~z~0_In876823225} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out876823225|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out876823225|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In876823225, ~z$w_buff1_used~0=~z$w_buff1_used~0_In876823225, ~z$w_buff1~0=~z$w_buff1~0_In876823225, ~z~0=~z~0_In876823225} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 16:29:26,308 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L803-->L803-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1735250467 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1735250467 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite40_Out1735250467| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1735250467 |P2Thread1of1ForFork0_#t~ite40_Out1735250467|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1735250467, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1735250467} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1735250467, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out1735250467|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1735250467} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 16:29:26,308 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L804-->L804-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In1878390685 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In1878390685 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1878390685 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1878390685 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite41_Out1878390685| ~z$w_buff1_used~0_In1878390685) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork0_#t~ite41_Out1878390685| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1878390685, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1878390685, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1878390685, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1878390685} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1878390685, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1878390685, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1878390685, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1878390685, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out1878390685|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 16:29:26,309 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L805-->L805-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In817252036 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In817252036 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite42_Out817252036| ~z$r_buff0_thd3~0_In817252036) (or .cse0 .cse1)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite42_Out817252036| 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In817252036, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In817252036} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In817252036, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In817252036, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out817252036|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 16:29:26,310 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L806-->L806-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In239676308 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In239676308 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In239676308 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In239676308 256)))) (or (and (= ~z$r_buff1_thd3~0_In239676308 |P2Thread1of1ForFork0_#t~ite43_Out239676308|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite43_Out239676308|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In239676308, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In239676308, ~z$w_buff1_used~0=~z$w_buff1_used~0_In239676308, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In239676308} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out239676308|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In239676308, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In239676308, ~z$w_buff1_used~0=~z$w_buff1_used~0_In239676308, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In239676308} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 16:29:26,310 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L806-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_100 1) v_~__unbuffered_cnt~0_99) (= v_~z$r_buff1_thd3~0_306 |v_P2Thread1of1ForFork0_#t~ite43_56|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_56|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_55|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_306, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_99, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 16:29:26,311 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L747-->L747-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In-836841246 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-836841246 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite5_Out-836841246| 0) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In-836841246 |P0Thread1of1ForFork1_#t~ite5_Out-836841246|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-836841246, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-836841246} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-836841246|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-836841246, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-836841246} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 16:29:26,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L748-->L748-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In1522226585 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In1522226585 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1522226585 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd1~0_In1522226585 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite6_Out1522226585| 0)) (and (or .cse3 .cse2) (= |P0Thread1of1ForFork1_#t~ite6_Out1522226585| ~z$w_buff1_used~0_In1522226585) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1522226585, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1522226585, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1522226585, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1522226585} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1522226585, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out1522226585|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1522226585, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1522226585, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1522226585} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 16:29:26,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L749-->L750: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In-2061561555 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-2061561555 256)))) (or (and (not .cse0) (= ~z$r_buff0_thd1~0_Out-2061561555 0) (not .cse1)) (and (= ~z$r_buff0_thd1~0_In-2061561555 ~z$r_buff0_thd1~0_Out-2061561555) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2061561555, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2061561555} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2061561555, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-2061561555|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-2061561555} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 16:29:26,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L750-->L750-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-1484270622 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1484270622 256))) (.cse3 (= (mod ~z$r_buff1_thd1~0_In-1484270622 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-1484270622 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite8_Out-1484270622| ~z$r_buff1_thd1~0_In-1484270622) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork1_#t~ite8_Out-1484270622| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1484270622, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1484270622, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1484270622, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1484270622} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-1484270622|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1484270622, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1484270622, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1484270622, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1484270622} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 16:29:26,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L750-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~z$r_buff1_thd1~0_83 |v_P0Thread1of1ForFork1_#t~ite8_40|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_39|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_83, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 16:29:26,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L767-->L767-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In646744300 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In646744300 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite11_Out646744300| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out646744300| ~z$w_buff0_used~0_In646744300)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In646744300, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In646744300} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In646744300, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out646744300|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In646744300} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 16:29:26,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L768-->L768-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd2~0_In1788516199 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In1788516199 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd2~0_In1788516199 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1788516199 256)))) (or (and (= ~z$w_buff1_used~0_In1788516199 |P1Thread1of1ForFork2_#t~ite12_Out1788516199|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork2_#t~ite12_Out1788516199|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1788516199, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1788516199, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1788516199, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1788516199} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1788516199, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1788516199, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1788516199, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out1788516199|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1788516199} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 16:29:26,314 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L769-->L769-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1105854765 256))) (.cse0 (= (mod ~z$r_buff0_thd2~0_In-1105854765 256) 0))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite13_Out-1105854765|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd2~0_In-1105854765 |P1Thread1of1ForFork2_#t~ite13_Out-1105854765|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1105854765, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1105854765} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1105854765, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-1105854765|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1105854765} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 16:29:26,315 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L770-->L770-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In1484757485 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1484757485 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd2~0_In1484757485 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In1484757485 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite14_Out1484757485| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite14_Out1484757485| ~z$r_buff1_thd2~0_In1484757485) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1484757485, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1484757485, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1484757485, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1484757485} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1484757485, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1484757485, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1484757485, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out1484757485|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1484757485} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 16:29:26,315 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L770-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_186 |v_P1Thread1of1ForFork2_#t~ite14_50|) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_94 1) v_~__unbuffered_cnt~0_93) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_94, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_50|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_186, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_49|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 16:29:26,315 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L829-1-->L835: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 16:29:26,316 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L835-2-->L835-4: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In2106169825 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In2106169825 256)))) (or (and (or .cse0 .cse1) (= ~z~0_In2106169825 |ULTIMATE.start_main_#t~ite47_Out2106169825|)) (and (= |ULTIMATE.start_main_#t~ite47_Out2106169825| ~z$w_buff1~0_In2106169825) (not .cse0) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2106169825, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2106169825, ~z$w_buff1~0=~z$w_buff1~0_In2106169825, ~z~0=~z~0_In2106169825} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2106169825, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out2106169825|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2106169825, ~z$w_buff1~0=~z$w_buff1~0_In2106169825, ~z~0=~z~0_In2106169825} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 16:29:26,316 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L835-4-->L836: Formula: (= v_~z~0_40 |v_ULTIMATE.start_main_#t~ite47_9|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_9|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_8|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_12|, ~z~0=v_~z~0_40} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48, ~z~0] because there is no mapped edge [2019-12-27 16:29:26,316 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L836-->L836-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-240970949 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-240970949 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite49_Out-240970949| 0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite49_Out-240970949| ~z$w_buff0_used~0_In-240970949)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-240970949, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-240970949} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-240970949, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-240970949, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-240970949|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 16:29:26,317 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L837-->L837-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In436223395 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In436223395 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In436223395 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd0~0_In436223395 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite50_Out436223395|)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite50_Out436223395| ~z$w_buff1_used~0_In436223395) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In436223395, ~z$w_buff0_used~0=~z$w_buff0_used~0_In436223395, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In436223395, ~z$w_buff1_used~0=~z$w_buff1_used~0_In436223395} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out436223395|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In436223395, ~z$w_buff0_used~0=~z$w_buff0_used~0_In436223395, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In436223395, ~z$w_buff1_used~0=~z$w_buff1_used~0_In436223395} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 16:29:26,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L838-->L838-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-2075834545 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-2075834545 256)))) (or (and (= |ULTIMATE.start_main_#t~ite51_Out-2075834545| 0) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In-2075834545 |ULTIMATE.start_main_#t~ite51_Out-2075834545|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2075834545, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2075834545} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2075834545, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-2075834545|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2075834545} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 16:29:26,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L839-->L839-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In1714044526 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In1714044526 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In1714044526 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1714044526 256)))) (or (and (= ~z$r_buff1_thd0~0_In1714044526 |ULTIMATE.start_main_#t~ite52_Out1714044526|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite52_Out1714044526|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1714044526, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1714044526, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1714044526, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1714044526} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1714044526|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1714044526, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1714044526, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1714044526, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1714044526} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 16:29:26,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L839-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y~0_25 2) (= 2 v_~__unbuffered_p2_EAX~0_21) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~z$r_buff1_thd0~0_219 |v_ULTIMATE.start_main_#t~ite52_38|) (= v_~main$tmp_guard1~0_16 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_~__unbuffered_p2_EBX~0_34 0) (= 0 v_~__unbuffered_p0_EAX~0_178)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_178, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~y~0=v_~y~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_178, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_37|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_219, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~y~0=v_~y~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 16:29:26,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:29:26 BasicIcfg [2019-12-27 16:29:26,403 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 16:29:26,408 INFO L168 Benchmark]: Toolchain (without parser) took 141604.03 ms. Allocated memory was 146.3 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 102.6 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-27 16:29:26,409 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 16:29:26,409 INFO L168 Benchmark]: CACSL2BoogieTranslator took 796.96 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 102.2 MB in the beginning and 157.3 MB in the end (delta: -55.1 MB). Peak memory consumption was 22.6 MB. Max. memory is 7.1 GB. [2019-12-27 16:29:26,409 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.34 ms. Allocated memory is still 203.9 MB. Free memory was 157.3 MB in the beginning and 154.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 16:29:26,410 INFO L168 Benchmark]: Boogie Preprocessor took 47.16 ms. Allocated memory is still 203.9 MB. Free memory was 154.7 MB in the beginning and 152.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 16:29:26,410 INFO L168 Benchmark]: RCFGBuilder took 827.08 ms. Allocated memory is still 203.9 MB. Free memory was 152.2 MB in the beginning and 102.6 MB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. [2019-12-27 16:29:26,411 INFO L168 Benchmark]: TraceAbstraction took 139861.30 ms. Allocated memory was 203.9 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 102.0 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-27 16:29:26,416 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.36 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 796.96 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 102.2 MB in the beginning and 157.3 MB in the end (delta: -55.1 MB). Peak memory consumption was 22.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.34 ms. Allocated memory is still 203.9 MB. Free memory was 157.3 MB in the beginning and 154.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.16 ms. Allocated memory is still 203.9 MB. Free memory was 154.7 MB in the beginning and 152.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 827.08 ms. Allocated memory is still 203.9 MB. Free memory was 152.2 MB in the beginning and 102.6 MB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 139861.30 ms. Allocated memory was 203.9 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 102.0 MB in the beginning and 1.9 GB in the end (delta: -1.8 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: 5.7s, 176 ProgramPointsBefore, 94 ProgramPointsAfterwards, 213 TransitionsBefore, 105 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 33 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 30 ChoiceCompositions, 7047 VarBasedMoverChecksPositive, 336 VarBasedMoverChecksNegative, 168 SemBasedMoverChecksPositive, 252 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 130103 CheckedPairsTotal, 120 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L825] FCALL, FORK 0 pthread_create(&t678, ((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(&t679, ((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(&t680, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 2 [L783] 3 __unbuffered_p2_EAX = y [L786] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L787] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L788] 3 z$flush_delayed = weak$$choice2 [L789] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L766] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L791] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L792] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L793] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L796] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L796] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L797] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L803] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L804] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L805] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L746] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L747] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L748] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L767] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L768] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L769] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L835] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L837] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L838] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 139.5s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 57.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8340 SDtfs, 12156 SDslu, 33234 SDs, 0 SdLazy, 28327 SolverSat, 687 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 26.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 733 GetRequests, 172 SyntacticMatches, 81 SemanticMatches, 480 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6448 ImplicationChecksByTransitivity, 10.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156115occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 42.7s AutomataMinimizationTime, 31 MinimizatonAttempts, 400880 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 1375 NumberOfCodeBlocks, 1375 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1278 ConstructedInterpolants, 0 QuantifiedInterpolants, 255776 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...