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/Problem03_label08.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 00:58:33,593 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 00:58:33,596 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 00:58:33,614 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 00:58:33,615 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 00:58:33,617 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 00:58:33,619 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 00:58:33,628 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 00:58:33,631 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 00:58:33,634 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 00:58:33,636 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 00:58:33,637 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 00:58:33,638 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 00:58:33,640 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 00:58:33,642 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 00:58:33,644 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 00:58:33,646 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 00:58:33,648 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 00:58:33,649 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 00:58:33,655 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 00:58:33,659 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 00:58:33,662 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 00:58:33,664 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 00:58:33,664 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 00:58:33,669 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 00:58:33,670 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 00:58:33,670 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 00:58:33,673 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 00:58:33,675 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 00:58:33,676 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 00:58:33,676 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 00:58:33,678 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 00:58:33,679 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 00:58:33,680 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 00:58:33,682 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 00:58:33,682 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 00:58:33,683 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 00:58:33,683 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 00:58:33,683 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 00:58:33,685 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 00:58:33,686 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 00:58:33,687 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 00:58:33,704 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 00:58:33,705 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 00:58:33,706 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 00:58:33,706 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 00:58:33,706 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 00:58:33,706 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 00:58:33,707 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 00:58:33,707 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 00:58:33,707 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 00:58:33,707 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 00:58:33,707 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 00:58:33,708 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 00:58:33,708 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 00:58:33,708 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 00:58:33,708 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 00:58:33,708 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 00:58:33,709 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 00:58:33,709 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 00:58:33,709 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 00:58:33,709 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 00:58:33,709 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 00:58:33,710 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 00:58:33,710 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 00:58:33,710 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 00:58:33,710 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 00:58:33,710 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 00:58:33,711 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 00:58:33,711 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 00:58:33,711 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 00:58:33,983 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 00:58:34,004 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 00:58:34,007 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 00:58:34,009 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 00:58:34,009 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 00:58:34,010 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label08.c [2019-10-07 00:58:34,097 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2aded3227/8fb9a3cd7813488f807ca578d6dd1ade/FLAG10f5a4a0e [2019-10-07 00:58:34,800 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 00:58:34,802 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label08.c [2019-10-07 00:58:34,822 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2aded3227/8fb9a3cd7813488f807ca578d6dd1ade/FLAG10f5a4a0e [2019-10-07 00:58:34,973 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2aded3227/8fb9a3cd7813488f807ca578d6dd1ade [2019-10-07 00:58:34,983 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 00:58:34,985 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 00:58:34,986 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 00:58:34,986 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 00:58:34,989 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 00:58:34,990 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:58:34" (1/1) ... [2019-10-07 00:58:34,992 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@447ef4f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:34, skipping insertion in model container [2019-10-07 00:58:34,993 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:58:34" (1/1) ... [2019-10-07 00:58:35,000 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 00:58:35,070 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 00:58:35,866 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:58:35,882 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 00:58:36,352 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:58:36,379 INFO L192 MainTranslator]: Completed translation [2019-10-07 00:58:36,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:36 WrapperNode [2019-10-07 00:58:36,380 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 00:58:36,381 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 00:58:36,382 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 00:58:36,382 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 00:58:36,397 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:36" (1/1) ... [2019-10-07 00:58:36,397 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:36" (1/1) ... [2019-10-07 00:58:36,454 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:36" (1/1) ... [2019-10-07 00:58:36,454 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:36" (1/1) ... [2019-10-07 00:58:36,523 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:36" (1/1) ... [2019-10-07 00:58:36,538 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:36" (1/1) ... [2019-10-07 00:58:36,561 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:36" (1/1) ... [2019-10-07 00:58:36,581 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 00:58:36,582 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 00:58:36,582 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 00:58:36,582 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 00:58:36,583 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:36" (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 00:58:36,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 00:58:36,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 00:58:36,666 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-07 00:58:36,667 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 00:58:36,667 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-07 00:58:36,668 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 00:58:36,669 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 00:58:36,669 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-07 00:58:36,670 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 00:58:36,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 00:58:36,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 00:58:39,803 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 00:58:39,804 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-07 00:58:39,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:58:39 BoogieIcfgContainer [2019-10-07 00:58:39,805 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 00:58:39,806 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 00:58:39,807 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 00:58:39,810 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 00:58:39,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 12:58:34" (1/3) ... [2019-10-07 00:58:39,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10478070 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:58:39, skipping insertion in model container [2019-10-07 00:58:39,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:58:36" (2/3) ... [2019-10-07 00:58:39,812 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10478070 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:58:39, skipping insertion in model container [2019-10-07 00:58:39,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:58:39" (3/3) ... [2019-10-07 00:58:39,814 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label08.c [2019-10-07 00:58:39,824 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 00:58:39,832 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 00:58:39,843 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 00:58:39,871 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 00:58:39,871 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 00:58:39,871 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 00:58:39,871 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 00:58:39,871 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 00:58:39,872 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 00:58:39,872 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 00:58:39,872 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 00:58:39,895 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states. [2019-10-07 00:58:39,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-07 00:58:39,909 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:58:39,911 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:58:39,913 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:58:39,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:58:39,919 INFO L82 PathProgramCache]: Analyzing trace with hash 136467238, now seen corresponding path program 1 times [2019-10-07 00:58:39,928 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:58:39,929 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:39,929 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:39,929 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:39,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:58:40,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:58:40,717 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 00:58:40,718 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:40,719 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:58:40,719 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:58:40,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:58:40,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:58:40,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:58:40,742 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 3 states. [2019-10-07 00:58:41,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:58:41,973 INFO L93 Difference]: Finished difference Result 462 states and 886 transitions. [2019-10-07 00:58:41,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:58:41,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-10-07 00:58:41,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:58:41,995 INFO L225 Difference]: With dead ends: 462 [2019-10-07 00:58:41,995 INFO L226 Difference]: Without dead ends: 301 [2019-10-07 00:58:42,000 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 00:58:42,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-10-07 00:58:42,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2019-10-07 00:58:42,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-10-07 00:58:42,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 564 transitions. [2019-10-07 00:58:42,111 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 564 transitions. Word has length 149 [2019-10-07 00:58:42,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:58:42,114 INFO L462 AbstractCegarLoop]: Abstraction has 301 states and 564 transitions. [2019-10-07 00:58:42,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:58:42,115 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 564 transitions. [2019-10-07 00:58:42,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-07 00:58:42,126 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:58:42,127 INFO L385 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:58:42,127 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:58:42,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:58:42,128 INFO L82 PathProgramCache]: Analyzing trace with hash 558837181, now seen corresponding path program 1 times [2019-10-07 00:58:42,129 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:58:42,129 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:42,130 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:42,130 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:42,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:58:42,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:58:42,365 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:58:42,366 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:42,366 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:58:42,366 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 00:58:42,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 00:58:42,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 00:58:42,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-07 00:58:42,370 INFO L87 Difference]: Start difference. First operand 301 states and 564 transitions. Second operand 6 states. [2019-10-07 00:58:43,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:58:43,829 INFO L93 Difference]: Finished difference Result 929 states and 1794 transitions. [2019-10-07 00:58:43,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 00:58:43,830 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 158 [2019-10-07 00:58:43,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:58:43,840 INFO L225 Difference]: With dead ends: 929 [2019-10-07 00:58:43,841 INFO L226 Difference]: Without dead ends: 633 [2019-10-07 00:58:43,845 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-07 00:58:43,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2019-10-07 00:58:43,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 603. [2019-10-07 00:58:43,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2019-10-07 00:58:43,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 1113 transitions. [2019-10-07 00:58:43,939 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 1113 transitions. Word has length 158 [2019-10-07 00:58:43,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:58:43,940 INFO L462 AbstractCegarLoop]: Abstraction has 603 states and 1113 transitions. [2019-10-07 00:58:43,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 00:58:43,940 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 1113 transitions. [2019-10-07 00:58:43,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-07 00:58:43,949 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:58:43,950 INFO L385 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:58:43,950 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:58:43,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:58:43,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1532434670, now seen corresponding path program 1 times [2019-10-07 00:58:43,951 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:58:43,951 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:43,951 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:43,951 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:43,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:58:44,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:58:44,263 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:58:44,263 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:44,264 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:58:44,264 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:58:44,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:58:44,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:58:44,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:58:44,266 INFO L87 Difference]: Start difference. First operand 603 states and 1113 transitions. Second operand 3 states. [2019-10-07 00:58:45,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:58:45,264 INFO L93 Difference]: Finished difference Result 1793 states and 3387 transitions. [2019-10-07 00:58:45,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:58:45,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-10-07 00:58:45,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:58:45,275 INFO L225 Difference]: With dead ends: 1793 [2019-10-07 00:58:45,276 INFO L226 Difference]: Without dead ends: 1195 [2019-10-07 00:58:45,280 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 00:58:45,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2019-10-07 00:58:45,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 1195. [2019-10-07 00:58:45,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1195 states. [2019-10-07 00:58:45,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1195 states and 2172 transitions. [2019-10-07 00:58:45,362 INFO L78 Accepts]: Start accepts. Automaton has 1195 states and 2172 transitions. Word has length 161 [2019-10-07 00:58:45,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:58:45,372 INFO L462 AbstractCegarLoop]: Abstraction has 1195 states and 2172 transitions. [2019-10-07 00:58:45,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:58:45,373 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 2172 transitions. [2019-10-07 00:58:45,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-10-07 00:58:45,383 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:58:45,384 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:58:45,384 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:58:45,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:58:45,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1729527359, now seen corresponding path program 1 times [2019-10-07 00:58:45,385 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:58:45,386 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:45,386 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:45,386 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:45,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:58:45,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:58:45,545 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 33 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:58:45,545 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:45,545 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:58:45,545 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 00:58:45,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:58:45,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 1015 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-07 00:58:45,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:58:45,967 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-07 00:58:45,967 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:58:46,066 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-07 00:58:46,067 INFO L211 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-07 00:58:46,067 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2019-10-07 00:58:46,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:58:46,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:58:46,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-07 00:58:46,068 INFO L87 Difference]: Start difference. First operand 1195 states and 2172 transitions. Second operand 3 states. [2019-10-07 00:58:47,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:58:47,190 INFO L93 Difference]: Finished difference Result 3571 states and 6683 transitions. [2019-10-07 00:58:47,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:58:47,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2019-10-07 00:58:47,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:58:47,206 INFO L225 Difference]: With dead ends: 3571 [2019-10-07 00:58:47,206 INFO L226 Difference]: Without dead ends: 2381 [2019-10-07 00:58:47,209 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 354 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-07 00:58:47,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2381 states. [2019-10-07 00:58:47,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2381 to 2381. [2019-10-07 00:58:47,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2381 states. [2019-10-07 00:58:47,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2381 states to 2381 states and 4354 transitions. [2019-10-07 00:58:47,291 INFO L78 Accepts]: Start accepts. Automaton has 2381 states and 4354 transitions. Word has length 178 [2019-10-07 00:58:47,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:58:47,292 INFO L462 AbstractCegarLoop]: Abstraction has 2381 states and 4354 transitions. [2019-10-07 00:58:47,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:58:47,292 INFO L276 IsEmpty]: Start isEmpty. Operand 2381 states and 4354 transitions. [2019-10-07 00:58:47,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-10-07 00:58:47,303 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:58:47,303 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:58:47,516 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:58:47,517 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:58:47,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:58:47,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1513048515, now seen corresponding path program 1 times [2019-10-07 00:58:47,517 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:58:47,518 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:47,518 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:47,519 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:47,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:58:47,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:58:47,705 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 54 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:58:47,705 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:47,705 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:58:47,707 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 00:58:48,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:58:48,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 1030 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-07 00:58:48,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:58:48,137 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-07 00:58:48,138 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:58:48,253 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 44 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-07 00:58:48,253 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 00:58:48,253 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 10 [2019-10-07 00:58:48,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 00:58:48,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 00:58:48,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-07 00:58:48,256 INFO L87 Difference]: Start difference. First operand 2381 states and 4354 transitions. Second operand 5 states. [2019-10-07 00:58:49,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:58:49,649 INFO L93 Difference]: Finished difference Result 6055 states and 11499 transitions. [2019-10-07 00:58:49,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 00:58:49,650 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 199 [2019-10-07 00:58:49,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:58:49,687 INFO L225 Difference]: With dead ends: 6055 [2019-10-07 00:58:49,688 INFO L226 Difference]: Without dead ends: 3679 [2019-10-07 00:58:49,696 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 395 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-10-07 00:58:49,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3679 states. [2019-10-07 00:58:49,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3679 to 3641. [2019-10-07 00:58:49,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3641 states. [2019-10-07 00:58:49,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3641 states to 3641 states and 6742 transitions. [2019-10-07 00:58:49,851 INFO L78 Accepts]: Start accepts. Automaton has 3641 states and 6742 transitions. Word has length 199 [2019-10-07 00:58:49,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:58:49,851 INFO L462 AbstractCegarLoop]: Abstraction has 3641 states and 6742 transitions. [2019-10-07 00:58:49,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 00:58:49,852 INFO L276 IsEmpty]: Start isEmpty. Operand 3641 states and 6742 transitions. [2019-10-07 00:58:49,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-10-07 00:58:49,866 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:58:49,866 INFO L385 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:58:50,070 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:58:50,071 INFO L410 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:58:50,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:58:50,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1312405658, now seen corresponding path program 1 times [2019-10-07 00:58:50,071 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:58:50,072 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:50,072 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:50,072 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:50,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:58:50,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:58:50,194 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 45 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-07 00:58:50,195 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:50,195 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:58:50,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 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 00:58:50,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:58:50,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 1026 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-07 00:58:50,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:58:50,562 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-07 00:58:50,562 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:58:50,667 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 45 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-07 00:58:50,668 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 00:58:50,668 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 11 [2019-10-07 00:58:50,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 00:58:50,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 00:58:50,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-10-07 00:58:50,670 INFO L87 Difference]: Start difference. First operand 3641 states and 6742 transitions. Second operand 5 states. [2019-10-07 00:58:52,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:58:52,012 INFO L93 Difference]: Finished difference Result 10626 states and 21377 transitions. [2019-10-07 00:58:52,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 00:58:52,013 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 200 [2019-10-07 00:58:52,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:58:52,064 INFO L225 Difference]: With dead ends: 10626 [2019-10-07 00:58:52,065 INFO L226 Difference]: Without dead ends: 6990 [2019-10-07 00:58:52,080 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 395 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-10-07 00:58:52,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6990 states. [2019-10-07 00:58:52,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6990 to 6892. [2019-10-07 00:58:52,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6892 states. [2019-10-07 00:58:52,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6892 states to 6892 states and 12420 transitions. [2019-10-07 00:58:52,408 INFO L78 Accepts]: Start accepts. Automaton has 6892 states and 12420 transitions. Word has length 200 [2019-10-07 00:58:52,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:58:52,408 INFO L462 AbstractCegarLoop]: Abstraction has 6892 states and 12420 transitions. [2019-10-07 00:58:52,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 00:58:52,409 INFO L276 IsEmpty]: Start isEmpty. Operand 6892 states and 12420 transitions. [2019-10-07 00:58:52,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-10-07 00:58:52,434 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:58:52,434 INFO L385 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:58:52,639 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:58:52,642 INFO L410 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:58:52,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:58:52,643 INFO L82 PathProgramCache]: Analyzing trace with hash 796891807, now seen corresponding path program 1 times [2019-10-07 00:58:52,643 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:58:52,643 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:52,643 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:52,644 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:58:52,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:58:52,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:58:52,781 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 58 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:58:52,781 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:58:52,781 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:58:52,782 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 00:58:52,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:58:52,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 1021 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-07 00:58:52,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:58:53,061 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 22 proven. 34 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-07 00:58:53,061 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:58:53,178 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 54 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-07 00:58:53,179 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:58:53,213 INFO L162 IcfgInterpreter]: Started Sifa with 153 locations of interest [2019-10-07 00:58:53,213 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:58:53,225 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:58:53,234 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:58:53,235 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:58:54,172 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 206 for LOIs [2019-10-07 00:58:54,451 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 298 [2019-10-07 00:58:54,757 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 304 [2019-10-07 00:58:55,088 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 310 [2019-10-07 00:58:55,697 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:58:55,698 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.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 00:58:55,705 INFO L168 Benchmark]: Toolchain (without parser) took 20719.75 ms. Allocated memory was 138.4 MB in the beginning and 686.3 MB in the end (delta: 547.9 MB). Free memory was 96.5 MB in the beginning and 405.3 MB in the end (delta: -308.8 MB). Peak memory consumption was 239.1 MB. Max. memory is 7.1 GB. [2019-10-07 00:58:55,706 INFO L168 Benchmark]: CDTParser took 1.38 ms. Allocated memory is still 138.4 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-10-07 00:58:55,707 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1395.13 ms. Allocated memory was 138.4 MB in the beginning and 205.5 MB in the end (delta: 67.1 MB). Free memory was 96.3 MB in the beginning and 124.0 MB in the end (delta: -27.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 7.1 GB. [2019-10-07 00:58:55,707 INFO L168 Benchmark]: Boogie Preprocessor took 200.25 ms. Allocated memory is still 205.5 MB. Free memory was 124.0 MB in the beginning and 112.8 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. [2019-10-07 00:58:55,708 INFO L168 Benchmark]: RCFGBuilder took 3223.30 ms. Allocated memory was 205.5 MB in the beginning and 306.2 MB in the end (delta: 100.7 MB). Free memory was 112.8 MB in the beginning and 241.7 MB in the end (delta: -128.9 MB). Peak memory consumption was 80.5 MB. Max. memory is 7.1 GB. [2019-10-07 00:58:55,709 INFO L168 Benchmark]: TraceAbstraction took 15896.43 ms. Allocated memory was 306.2 MB in the beginning and 686.3 MB in the end (delta: 380.1 MB). Free memory was 241.7 MB in the beginning and 405.3 MB in the end (delta: -163.6 MB). Peak memory consumption was 216.5 MB. Max. memory is 7.1 GB. [2019-10-07 00:58:55,714 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.38 ms. Allocated memory is still 138.4 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1395.13 ms. Allocated memory was 138.4 MB in the beginning and 205.5 MB in the end (delta: 67.1 MB). Free memory was 96.3 MB in the beginning and 124.0 MB in the end (delta: -27.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 200.25 ms. Allocated memory is still 205.5 MB. Free memory was 124.0 MB in the beginning and 112.8 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3223.30 ms. Allocated memory was 205.5 MB in the beginning and 306.2 MB in the end (delta: 100.7 MB). Free memory was 112.8 MB in the beginning and 241.7 MB in the end (delta: -128.9 MB). Peak memory consumption was 80.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15896.43 ms. Allocated memory was 306.2 MB in the beginning and 686.3 MB in the end (delta: 380.1 MB). Free memory was 241.7 MB in the beginning and 405.3 MB in the end (delta: -163.6 MB). Peak memory consumption was 216.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...