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/Problem15_label28.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 03:30:05,642 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 03:30:05,644 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 03:30:05,658 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 03:30:05,658 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 03:30:05,659 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 03:30:05,661 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 03:30:05,662 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 03:30:05,664 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 03:30:05,665 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 03:30:05,666 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 03:30:05,667 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 03:30:05,667 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 03:30:05,668 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 03:30:05,669 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 03:30:05,670 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 03:30:05,671 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 03:30:05,672 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 03:30:05,673 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 03:30:05,675 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 03:30:05,676 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 03:30:05,677 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 03:30:05,678 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 03:30:05,679 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 03:30:05,681 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 03:30:05,681 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 03:30:05,682 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 03:30:05,682 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 03:30:05,683 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 03:30:05,684 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 03:30:05,684 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 03:30:05,685 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 03:30:05,685 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 03:30:05,686 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 03:30:05,687 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 03:30:05,687 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 03:30:05,688 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 03:30:05,688 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 03:30:05,688 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 03:30:05,689 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 03:30:05,691 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 03:30:05,692 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 03:30:05,706 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 03:30:05,706 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 03:30:05,707 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 03:30:05,708 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 03:30:05,708 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 03:30:05,708 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 03:30:05,708 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 03:30:05,709 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 03:30:05,709 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 03:30:05,709 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 03:30:05,709 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 03:30:05,709 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 03:30:05,710 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 03:30:05,710 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 03:30:05,710 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 03:30:05,710 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 03:30:05,710 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 03:30:05,711 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 03:30:05,711 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 03:30:05,711 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 03:30:05,711 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 03:30:05,712 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 03:30:05,712 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 03:30:05,712 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 03:30:05,712 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 03:30:05,712 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 03:30:05,713 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 03:30:05,713 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 03:30:05,713 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 03:30:06,045 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 03:30:06,061 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 03:30:06,066 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 03:30:06,069 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 03:30:06,069 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 03:30:06,070 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem15_label28.c [2019-10-07 03:30:06,139 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/634f0216a/587dccfcf1a047009b86247d058d8c9f/FLAG6bd6a54e0 [2019-10-07 03:30:06,757 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 03:30:06,758 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem15_label28.c [2019-10-07 03:30:06,783 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/634f0216a/587dccfcf1a047009b86247d058d8c9f/FLAG6bd6a54e0 [2019-10-07 03:30:06,940 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/634f0216a/587dccfcf1a047009b86247d058d8c9f [2019-10-07 03:30:06,951 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 03:30:06,954 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 03:30:06,956 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 03:30:06,956 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 03:30:06,959 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 03:30:06,960 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:30:06" (1/1) ... [2019-10-07 03:30:06,963 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bfc0887 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:30:06, skipping insertion in model container [2019-10-07 03:30:06,963 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:30:06" (1/1) ... [2019-10-07 03:30:06,972 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 03:30:07,060 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 03:30:07,999 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 03:30:08,008 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 03:30:08,390 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 03:30:08,410 INFO L192 MainTranslator]: Completed translation [2019-10-07 03:30:08,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:30:08 WrapperNode [2019-10-07 03:30:08,411 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 03:30:08,413 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 03:30:08,413 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 03:30:08,413 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 03:30:08,427 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:30:08" (1/1) ... [2019-10-07 03:30:08,427 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:30:08" (1/1) ... [2019-10-07 03:30:08,472 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:30:08" (1/1) ... [2019-10-07 03:30:08,473 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:30:08" (1/1) ... [2019-10-07 03:30:08,546 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:30:08" (1/1) ... [2019-10-07 03:30:08,580 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:30:08" (1/1) ... [2019-10-07 03:30:08,610 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:30:08" (1/1) ... [2019-10-07 03:30:08,625 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 03:30:08,626 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 03:30:08,626 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 03:30:08,626 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 03:30:08,628 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:30:08" (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 03:30:08,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 03:30:08,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 03:30:08,700 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-07 03:30:08,700 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-10-07 03:30:08,700 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 03:30:08,701 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-07 03:30:08,701 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-10-07 03:30:08,701 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 03:30:08,702 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 03:30:08,702 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-07 03:30:08,702 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 03:30:08,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 03:30:08,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 03:30:22,849 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 03:30:22,850 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-07 03:30:22,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:30:22 BoogieIcfgContainer [2019-10-07 03:30:22,851 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 03:30:22,853 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 03:30:22,853 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 03:30:22,856 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 03:30:22,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 03:30:06" (1/3) ... [2019-10-07 03:30:22,857 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b839307 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:30:22, skipping insertion in model container [2019-10-07 03:30:22,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:30:08" (2/3) ... [2019-10-07 03:30:22,858 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b839307 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:30:22, skipping insertion in model container [2019-10-07 03:30:22,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:30:22" (3/3) ... [2019-10-07 03:30:22,860 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem15_label28.c [2019-10-07 03:30:22,869 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 03:30:22,876 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 03:30:22,886 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 03:30:22,913 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 03:30:22,914 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 03:30:22,914 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 03:30:22,914 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 03:30:22,914 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 03:30:22,915 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 03:30:22,915 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 03:30:22,915 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 03:30:22,939 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states. [2019-10-07 03:30:22,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-07 03:30:22,945 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:30:22,946 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:30:22,948 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:30:22,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:30:22,954 INFO L82 PathProgramCache]: Analyzing trace with hash 648047469, now seen corresponding path program 1 times [2019-10-07 03:30:22,963 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:30:22,963 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:30:22,963 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:30:22,963 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:30:22,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:30:23,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:30:23,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:30:23,288 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:30:23,289 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:30:23,289 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 03:30:23,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 03:30:23,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 03:30:23,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 03:30:23,309 INFO L87 Difference]: Start difference. First operand 244 states. Second operand 3 states. [2019-10-07 03:30:25,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:30:25,504 INFO L93 Difference]: Finished difference Result 718 states and 1389 transitions. [2019-10-07 03:30:25,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 03:30:25,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-10-07 03:30:25,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:30:25,524 INFO L225 Difference]: With dead ends: 718 [2019-10-07 03:30:25,524 INFO L226 Difference]: Without dead ends: 471 [2019-10-07 03:30:25,532 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 3 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 03:30:25,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2019-10-07 03:30:25,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 464. [2019-10-07 03:30:25,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-10-07 03:30:25,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 869 transitions. [2019-10-07 03:30:25,616 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 869 transitions. Word has length 11 [2019-10-07 03:30:25,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:30:25,617 INFO L462 AbstractCegarLoop]: Abstraction has 464 states and 869 transitions. [2019-10-07 03:30:25,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 03:30:25,617 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 869 transitions. [2019-10-07 03:30:25,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-07 03:30:25,619 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:30:25,619 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] [2019-10-07 03:30:25,619 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:30:25,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:30:25,620 INFO L82 PathProgramCache]: Analyzing trace with hash 651138748, now seen corresponding path program 1 times [2019-10-07 03:30:25,620 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:30:25,620 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:30:25,621 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:30:25,621 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:30:25,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:30:25,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:30:25,757 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 03:30:25,757 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:30:25,758 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:30:25,758 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 03:30:25,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 03:30:25,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 03:30:25,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 03:30:25,763 INFO L87 Difference]: Start difference. First operand 464 states and 869 transitions. Second operand 5 states. [2019-10-07 03:30:29,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:30:29,257 INFO L93 Difference]: Finished difference Result 1404 states and 2646 transitions. [2019-10-07 03:30:29,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 03:30:29,258 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-10-07 03:30:29,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:30:29,267 INFO L225 Difference]: With dead ends: 1404 [2019-10-07 03:30:29,267 INFO L226 Difference]: Without dead ends: 945 [2019-10-07 03:30:29,269 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 03:30:29,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2019-10-07 03:30:29,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 893. [2019-10-07 03:30:29,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 893 states. [2019-10-07 03:30:29,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1396 transitions. [2019-10-07 03:30:29,354 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1396 transitions. Word has length 28 [2019-10-07 03:30:29,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:30:29,355 INFO L462 AbstractCegarLoop]: Abstraction has 893 states and 1396 transitions. [2019-10-07 03:30:29,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 03:30:29,355 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1396 transitions. [2019-10-07 03:30:29,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-07 03:30:29,357 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:30:29,357 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] [2019-10-07 03:30:29,357 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:30:29,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:30:29,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1245662046, now seen corresponding path program 1 times [2019-10-07 03:30:29,358 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:30:29,358 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:30:29,358 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:30:29,358 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:30:29,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:30:29,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:30:29,546 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 03:30:29,546 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:30:29,547 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:30:29,547 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 03:30:29,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 03:30:29,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 03:30:29,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-07 03:30:29,550 INFO L87 Difference]: Start difference. First operand 893 states and 1396 transitions. Second operand 6 states. [2019-10-07 03:30:33,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:30:33,469 INFO L93 Difference]: Finished difference Result 2711 states and 4360 transitions. [2019-10-07 03:30:33,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-07 03:30:33,471 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-10-07 03:30:33,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:30:33,492 INFO L225 Difference]: With dead ends: 2711 [2019-10-07 03:30:33,492 INFO L226 Difference]: Without dead ends: 1823 [2019-10-07 03:30:33,495 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-07 03:30:33,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1823 states. [2019-10-07 03:30:33,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1823 to 1797. [2019-10-07 03:30:33,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1797 states. [2019-10-07 03:30:33,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2772 transitions. [2019-10-07 03:30:33,560 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2772 transitions. Word has length 36 [2019-10-07 03:30:33,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:30:33,560 INFO L462 AbstractCegarLoop]: Abstraction has 1797 states and 2772 transitions. [2019-10-07 03:30:33,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 03:30:33,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2772 transitions. [2019-10-07 03:30:33,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-07 03:30:33,562 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:30:33,563 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-07 03:30:33,563 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:30:33,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:30:33,563 INFO L82 PathProgramCache]: Analyzing trace with hash -241648939, now seen corresponding path program 1 times [2019-10-07 03:30:33,564 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:30:33,564 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:30:33,564 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:30:33,564 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:30:33,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:30:33,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:30:33,722 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-07 03:30:33,723 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:30:33,723 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:30:33,723 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 03:30:33,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 03:30:33,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 03:30:33,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 03:30:33,724 INFO L87 Difference]: Start difference. First operand 1797 states and 2772 transitions. Second operand 4 states. [2019-10-07 03:30:37,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:30:37,669 INFO L93 Difference]: Finished difference Result 6291 states and 9870 transitions. [2019-10-07 03:30:37,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 03:30:37,673 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-10-07 03:30:37,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:30:37,705 INFO L225 Difference]: With dead ends: 6291 [2019-10-07 03:30:37,705 INFO L226 Difference]: Without dead ends: 4499 [2019-10-07 03:30:37,711 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 03:30:37,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4499 states. [2019-10-07 03:30:37,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4499 to 3917. [2019-10-07 03:30:37,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3917 states. [2019-10-07 03:30:37,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3917 states to 3917 states and 5922 transitions. [2019-10-07 03:30:37,834 INFO L78 Accepts]: Start accepts. Automaton has 3917 states and 5922 transitions. Word has length 49 [2019-10-07 03:30:37,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:30:37,835 INFO L462 AbstractCegarLoop]: Abstraction has 3917 states and 5922 transitions. [2019-10-07 03:30:37,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 03:30:37,835 INFO L276 IsEmpty]: Start isEmpty. Operand 3917 states and 5922 transitions. [2019-10-07 03:30:37,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-07 03:30:37,844 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:30:37,845 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] [2019-10-07 03:30:37,845 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:30:37,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:30:37,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1815883181, now seen corresponding path program 1 times [2019-10-07 03:30:37,846 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:30:37,846 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:30:37,846 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:30:37,846 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:30:37,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:30:37,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:30:37,959 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 03:30:37,959 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:30:37,959 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:30:37,960 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 03:30:37,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 03:30:37,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 03:30:37,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 03:30:37,961 INFO L87 Difference]: Start difference. First operand 3917 states and 5922 transitions. Second operand 5 states. [2019-10-07 03:30:42,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:30:42,548 INFO L93 Difference]: Finished difference Result 9224 states and 14286 transitions. [2019-10-07 03:30:42,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 03:30:42,553 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-10-07 03:30:42,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:30:42,581 INFO L225 Difference]: With dead ends: 9224 [2019-10-07 03:30:42,581 INFO L226 Difference]: Without dead ends: 5312 [2019-10-07 03:30:42,593 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 03:30:42,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5312 states. [2019-10-07 03:30:42,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5312 to 5290. [2019-10-07 03:30:42,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5290 states. [2019-10-07 03:30:42,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5290 states to 5290 states and 8014 transitions. [2019-10-07 03:30:42,743 INFO L78 Accepts]: Start accepts. Automaton has 5290 states and 8014 transitions. Word has length 48 [2019-10-07 03:30:42,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:30:42,744 INFO L462 AbstractCegarLoop]: Abstraction has 5290 states and 8014 transitions. [2019-10-07 03:30:42,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 03:30:42,744 INFO L276 IsEmpty]: Start isEmpty. Operand 5290 states and 8014 transitions. [2019-10-07 03:30:42,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-07 03:30:42,746 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:30:42,746 INFO L385 BasicCegarLoop]: trace histogram [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, 1, 1] [2019-10-07 03:30:42,746 INFO L410 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:30:42,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:30:42,747 INFO L82 PathProgramCache]: Analyzing trace with hash 219952470, now seen corresponding path program 1 times [2019-10-07 03:30:42,747 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:30:42,747 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:30:42,747 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:30:42,748 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:30:42,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:30:42,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:30:42,844 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-07 03:30:42,844 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:30:42,844 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:30:42,845 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 03:30:42,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 03:30:42,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 03:30:42,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 03:30:42,846 INFO L87 Difference]: Start difference. First operand 5290 states and 8014 transitions. Second operand 3 states. [2019-10-07 03:30:44,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:30:44,625 INFO L93 Difference]: Finished difference Result 13779 states and 21262 transitions. [2019-10-07 03:30:44,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 03:30:44,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-10-07 03:30:44,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:30:44,666 INFO L225 Difference]: With dead ends: 13779 [2019-10-07 03:30:44,666 INFO L226 Difference]: Without dead ends: 8494 [2019-10-07 03:30:44,684 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 03:30:44,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8494 states. [2019-10-07 03:30:44,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8494 to 6778. [2019-10-07 03:30:44,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6778 states. [2019-10-07 03:30:44,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6778 states to 6778 states and 9508 transitions. [2019-10-07 03:30:44,877 INFO L78 Accepts]: Start accepts. Automaton has 6778 states and 9508 transitions. Word has length 61 [2019-10-07 03:30:44,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:30:44,881 INFO L462 AbstractCegarLoop]: Abstraction has 6778 states and 9508 transitions. [2019-10-07 03:30:44,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 03:30:44,881 INFO L276 IsEmpty]: Start isEmpty. Operand 6778 states and 9508 transitions. [2019-10-07 03:30:44,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-07 03:30:44,889 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:30:44,892 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] [2019-10-07 03:30:44,893 INFO L410 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:30:44,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:30:44,898 INFO L82 PathProgramCache]: Analyzing trace with hash 425788068, now seen corresponding path program 1 times [2019-10-07 03:30:44,899 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:30:44,899 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:30:44,899 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:30:44,899 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:30:44,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:30:44,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:30:45,076 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:30:45,078 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:30:45,078 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 03:30:45,078 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 03:30:45,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:30:45,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-07 03:30:45,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 03:30:45,267 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 03:30:45,267 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 03:30:45,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:30:45,508 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 03:30:45,508 INFO L211 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-07 03:30:45,509 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [7] total 11 [2019-10-07 03:30:45,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-07 03:30:45,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-07 03:30:45,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-10-07 03:30:45,511 INFO L87 Difference]: Start difference. First operand 6778 states and 9508 transitions. Second operand 7 states. [2019-10-07 03:30:52,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:30:52,571 INFO L93 Difference]: Finished difference Result 15453 states and 21969 transitions. [2019-10-07 03:30:52,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-07 03:30:52,572 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-10-07 03:30:52,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:30:52,634 INFO L225 Difference]: With dead ends: 15453 [2019-10-07 03:30:52,634 INFO L226 Difference]: Without dead ends: 8680 [2019-10-07 03:30:52,653 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-10-07 03:30:52,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8680 states. [2019-10-07 03:30:52,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8680 to 7770. [2019-10-07 03:30:52,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7770 states. [2019-10-07 03:30:52,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7770 states to 7770 states and 10841 transitions. [2019-10-07 03:30:52,981 INFO L78 Accepts]: Start accepts. Automaton has 7770 states and 10841 transitions. Word has length 63 [2019-10-07 03:30:52,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:30:52,982 INFO L462 AbstractCegarLoop]: Abstraction has 7770 states and 10841 transitions. [2019-10-07 03:30:52,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-07 03:30:52,982 INFO L276 IsEmpty]: Start isEmpty. Operand 7770 states and 10841 transitions. [2019-10-07 03:30:52,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-07 03:30:52,984 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:30:52,985 INFO L385 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-07 03:30:53,188 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:30:53,190 INFO L410 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:30:53,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:30:53,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1540825275, now seen corresponding path program 1 times [2019-10-07 03:30:53,193 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:30:53,193 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:30:53,193 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:30:53,193 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:30:53,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:30:53,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:30:53,326 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 54 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-07 03:30:53,326 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:30:53,326 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 03:30:53,326 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 03:30:53,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:30:53,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-07 03:30:53,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 03:30:53,496 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 54 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-07 03:30:53,496 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 03:30:53,568 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 54 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-07 03:30:53,569 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 03:30:53,598 INFO L162 IcfgInterpreter]: Started Sifa with 44 locations of interest [2019-10-07 03:30:53,598 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 03:30:53,604 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 03:30:53,622 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 03:30:53,623 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 03:30:53,818 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 56 for LOIs [2019-10-07 03:30:53,971 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 26 [2019-10-07 03:30:54,245 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 6894 conjuctions. This might take some time... [2019-10-07 03:30:54,552 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 26 [2019-10-07 03:30:54,737 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 6894 conjuctions. This might take some time... [2019-10-07 03:30:54,932 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 35 [2019-10-07 03:30:55,205 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 5592 conjuctions. This might take some time... [2019-10-07 03:30:55,347 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 35 [2019-10-07 03:30:55,488 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 5592 conjuctions. This might take some time... [2019-10-07 03:30:56,447 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:30:56,449 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 03:30:56,455 INFO L168 Benchmark]: Toolchain (without parser) took 49500.14 ms. Allocated memory was 136.8 MB in the beginning and 651.2 MB in the end (delta: 514.3 MB). Free memory was 96.4 MB in the beginning and 540.3 MB in the end (delta: -443.8 MB). Peak memory consumption was 495.5 MB. Max. memory is 7.1 GB. [2019-10-07 03:30:56,456 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 136.8 MB. Free memory was 120.1 MB in the beginning and 119.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-10-07 03:30:56,457 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1456.41 ms. Allocated memory was 136.8 MB in the beginning and 203.9 MB in the end (delta: 67.1 MB). Free memory was 96.2 MB in the beginning and 106.8 MB in the end (delta: -10.6 MB). Peak memory consumption was 61.8 MB. Max. memory is 7.1 GB. [2019-10-07 03:30:56,461 INFO L168 Benchmark]: Boogie Preprocessor took 213.07 ms. Allocated memory is still 203.9 MB. Free memory was 106.8 MB in the beginning and 93.7 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. [2019-10-07 03:30:56,464 INFO L168 Benchmark]: RCFGBuilder took 14225.38 ms. Allocated memory was 203.9 MB in the beginning and 315.1 MB in the end (delta: 111.1 MB). Free memory was 93.7 MB in the beginning and 86.7 MB in the end (delta: 7.0 MB). Peak memory consumption was 118.2 MB. Max. memory is 7.1 GB. [2019-10-07 03:30:56,465 INFO L168 Benchmark]: TraceAbstraction took 33600.03 ms. Allocated memory was 315.1 MB in the beginning and 651.2 MB in the end (delta: 336.1 MB). Free memory was 86.7 MB in the beginning and 540.3 MB in the end (delta: -453.6 MB). Peak memory consumption was 307.5 MB. Max. memory is 7.1 GB. [2019-10-07 03:30:56,477 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.22 ms. Allocated memory is still 136.8 MB. Free memory was 120.1 MB in the beginning and 119.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1456.41 ms. Allocated memory was 136.8 MB in the beginning and 203.9 MB in the end (delta: 67.1 MB). Free memory was 96.2 MB in the beginning and 106.8 MB in the end (delta: -10.6 MB). Peak memory consumption was 61.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 213.07 ms. Allocated memory is still 203.9 MB. Free memory was 106.8 MB in the beginning and 93.7 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 14225.38 ms. Allocated memory was 203.9 MB in the beginning and 315.1 MB in the end (delta: 111.1 MB). Free memory was 93.7 MB in the beginning and 86.7 MB in the end (delta: 7.0 MB). Peak memory consumption was 118.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 33600.03 ms. Allocated memory was 315.1 MB in the beginning and 651.2 MB in the end (delta: 336.1 MB). Free memory was 86.7 MB in the beginning and 540.3 MB in the end (delta: -453.6 MB). Peak memory consumption was 307.5 MB. 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...