java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/eca-rers2012/Problem13_label20.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 02:45:02,410 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 02:45:02,413 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 02:45:02,431 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 02:45:02,432 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 02:45:02,434 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 02:45:02,436 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 02:45:02,445 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 02:45:02,450 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 02:45:02,452 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 02:45:02,454 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 02:45:02,455 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 02:45:02,455 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 02:45:02,457 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 02:45:02,459 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 02:45:02,460 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 02:45:02,462 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 02:45:02,463 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 02:45:02,465 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 02:45:02,469 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 02:45:02,473 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 02:45:02,476 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 02:45:02,478 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 02:45:02,479 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 02:45:02,481 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 02:45:02,481 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 02:45:02,482 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 02:45:02,483 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 02:45:02,484 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 02:45:02,485 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 02:45:02,486 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 02:45:02,486 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 02:45:02,487 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 02:45:02,488 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 02:45:02,489 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 02:45:02,489 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 02:45:02,490 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 02:45:02,490 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 02:45:02,490 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 02:45:02,491 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 02:45:02,492 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 02:45:02,493 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-07 02:45:02,530 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 02:45:02,530 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 02:45:02,531 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 02:45:02,534 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 02:45:02,534 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 02:45:02,535 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 02:45:02,535 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 02:45:02,535 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 02:45:02,535 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 02:45:02,535 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 02:45:02,536 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 02:45:02,536 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 02:45:02,536 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 02:45:02,538 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 02:45:02,538 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 02:45:02,538 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 02:45:02,539 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 02:45:02,539 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 02:45:02,539 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 02:45:02,539 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 02:45:02,540 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 02:45:02,540 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 02:45:02,540 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 02:45:02,540 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 02:45:02,540 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 02:45:02,541 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 02:45:02,541 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 02:45:02,541 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 02:45:02,542 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 02:45:02,808 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 02:45:02,821 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 02:45:02,824 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 02:45:02,826 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 02:45:02,826 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 02:45:02,827 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label20.c [2019-10-07 02:45:02,888 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7259e23f4/b089be46d199491097ba84c6b3f39529/FLAG4c992cf37 [2019-10-07 02:45:03,677 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 02:45:03,678 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label20.c [2019-10-07 02:45:03,717 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7259e23f4/b089be46d199491097ba84c6b3f39529/FLAG4c992cf37 [2019-10-07 02:45:04,218 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7259e23f4/b089be46d199491097ba84c6b3f39529 [2019-10-07 02:45:04,228 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 02:45:04,230 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 02:45:04,231 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 02:45:04,231 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 02:45:04,234 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 02:45:04,235 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 02:45:04" (1/1) ... [2019-10-07 02:45:04,238 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d60e989 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:45:04, skipping insertion in model container [2019-10-07 02:45:04,238 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 02:45:04" (1/1) ... [2019-10-07 02:45:04,246 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 02:45:04,431 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 02:45:06,522 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 02:45:06,527 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 02:45:07,240 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 02:45:07,275 INFO L192 MainTranslator]: Completed translation [2019-10-07 02:45:07,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:45:07 WrapperNode [2019-10-07 02:45:07,276 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 02:45:07,277 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 02:45:07,277 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 02:45:07,277 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 02:45:07,293 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:45:07" (1/1) ... [2019-10-07 02:45:07,294 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:45:07" (1/1) ... [2019-10-07 02:45:07,366 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:45:07" (1/1) ... [2019-10-07 02:45:07,368 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:45:07" (1/1) ... [2019-10-07 02:45:07,500 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:45:07" (1/1) ... [2019-10-07 02:45:07,550 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:45:07" (1/1) ... [2019-10-07 02:45:07,621 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:45:07" (1/1) ... [2019-10-07 02:45:07,667 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 02:45:07,668 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 02:45:07,668 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 02:45:07,668 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 02:45:07,669 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:45:07" (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-10-07 02:45:07,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 02:45:07,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 02:45:07,750 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-07 02:45:07,751 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-10-07 02:45:07,751 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2019-10-07 02:45:07,751 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2019-10-07 02:45:07,752 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 02:45:07,752 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-07 02:45:07,752 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-10-07 02:45:07,753 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2019-10-07 02:45:07,753 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2019-10-07 02:45:07,755 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 02:45:07,756 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 02:45:07,756 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-07 02:45:07,756 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 02:45:07,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 02:45:07,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 02:46:15,500 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 02:46:15,500 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-07 02:46:15,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 02:46:15 BoogieIcfgContainer [2019-10-07 02:46:15,502 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 02:46:15,503 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 02:46:15,503 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 02:46:15,506 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 02:46:15,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 02:45:04" (1/3) ... [2019-10-07 02:46:15,507 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@572ec1fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 02:46:15, skipping insertion in model container [2019-10-07 02:46:15,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:45:07" (2/3) ... [2019-10-07 02:46:15,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@572ec1fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 02:46:15, skipping insertion in model container [2019-10-07 02:46:15,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 02:46:15" (3/3) ... [2019-10-07 02:46:15,509 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem13_label20.c [2019-10-07 02:46:15,519 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 02:46:15,527 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 02:46:15,538 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 02:46:15,570 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 02:46:15,570 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 02:46:15,570 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 02:46:15,570 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 02:46:15,571 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 02:46:15,571 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 02:46:15,571 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 02:46:15,571 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 02:46:15,603 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states. [2019-10-07 02:46:15,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-07 02:46:15,609 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 02:46:15,610 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 02:46:15,611 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 02:46:15,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 02:46:15,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1447970582, now seen corresponding path program 1 times [2019-10-07 02:46:15,626 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 02:46:15,626 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 02:46:15,626 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 02:46:15,626 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 02:46:15,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 02:46:15,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 02:46:15,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 02:46:15,882 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 02:46:15,882 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 02:46:15,883 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 02:46:15,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 02:46:15,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 02:46:15,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 02:46:15,905 INFO L87 Difference]: Start difference. First operand 694 states. Second operand 4 states. [2019-10-07 02:46:26,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 02:46:26,457 INFO L93 Difference]: Finished difference Result 2753 states and 5428 transitions. [2019-10-07 02:46:26,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 02:46:26,458 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-07 02:46:26,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 02:46:26,509 INFO L225 Difference]: With dead ends: 2753 [2019-10-07 02:46:26,509 INFO L226 Difference]: Without dead ends: 2052 [2019-10-07 02:46:26,521 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 02:46:26,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2052 states. [2019-10-07 02:46:26,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2052 to 1365. [2019-10-07 02:46:26,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1365 states. [2019-10-07 02:46:26,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 2525 transitions. [2019-10-07 02:46:26,651 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 2525 transitions. Word has length 11 [2019-10-07 02:46:26,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 02:46:26,652 INFO L462 AbstractCegarLoop]: Abstraction has 1365 states and 2525 transitions. [2019-10-07 02:46:26,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 02:46:26,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 2525 transitions. [2019-10-07 02:46:26,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-07 02:46:26,654 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 02:46:26,654 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 02:46:26,654 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 02:46:26,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 02:46:26,655 INFO L82 PathProgramCache]: Analyzing trace with hash -612216177, now seen corresponding path program 1 times [2019-10-07 02:46:26,655 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 02:46:26,655 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 02:46:26,656 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 02:46:26,656 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 02:46:26,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 02:46:26,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 02:46:26,792 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 02:46:26,792 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 02:46:26,793 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 02:46:26,793 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 02:46:26,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 02:46:26,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 02:46:26,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 02:46:26,795 INFO L87 Difference]: Start difference. First operand 1365 states and 2525 transitions. Second operand 5 states. [2019-10-07 02:46:34,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 02:46:34,154 INFO L93 Difference]: Finished difference Result 4142 states and 7697 transitions. [2019-10-07 02:46:34,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 02:46:34,154 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-10-07 02:46:34,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 02:46:34,177 INFO L225 Difference]: With dead ends: 4142 [2019-10-07 02:46:34,177 INFO L226 Difference]: Without dead ends: 2782 [2019-10-07 02:46:34,183 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-07 02:46:34,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2782 states. [2019-10-07 02:46:34,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2782 to 2759. [2019-10-07 02:46:34,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2759 states. [2019-10-07 02:46:34,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2759 states to 2759 states and 4496 transitions. [2019-10-07 02:46:34,297 INFO L78 Accepts]: Start accepts. Automaton has 2759 states and 4496 transitions. Word has length 21 [2019-10-07 02:46:34,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 02:46:34,297 INFO L462 AbstractCegarLoop]: Abstraction has 2759 states and 4496 transitions. [2019-10-07 02:46:34,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 02:46:34,298 INFO L276 IsEmpty]: Start isEmpty. Operand 2759 states and 4496 transitions. [2019-10-07 02:46:34,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-07 02:46:34,299 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 02:46:34,299 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 02:46:34,300 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 02:46:34,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 02:46:34,301 INFO L82 PathProgramCache]: Analyzing trace with hash 670047531, now seen corresponding path program 1 times [2019-10-07 02:46:34,302 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 02:46:34,302 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 02:46:34,303 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 02:46:34,303 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 02:46:34,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 02:46:34,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 02:46:34,434 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 02:46:34,434 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 02:46:34,435 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 02:46:34,435 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 02:46:34,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 02:46:34,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 02:46:34,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 02:46:34,436 INFO L87 Difference]: Start difference. First operand 2759 states and 4496 transitions. Second operand 5 states. [2019-10-07 02:46:44,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 02:46:44,752 INFO L93 Difference]: Finished difference Result 8457 states and 14013 transitions. [2019-10-07 02:46:44,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 02:46:44,756 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-10-07 02:46:44,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 02:46:44,785 INFO L225 Difference]: With dead ends: 8457 [2019-10-07 02:46:44,785 INFO L226 Difference]: Without dead ends: 5703 [2019-10-07 02:46:44,793 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-07 02:46:44,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5703 states. [2019-10-07 02:46:44,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5703 to 5619. [2019-10-07 02:46:44,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5619 states. [2019-10-07 02:46:45,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5619 states to 5619 states and 8248 transitions. [2019-10-07 02:46:45,007 INFO L78 Accepts]: Start accepts. Automaton has 5619 states and 8248 transitions. Word has length 23 [2019-10-07 02:46:45,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 02:46:45,008 INFO L462 AbstractCegarLoop]: Abstraction has 5619 states and 8248 transitions. [2019-10-07 02:46:45,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 02:46:45,008 INFO L276 IsEmpty]: Start isEmpty. Operand 5619 states and 8248 transitions. [2019-10-07 02:46:45,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-07 02:46:45,010 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 02:46:45,010 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 02:46:45,011 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 02:46:45,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 02:46:45,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1149818880, now seen corresponding path program 1 times [2019-10-07 02:46:45,011 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 02:46:45,012 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 02:46:45,012 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 02:46:45,012 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 02:46:45,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 02:46:45,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 02:46:45,194 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-07 02:46:45,194 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 02:46:45,195 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 02:46:45,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 02:46:45,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 02:46:45,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-07 02:46:45,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 02:46:45,435 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-07 02:46:45,435 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 02:46:45,504 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-07 02:46:45,505 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 02:46:45,505 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 12 [2019-10-07 02:46:45,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 02:46:45,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 02:46:45,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-10-07 02:46:45,507 INFO L87 Difference]: Start difference. First operand 5619 states and 8248 transitions. Second operand 5 states. [2019-10-07 02:46:53,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 02:46:53,507 INFO L93 Difference]: Finished difference Result 17117 states and 26266 transitions. [2019-10-07 02:46:53,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 02:46:53,508 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-10-07 02:46:53,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 02:46:53,571 INFO L225 Difference]: With dead ends: 17117 [2019-10-07 02:46:53,571 INFO L226 Difference]: Without dead ends: 11503 [2019-10-07 02:46:53,592 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-10-07 02:46:53,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11503 states. [2019-10-07 02:46:53,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11503 to 11034. [2019-10-07 02:46:53,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11034 states. [2019-10-07 02:46:53,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11034 states to 11034 states and 14969 transitions. [2019-10-07 02:46:53,940 INFO L78 Accepts]: Start accepts. Automaton has 11034 states and 14969 transitions. Word has length 41 [2019-10-07 02:46:53,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 02:46:53,940 INFO L462 AbstractCegarLoop]: Abstraction has 11034 states and 14969 transitions. [2019-10-07 02:46:53,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 02:46:53,940 INFO L276 IsEmpty]: Start isEmpty. Operand 11034 states and 14969 transitions. [2019-10-07 02:46:53,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-07 02:46:53,950 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 02:46:53,951 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-07 02:46:54,155 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 02:46:54,158 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 02:46:54,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 02:46:54,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1389128414, now seen corresponding path program 1 times [2019-10-07 02:46:54,159 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 02:46:54,159 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 02:46:54,159 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 02:46:54,160 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 02:46:54,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 02:46:54,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 02:46:54,388 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 02:46:54,388 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 02:46:54,388 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 02:46:54,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 02:46:54,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 02:46:54,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-07 02:46:54,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 02:46:54,540 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 02:46:54,541 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 02:46:54,699 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 35 [2019-10-07 02:46:54,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 02:46:54,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 02:46:54,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 02:46:54,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 02:46:54,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 02:46:54,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 02:46:54,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 02:46:54,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 02:46:54,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 02:46:54,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 02:46:54,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 02:46:54,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 02:46:54,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 02:46:54,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 02:46:54,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 02:46:54,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 02:46:54,840 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 02:46:54,840 INFO L211 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-07 02:46:54,841 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [6] total 11 [2019-10-07 02:46:54,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-07 02:46:54,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-07 02:46:54,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-10-07 02:46:54,842 INFO L87 Difference]: Start difference. First operand 11034 states and 14969 transitions. Second operand 7 states. [2019-10-07 02:47:03,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 02:47:03,896 INFO L93 Difference]: Finished difference Result 27779 states and 37750 transitions. [2019-10-07 02:47:03,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-07 02:47:03,897 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2019-10-07 02:47:03,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 02:47:03,962 INFO L225 Difference]: With dead ends: 27779 [2019-10-07 02:47:03,963 INFO L226 Difference]: Without dead ends: 16750 [2019-10-07 02:47:03,996 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-10-07 02:47:04,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16750 states. [2019-10-07 02:47:04,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16750 to 16019. [2019-10-07 02:47:04,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16019 states. [2019-10-07 02:47:04,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16019 states to 16019 states and 21343 transitions. [2019-10-07 02:47:04,503 INFO L78 Accepts]: Start accepts. Automaton has 16019 states and 21343 transitions. Word has length 70 [2019-10-07 02:47:04,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 02:47:04,506 INFO L462 AbstractCegarLoop]: Abstraction has 16019 states and 21343 transitions. [2019-10-07 02:47:04,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-07 02:47:04,507 INFO L276 IsEmpty]: Start isEmpty. Operand 16019 states and 21343 transitions. [2019-10-07 02:47:04,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-10-07 02:47:04,511 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 02:47:04,511 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-07 02:47:04,715 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 02:47:04,716 INFO L410 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 02:47:04,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 02:47:04,716 INFO L82 PathProgramCache]: Analyzing trace with hash -14624720, now seen corresponding path program 1 times [2019-10-07 02:47:04,717 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 02:47:04,717 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 02:47:04,717 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 02:47:04,717 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 02:47:04,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 02:47:04,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 02:47:04,840 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 02:47:04,840 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 02:47:04,841 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 02:47:04,841 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 02:47:04,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 02:47:04,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 02:47:04,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 02:47:04,844 INFO L87 Difference]: Start difference. First operand 16019 states and 21343 transitions. Second operand 3 states. [2019-10-07 02:47:09,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 02:47:09,983 INFO L93 Difference]: Finished difference Result 44758 states and 62318 transitions. [2019-10-07 02:47:09,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 02:47:09,983 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-10-07 02:47:09,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 02:47:10,300 INFO L225 Difference]: With dead ends: 44758 [2019-10-07 02:47:10,300 INFO L226 Difference]: Without dead ends: 29129 [2019-10-07 02:47:10,355 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-07 02:47:10,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29129 states. [2019-10-07 02:47:10,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29129 to 27025. [2019-10-07 02:47:10,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27025 states. [2019-10-07 02:47:10,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27025 states to 27025 states and 35943 transitions. [2019-10-07 02:47:10,957 INFO L78 Accepts]: Start accepts. Automaton has 27025 states and 35943 transitions. Word has length 81 [2019-10-07 02:47:10,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 02:47:10,958 INFO L462 AbstractCegarLoop]: Abstraction has 27025 states and 35943 transitions. [2019-10-07 02:47:10,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 02:47:10,958 INFO L276 IsEmpty]: Start isEmpty. Operand 27025 states and 35943 transitions. [2019-10-07 02:47:10,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-07 02:47:10,960 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 02:47:10,960 INFO L385 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 02:47:10,960 INFO L410 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 02:47:10,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 02:47:10,961 INFO L82 PathProgramCache]: Analyzing trace with hash -74501395, now seen corresponding path program 1 times [2019-10-07 02:47:10,961 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 02:47:10,961 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 02:47:10,961 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 02:47:10,961 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 02:47:10,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 02:47:11,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 02:47:11,133 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 61 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-07 02:47:11,133 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 02:47:11,134 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 02:47:11,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 02:47:11,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 02:47:11,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-07 02:47:11,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 02:47:11,304 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-10-07 02:47:11,305 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 02:47:11,438 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-10-07 02:47:11,439 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 02:47:11,439 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 10 [2019-10-07 02:47:11,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 02:47:11,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 02:47:11,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-10-07 02:47:11,442 INFO L87 Difference]: Start difference. First operand 27025 states and 35943 transitions. Second operand 5 states. [2019-10-07 02:47:23,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 02:47:23,410 INFO L93 Difference]: Finished difference Result 65975 states and 90303 transitions. [2019-10-07 02:47:23,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 02:47:23,411 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-10-07 02:47:23,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 02:47:23,564 INFO L225 Difference]: With dead ends: 65975 [2019-10-07 02:47:23,564 INFO L226 Difference]: Without dead ends: 39340 [2019-10-07 02:47:23,624 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 182 SyntacticMatches, 7 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-10-07 02:47:23,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39340 states. [2019-10-07 02:47:24,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39340 to 38522. [2019-10-07 02:47:24,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38522 states. [2019-10-07 02:47:24,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38522 states to 38522 states and 50891 transitions. [2019-10-07 02:47:24,445 INFO L78 Accepts]: Start accepts. Automaton has 38522 states and 50891 transitions. Word has length 95 [2019-10-07 02:47:24,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 02:47:24,445 INFO L462 AbstractCegarLoop]: Abstraction has 38522 states and 50891 transitions. [2019-10-07 02:47:24,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 02:47:24,446 INFO L276 IsEmpty]: Start isEmpty. Operand 38522 states and 50891 transitions. [2019-10-07 02:47:24,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-07 02:47:24,456 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 02:47:24,457 INFO L385 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 02:47:24,661 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 02:47:24,661 INFO L410 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 02:47:24,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 02:47:24,662 INFO L82 PathProgramCache]: Analyzing trace with hash 700886345, now seen corresponding path program 1 times [2019-10-07 02:47:24,662 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 02:47:24,662 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 02:47:24,662 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 02:47:24,662 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 02:47:24,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 02:47:24,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 02:47:25,072 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 15 proven. 54 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-07 02:47:25,072 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 02:47:25,072 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 02:47:25,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 02:47:25,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 02:47:25,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-07 02:47:25,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 02:47:25,219 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-07 02:47:25,219 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 02:47:25,278 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-07 02:47:25,278 INFO L211 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-07 02:47:25,279 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 9 [2019-10-07 02:47:25,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 02:47:25,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 02:47:25,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-10-07 02:47:25,280 INFO L87 Difference]: Start difference. First operand 38522 states and 50891 transitions. Second operand 3 states. [2019-10-07 02:47:30,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 02:47:30,543 INFO L93 Difference]: Finished difference Result 82846 states and 111130 transitions. [2019-10-07 02:47:30,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 02:47:30,543 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-10-07 02:47:30,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 02:47:31,020 INFO L225 Difference]: With dead ends: 82846 [2019-10-07 02:47:31,020 INFO L226 Difference]: Without dead ends: 44714 [2019-10-07 02:47:31,088 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 205 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-10-07 02:47:31,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44714 states. [2019-10-07 02:47:31,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44714 to 40986. [2019-10-07 02:47:31,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40986 states. [2019-10-07 02:47:31,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40986 states to 40986 states and 52325 transitions. [2019-10-07 02:47:31,793 INFO L78 Accepts]: Start accepts. Automaton has 40986 states and 52325 transitions. Word has length 102 [2019-10-07 02:47:31,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 02:47:31,793 INFO L462 AbstractCegarLoop]: Abstraction has 40986 states and 52325 transitions. [2019-10-07 02:47:31,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 02:47:31,793 INFO L276 IsEmpty]: Start isEmpty. Operand 40986 states and 52325 transitions. [2019-10-07 02:47:31,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-07 02:47:31,796 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 02:47:31,796 INFO L385 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 02:47:32,000 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 02:47:32,001 INFO L410 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 02:47:32,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 02:47:32,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1202312867, now seen corresponding path program 1 times [2019-10-07 02:47:32,003 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 02:47:32,003 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 02:47:32,003 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 02:47:32,004 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 02:47:32,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 02:47:32,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 02:47:32,150 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-10-07 02:47:32,151 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 02:47:32,151 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 02:47:32,151 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 02:47:32,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 02:47:32,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 02:47:32,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 02:47:32,153 INFO L87 Difference]: Start difference. First operand 40986 states and 52325 transitions. Second operand 4 states. [2019-10-07 02:47:41,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 02:47:41,412 INFO L93 Difference]: Finished difference Result 106159 states and 140910 transitions. [2019-10-07 02:47:41,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 02:47:41,412 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2019-10-07 02:47:41,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 02:47:41,596 INFO L225 Difference]: With dead ends: 106159 [2019-10-07 02:47:41,596 INFO L226 Difference]: Without dead ends: 65563 [2019-10-07 02:47:41,686 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 02:47:41,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65563 states. [2019-10-07 02:47:42,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65563 to 63291. [2019-10-07 02:47:42,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63291 states. [2019-10-07 02:47:43,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63291 states to 63291 states and 79038 transitions. [2019-10-07 02:47:43,133 INFO L78 Accepts]: Start accepts. Automaton has 63291 states and 79038 transitions. Word has length 125 [2019-10-07 02:47:43,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 02:47:43,134 INFO L462 AbstractCegarLoop]: Abstraction has 63291 states and 79038 transitions. [2019-10-07 02:47:43,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 02:47:43,135 INFO L276 IsEmpty]: Start isEmpty. Operand 63291 states and 79038 transitions. [2019-10-07 02:47:43,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-07 02:47:43,141 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 02:47:43,141 INFO L385 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 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-10-07 02:47:43,141 INFO L410 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 02:47:43,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 02:47:43,142 INFO L82 PathProgramCache]: Analyzing trace with hash -102565097, now seen corresponding path program 1 times [2019-10-07 02:47:43,142 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 02:47:43,142 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 02:47:43,142 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 02:47:43,143 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 02:47:43,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 02:47:43,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 02:47:43,379 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 107 proven. 32 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-10-07 02:47:43,379 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 02:47:43,380 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 02:47:43,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 02:47:43,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 02:47:43,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 866 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-07 02:47:43,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 02:47:43,612 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 189 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-10-07 02:47:43,612 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 02:47:43,703 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 107 proven. 32 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-10-07 02:47:43,703 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 02:47:43,739 INFO L162 IcfgInterpreter]: Started Sifa with 59 locations of interest [2019-10-07 02:47:43,739 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 02:47:43,746 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 02:47:43,755 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 02:47:43,755 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 02:47:43,923 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 59 for LOIs [2019-10-07 02:47:44,072 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 49 [2019-10-07 02:47:44,566 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 8490 conjuctions. This might take some time... [2019-10-07 02:47:44,788 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 49 [2019-10-07 02:47:45,128 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 8490 conjuctions. This might take some time... [2019-10-07 02:47:45,293 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-07 02:47:45,321 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-10-07 02:47:46,610 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 02:47:46,611 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: assume true; at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:133) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: assume true; at de.uni_freiburg.informatik.ultimate.lib.sifa.PriorityWorklist.add(PriorityWorklist.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.lambda$2(DagInterpreter.java:135) at java.lang.Iterable.forEach(Iterable.java:75) at java.util.Collections$UnmodifiableCollection.forEach(Collections.java:1080) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:135) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:104) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.computeTopSummary(TopInputCallSummarizer.java:78) at java.util.HashMap.computeIfAbsent(HashMap.java:1127) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.summarize(TopInputCallSummarizer.java:67) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretCallReturnSummary(DagInterpreter.java:230) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:214) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:197) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:166) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:130) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:104) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarizeInternal(FixpointLoopSummarizer.java:118) at java.util.HashMap.computeIfAbsent(HashMap.java:1127) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:178) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:169) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:130) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:139) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:99) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:99) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:287) ... 21 more [2019-10-07 02:47:46,618 INFO L168 Benchmark]: Toolchain (without parser) took 162388.14 ms. Allocated memory was 144.7 MB in the beginning and 1.6 GB in the end (delta: 1.5 GB). Free memory was 86.2 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-10-07 02:47:46,619 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 144.7 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-07 02:47:46,620 INFO L168 Benchmark]: CACSL2BoogieTranslator took 3046.15 ms. Allocated memory was 144.7 MB in the beginning and 258.5 MB in the end (delta: 113.8 MB). Free memory was 85.9 MB in the beginning and 136.1 MB in the end (delta: -50.1 MB). Peak memory consumption was 112.9 MB. Max. memory is 7.1 GB. [2019-10-07 02:47:46,621 INFO L168 Benchmark]: Boogie Preprocessor took 390.55 ms. Allocated memory is still 258.5 MB. Free memory was 136.1 MB in the beginning and 97.0 MB in the end (delta: 39.1 MB). Peak memory consumption was 39.1 MB. Max. memory is 7.1 GB. [2019-10-07 02:47:46,622 INFO L168 Benchmark]: RCFGBuilder took 67833.84 ms. Allocated memory was 258.5 MB in the beginning and 666.9 MB in the end (delta: 408.4 MB). Free memory was 97.0 MB in the beginning and 348.6 MB in the end (delta: -251.6 MB). Peak memory consumption was 380.3 MB. Max. memory is 7.1 GB. [2019-10-07 02:47:46,625 INFO L168 Benchmark]: TraceAbstraction took 91113.18 ms. Allocated memory was 666.9 MB in the beginning and 1.6 GB in the end (delta: 949.0 MB). Free memory was 348.6 MB in the beginning and 1.1 GB in the end (delta: -776.5 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-10-07 02:47:46,633 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 144.7 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 3046.15 ms. Allocated memory was 144.7 MB in the beginning and 258.5 MB in the end (delta: 113.8 MB). Free memory was 85.9 MB in the beginning and 136.1 MB in the end (delta: -50.1 MB). Peak memory consumption was 112.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 390.55 ms. Allocated memory is still 258.5 MB. Free memory was 136.1 MB in the beginning and 97.0 MB in the end (delta: 39.1 MB). Peak memory consumption was 39.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 67833.84 ms. Allocated memory was 258.5 MB in the beginning and 666.9 MB in the end (delta: 408.4 MB). Free memory was 97.0 MB in the beginning and 348.6 MB in the end (delta: -251.6 MB). Peak memory consumption was 380.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 91113.18 ms. Allocated memory was 666.9 MB in the beginning and 1.6 GB in the end (delta: 949.0 MB). Free memory was 348.6 MB in the beginning and 1.1 GB in the end (delta: -776.5 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: assume true; de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: assume true;: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:295) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...