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/Problem16_label16.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 03:31:33,531 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 03:31:33,534 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 03:31:33,551 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 03:31:33,552 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 03:31:33,554 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 03:31:33,556 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 03:31:33,565 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 03:31:33,570 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 03:31:33,572 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 03:31:33,574 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 03:31:33,575 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 03:31:33,575 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 03:31:33,577 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 03:31:33,579 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 03:31:33,580 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 03:31:33,581 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 03:31:33,583 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 03:31:33,584 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 03:31:33,589 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 03:31:33,593 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 03:31:33,596 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 03:31:33,597 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 03:31:33,597 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 03:31:33,599 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 03:31:33,599 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 03:31:33,599 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 03:31:33,600 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 03:31:33,601 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 03:31:33,601 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 03:31:33,602 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 03:31:33,602 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 03:31:33,603 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 03:31:33,603 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 03:31:33,604 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 03:31:33,604 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 03:31:33,605 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 03:31:33,605 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 03:31:33,605 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 03:31:33,606 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 03:31:33,607 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 03:31:33,608 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:31:33,621 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 03:31:33,621 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 03:31:33,622 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 03:31:33,623 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 03:31:33,623 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 03:31:33,623 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 03:31:33,623 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 03:31:33,624 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 03:31:33,624 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 03:31:33,624 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 03:31:33,624 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 03:31:33,624 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 03:31:33,624 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 03:31:33,625 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 03:31:33,625 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 03:31:33,625 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 03:31:33,625 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 03:31:33,625 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 03:31:33,626 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 03:31:33,626 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 03:31:33,626 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 03:31:33,626 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 03:31:33,626 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 03:31:33,627 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 03:31:33,627 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 03:31:33,627 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 03:31:33,627 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 03:31:33,627 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 03:31:33,628 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:31:33,905 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 03:31:33,918 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 03:31:33,922 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 03:31:33,923 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 03:31:33,924 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 03:31:33,924 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem16_label16.c [2019-10-07 03:31:33,986 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bee976ad0/0dc1b39c5182413981c4dd8804415c99/FLAG7b855726d [2019-10-07 03:31:34,670 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 03:31:34,671 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem16_label16.c [2019-10-07 03:31:34,694 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bee976ad0/0dc1b39c5182413981c4dd8804415c99/FLAG7b855726d [2019-10-07 03:31:34,835 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bee976ad0/0dc1b39c5182413981c4dd8804415c99 [2019-10-07 03:31:34,843 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 03:31:34,845 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 03:31:34,846 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 03:31:34,846 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 03:31:34,850 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 03:31:34,850 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:31:34" (1/1) ... [2019-10-07 03:31:34,853 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76f51de0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:31:34, skipping insertion in model container [2019-10-07 03:31:34,854 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:31:34" (1/1) ... [2019-10-07 03:31:34,861 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 03:31:34,942 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 03:31:35,813 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 03:31:35,828 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 03:31:36,132 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 03:31:36,159 INFO L192 MainTranslator]: Completed translation [2019-10-07 03:31:36,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:31:36 WrapperNode [2019-10-07 03:31:36,160 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 03:31:36,161 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 03:31:36,162 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 03:31:36,162 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 03:31:36,178 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:31:36" (1/1) ... [2019-10-07 03:31:36,178 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:31:36" (1/1) ... [2019-10-07 03:31:36,221 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:31:36" (1/1) ... [2019-10-07 03:31:36,221 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:31:36" (1/1) ... [2019-10-07 03:31:36,296 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:31:36" (1/1) ... [2019-10-07 03:31:36,327 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:31:36" (1/1) ... [2019-10-07 03:31:36,345 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:31:36" (1/1) ... [2019-10-07 03:31:36,362 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 03:31:36,362 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 03:31:36,362 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 03:31:36,363 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 03:31:36,364 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:31: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 03:31:36,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 03:31:36,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 03:31:36,446 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-07 03:31:36,447 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-10-07 03:31:36,447 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 03:31:36,448 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-07 03:31:36,449 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-10-07 03:31:36,450 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 03:31:36,451 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 03:31:36,451 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-07 03:31:36,451 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 03:31:36,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 03:31:36,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 03:31:52,880 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 03:31:52,881 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-07 03:31:52,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:31:52 BoogieIcfgContainer [2019-10-07 03:31:52,883 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 03:31:52,884 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 03:31:52,884 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 03:31:52,887 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 03:31:52,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 03:31:34" (1/3) ... [2019-10-07 03:31:52,889 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16f944ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:31:52, skipping insertion in model container [2019-10-07 03:31:52,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:31:36" (2/3) ... [2019-10-07 03:31:52,889 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16f944ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:31:52, skipping insertion in model container [2019-10-07 03:31:52,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:31:52" (3/3) ... [2019-10-07 03:31:52,892 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem16_label16.c [2019-10-07 03:31:52,901 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 03:31:52,910 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 03:31:52,922 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 03:31:52,951 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 03:31:52,952 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 03:31:52,952 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 03:31:52,952 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 03:31:52,952 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 03:31:52,952 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 03:31:52,952 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 03:31:52,953 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 03:31:52,977 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states. [2019-10-07 03:31:52,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-07 03:31:52,983 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:31:52,985 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:31:52,986 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:31:52,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:31:52,993 INFO L82 PathProgramCache]: Analyzing trace with hash 863563583, now seen corresponding path program 1 times [2019-10-07 03:31:53,000 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:31:53,000 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:31:53,000 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:31:53,000 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:31:53,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:31:53,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:31:53,365 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:31:53,366 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:31:53,366 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:31:53,367 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 03:31:53,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 03:31:53,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 03:31:53,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 03:31:53,394 INFO L87 Difference]: Start difference. First operand 244 states. Second operand 3 states. [2019-10-07 03:31:55,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:31:55,077 INFO L93 Difference]: Finished difference Result 718 states and 1389 transitions. [2019-10-07 03:31:55,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 03:31:55,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-10-07 03:31:55,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:31:55,099 INFO L225 Difference]: With dead ends: 718 [2019-10-07 03:31:55,099 INFO L226 Difference]: Without dead ends: 471 [2019-10-07 03:31:55,108 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:31:55,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2019-10-07 03:31:55,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 469. [2019-10-07 03:31:55,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2019-10-07 03:31:55,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 862 transitions. [2019-10-07 03:31:55,210 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 862 transitions. Word has length 11 [2019-10-07 03:31:55,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:31:55,211 INFO L462 AbstractCegarLoop]: Abstraction has 469 states and 862 transitions. [2019-10-07 03:31:55,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 03:31:55,211 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 862 transitions. [2019-10-07 03:31:55,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-07 03:31:55,214 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:31:55,214 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] [2019-10-07 03:31:55,215 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:31:55,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:31:55,216 INFO L82 PathProgramCache]: Analyzing trace with hash -508645559, now seen corresponding path program 1 times [2019-10-07 03:31:55,217 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:31:55,217 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:31:55,218 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:31:55,218 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:31:55,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:31:55,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:31:55,437 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:31:55,437 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:31:55,437 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:31:55,437 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 03:31:55,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 03:31:55,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 03:31:55,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-07 03:31:55,440 INFO L87 Difference]: Start difference. First operand 469 states and 862 transitions. Second operand 6 states. [2019-10-07 03:32:04,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:32:04,063 INFO L93 Difference]: Finished difference Result 1907 states and 3624 transitions. [2019-10-07 03:32:04,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-07 03:32:04,064 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-10-07 03:32:04,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:32:04,089 INFO L225 Difference]: With dead ends: 1907 [2019-10-07 03:32:04,089 INFO L226 Difference]: Without dead ends: 1443 [2019-10-07 03:32:04,093 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-10-07 03:32:04,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2019-10-07 03:32:04,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 1405. [2019-10-07 03:32:04,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1405 states. [2019-10-07 03:32:04,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1405 states to 1405 states and 2456 transitions. [2019-10-07 03:32:04,241 INFO L78 Accepts]: Start accepts. Automaton has 1405 states and 2456 transitions. Word has length 27 [2019-10-07 03:32:04,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:32:04,243 INFO L462 AbstractCegarLoop]: Abstraction has 1405 states and 2456 transitions. [2019-10-07 03:32:04,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 03:32:04,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1405 states and 2456 transitions. [2019-10-07 03:32:04,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-07 03:32:04,245 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:32:04,246 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] [2019-10-07 03:32:04,246 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:32:04,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:32:04,246 INFO L82 PathProgramCache]: Analyzing trace with hash 584284545, now seen corresponding path program 1 times [2019-10-07 03:32:04,247 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:32:04,247 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:32:04,247 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:32:04,248 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:32:04,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:32:04,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:32:04,389 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:32:04,390 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:32:04,390 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:32:04,391 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 03:32:04,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 03:32:04,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 03:32:04,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-07 03:32:04,392 INFO L87 Difference]: Start difference. First operand 1405 states and 2456 transitions. Second operand 6 states. [2019-10-07 03:32:06,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:32:06,825 INFO L93 Difference]: Finished difference Result 3783 states and 6873 transitions. [2019-10-07 03:32:06,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 03:32:06,827 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-10-07 03:32:06,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:32:06,850 INFO L225 Difference]: With dead ends: 3783 [2019-10-07 03:32:06,851 INFO L226 Difference]: Without dead ends: 2383 [2019-10-07 03:32:06,856 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-07 03:32:06,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2383 states. [2019-10-07 03:32:06,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2383 to 2317. [2019-10-07 03:32:06,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2317 states. [2019-10-07 03:32:06,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2317 states to 2317 states and 4079 transitions. [2019-10-07 03:32:06,970 INFO L78 Accepts]: Start accepts. Automaton has 2317 states and 4079 transitions. Word has length 31 [2019-10-07 03:32:06,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:32:06,971 INFO L462 AbstractCegarLoop]: Abstraction has 2317 states and 4079 transitions. [2019-10-07 03:32:06,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 03:32:06,971 INFO L276 IsEmpty]: Start isEmpty. Operand 2317 states and 4079 transitions. [2019-10-07 03:32:06,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-07 03:32:06,973 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:32:06,973 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] [2019-10-07 03:32:06,974 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:32:06,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:32:06,975 INFO L82 PathProgramCache]: Analyzing trace with hash 637258397, now seen corresponding path program 1 times [2019-10-07 03:32:06,975 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:32:06,975 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:32:06,976 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:32:06,976 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:32:06,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:32:07,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:32:07,107 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:32:07,107 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:32:07,108 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:32:07,108 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 03:32:07,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 03:32:07,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 03:32:07,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-07 03:32:07,109 INFO L87 Difference]: Start difference. First operand 2317 states and 4079 transitions. Second operand 6 states. [2019-10-07 03:32:09,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:32:09,271 INFO L93 Difference]: Finished difference Result 5411 states and 9944 transitions. [2019-10-07 03:32:09,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 03:32:09,272 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-10-07 03:32:09,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:32:09,297 INFO L225 Difference]: With dead ends: 5411 [2019-10-07 03:32:09,298 INFO L226 Difference]: Without dead ends: 3099 [2019-10-07 03:32:09,306 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:32:09,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3099 states. [2019-10-07 03:32:09,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3099 to 3015. [2019-10-07 03:32:09,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3015 states. [2019-10-07 03:32:09,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3015 states to 3015 states and 5266 transitions. [2019-10-07 03:32:09,425 INFO L78 Accepts]: Start accepts. Automaton has 3015 states and 5266 transitions. Word has length 33 [2019-10-07 03:32:09,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:32:09,425 INFO L462 AbstractCegarLoop]: Abstraction has 3015 states and 5266 transitions. [2019-10-07 03:32:09,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 03:32:09,425 INFO L276 IsEmpty]: Start isEmpty. Operand 3015 states and 5266 transitions. [2019-10-07 03:32:09,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-07 03:32:09,433 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:32:09,434 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:32:09,434 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:32:09,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:32:09,435 INFO L82 PathProgramCache]: Analyzing trace with hash 675675294, now seen corresponding path program 1 times [2019-10-07 03:32:09,435 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:32:09,435 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:32:09,436 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:32:09,436 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:32:09,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:32:09,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:32:09,555 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:32:09,555 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:32:09,555 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:32:09,556 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 03:32:09,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 03:32:09,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 03:32:09,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-07 03:32:09,557 INFO L87 Difference]: Start difference. First operand 3015 states and 5266 transitions. Second operand 6 states. [2019-10-07 03:32:11,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:32:11,647 INFO L93 Difference]: Finished difference Result 8091 states and 14719 transitions. [2019-10-07 03:32:11,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 03:32:11,653 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-10-07 03:32:11,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:32:11,684 INFO L225 Difference]: With dead ends: 8091 [2019-10-07 03:32:11,684 INFO L226 Difference]: Without dead ends: 5081 [2019-10-07 03:32:11,696 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:32:11,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5081 states. [2019-10-07 03:32:11,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5081 to 3727. [2019-10-07 03:32:11,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3727 states. [2019-10-07 03:32:11,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3727 states to 3727 states and 6402 transitions. [2019-10-07 03:32:11,824 INFO L78 Accepts]: Start accepts. Automaton has 3727 states and 6402 transitions. Word has length 36 [2019-10-07 03:32:11,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:32:11,824 INFO L462 AbstractCegarLoop]: Abstraction has 3727 states and 6402 transitions. [2019-10-07 03:32:11,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 03:32:11,825 INFO L276 IsEmpty]: Start isEmpty. Operand 3727 states and 6402 transitions. [2019-10-07 03:32:11,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-07 03:32:11,827 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:32:11,827 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] [2019-10-07 03:32:11,827 INFO L410 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:32:11,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:32:11,828 INFO L82 PathProgramCache]: Analyzing trace with hash 259383053, now seen corresponding path program 1 times [2019-10-07 03:32:11,828 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:32:11,828 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:32:11,828 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:32:11,828 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:32:11,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:32:11,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:32:11,906 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:32:11,906 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:32:11,907 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:32:11,907 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 03:32:11,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 03:32:11,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 03:32:11,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-07 03:32:11,908 INFO L87 Difference]: Start difference. First operand 3727 states and 6402 transitions. Second operand 6 states. [2019-10-07 03:32:13,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:32:13,980 INFO L93 Difference]: Finished difference Result 8618 states and 14776 transitions. [2019-10-07 03:32:13,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 03:32:13,981 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-10-07 03:32:13,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:32:14,007 INFO L225 Difference]: With dead ends: 8618 [2019-10-07 03:32:14,008 INFO L226 Difference]: Without dead ends: 4896 [2019-10-07 03:32:14,022 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:32:14,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4896 states. [2019-10-07 03:32:14,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4896 to 4353. [2019-10-07 03:32:14,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4353 states. [2019-10-07 03:32:14,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4353 states to 4353 states and 6606 transitions. [2019-10-07 03:32:14,141 INFO L78 Accepts]: Start accepts. Automaton has 4353 states and 6606 transitions. Word has length 41 [2019-10-07 03:32:14,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:32:14,142 INFO L462 AbstractCegarLoop]: Abstraction has 4353 states and 6606 transitions. [2019-10-07 03:32:14,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 03:32:14,142 INFO L276 IsEmpty]: Start isEmpty. Operand 4353 states and 6606 transitions. [2019-10-07 03:32:14,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-07 03:32:14,143 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:32:14,143 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] [2019-10-07 03:32:14,143 INFO L410 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:32:14,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:32:14,144 INFO L82 PathProgramCache]: Analyzing trace with hash -489646039, now seen corresponding path program 1 times [2019-10-07 03:32:14,144 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:32:14,144 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:32:14,144 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:32:14,144 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:32:14,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:32:14,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:32:14,214 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-07 03:32:14,214 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:32:14,215 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 03:32:14,215 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:32:14,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:32:14,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-07 03:32:14,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 03:32:14,361 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:32:14,361 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 03:32:14,409 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:32:14,409 INFO L211 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-07 03:32:14,410 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2019-10-07 03:32:14,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 03:32:14,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 03:32:14,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-07 03:32:14,411 INFO L87 Difference]: Start difference. First operand 4353 states and 6606 transitions. Second operand 4 states. [2019-10-07 03:32:17,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:32:17,080 INFO L93 Difference]: Finished difference Result 12530 states and 19501 transitions. [2019-10-07 03:32:17,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 03:32:17,080 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-10-07 03:32:17,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:32:17,128 INFO L225 Difference]: With dead ends: 12530 [2019-10-07 03:32:17,128 INFO L226 Difference]: Without dead ends: 8182 [2019-10-07 03:32:17,147 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 85 SyntacticMatches, 4 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-07 03:32:17,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8182 states. [2019-10-07 03:32:17,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8182 to 7555. [2019-10-07 03:32:17,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7555 states. [2019-10-07 03:32:17,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7555 states to 7555 states and 10930 transitions. [2019-10-07 03:32:17,366 INFO L78 Accepts]: Start accepts. Automaton has 7555 states and 10930 transitions. Word has length 43 [2019-10-07 03:32:17,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:32:17,367 INFO L462 AbstractCegarLoop]: Abstraction has 7555 states and 10930 transitions. [2019-10-07 03:32:17,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 03:32:17,367 INFO L276 IsEmpty]: Start isEmpty. Operand 7555 states and 10930 transitions. [2019-10-07 03:32:17,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-10-07 03:32:17,373 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:32:17,373 INFO L385 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 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] [2019-10-07 03:32:17,578 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:32:17,579 INFO L410 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:32:17,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:32:17,579 INFO L82 PathProgramCache]: Analyzing trace with hash 508978801, now seen corresponding path program 1 times [2019-10-07 03:32:17,579 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:32:17,579 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:32:17,580 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:32:17,580 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:32:17,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:32:17,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:32:17,988 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 100 proven. 15 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-10-07 03:32:17,988 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:32:17,988 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 03:32:17,988 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:32:18,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:32:18,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 943 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-07 03:32:18,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 03:32:18,308 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 138 proven. 2 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-10-07 03:32:18,308 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 03:32:18,420 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 100 proven. 15 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-10-07 03:32:18,421 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 03:32:18,461 INFO L162 IcfgInterpreter]: Started Sifa with 197 locations of interest [2019-10-07 03:32:18,461 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 03:32:18,469 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 03:32:18,559 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 03:32:18,560 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 03:32:18,725 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 55 for LOIs [2019-10-07 03:32:18,963 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2019-10-07 03:32:19,131 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2019-10-07 03:32:19,276 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2019-10-07 03:32:19,319 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2019-10-07 03:32:19,653 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:32:19,654 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:32:19,662 INFO L168 Benchmark]: Toolchain (without parser) took 44815.89 ms. Allocated memory was 145.8 MB in the beginning and 609.2 MB in the end (delta: 463.5 MB). Free memory was 99.3 MB in the beginning and 240.3 MB in the end (delta: -141.0 MB). Peak memory consumption was 322.5 MB. Max. memory is 7.1 GB. [2019-10-07 03:32:19,663 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-07 03:32:19,664 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1315.22 ms. Allocated memory was 145.8 MB in the beginning and 205.0 MB in the end (delta: 59.2 MB). Free memory was 99.1 MB in the beginning and 127.9 MB in the end (delta: -28.8 MB). Peak memory consumption was 38.4 MB. Max. memory is 7.1 GB. [2019-10-07 03:32:19,665 INFO L168 Benchmark]: Boogie Preprocessor took 200.54 ms. Allocated memory is still 205.0 MB. Free memory was 127.9 MB in the beginning and 117.2 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2019-10-07 03:32:19,672 INFO L168 Benchmark]: RCFGBuilder took 16520.66 ms. Allocated memory was 205.0 MB in the beginning and 301.5 MB in the end (delta: 96.5 MB). Free memory was 117.2 MB in the beginning and 90.2 MB in the end (delta: 27.1 MB). Peak memory consumption was 135.4 MB. Max. memory is 7.1 GB. [2019-10-07 03:32:19,674 INFO L168 Benchmark]: TraceAbstraction took 26775.20 ms. Allocated memory was 301.5 MB in the beginning and 609.2 MB in the end (delta: 307.8 MB). Free memory was 90.2 MB in the beginning and 240.3 MB in the end (delta: -150.1 MB). Peak memory consumption was 157.6 MB. Max. memory is 7.1 GB. [2019-10-07 03:32:19,684 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1315.22 ms. Allocated memory was 145.8 MB in the beginning and 205.0 MB in the end (delta: 59.2 MB). Free memory was 99.1 MB in the beginning and 127.9 MB in the end (delta: -28.8 MB). Peak memory consumption was 38.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 200.54 ms. Allocated memory is still 205.0 MB. Free memory was 127.9 MB in the beginning and 117.2 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 16520.66 ms. Allocated memory was 205.0 MB in the beginning and 301.5 MB in the end (delta: 96.5 MB). Free memory was 117.2 MB in the beginning and 90.2 MB in the end (delta: 27.1 MB). Peak memory consumption was 135.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 26775.20 ms. Allocated memory was 301.5 MB in the beginning and 609.2 MB in the end (delta: 307.8 MB). Free memory was 90.2 MB in the beginning and 240.3 MB in the end (delta: -150.1 MB). Peak memory consumption was 157.6 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...