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/Problem02_label12.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 00:57:31,617 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 00:57:31,619 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 00:57:31,637 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 00:57:31,637 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 00:57:31,638 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 00:57:31,639 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 00:57:31,643 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 00:57:31,646 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 00:57:31,647 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 00:57:31,651 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 00:57:31,653 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 00:57:31,654 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 00:57:31,655 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 00:57:31,656 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 00:57:31,658 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 00:57:31,660 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 00:57:31,663 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 00:57:31,665 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 00:57:31,668 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 00:57:31,673 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 00:57:31,674 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 00:57:31,675 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 00:57:31,677 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 00:57:31,681 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 00:57:31,681 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 00:57:31,683 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 00:57:31,685 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 00:57:31,686 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 00:57:31,689 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 00:57:31,689 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 00:57:31,690 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 00:57:31,691 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 00:57:31,692 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 00:57:31,694 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 00:57:31,694 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 00:57:31,695 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 00:57:31,695 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 00:57:31,695 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 00:57:31,697 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 00:57:31,701 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 00:57:31,702 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:57:31,737 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 00:57:31,737 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 00:57:31,738 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 00:57:31,739 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 00:57:31,739 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 00:57:31,742 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 00:57:31,743 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 00:57:31,743 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 00:57:31,743 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 00:57:31,743 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 00:57:31,743 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 00:57:31,744 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 00:57:31,744 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 00:57:31,744 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 00:57:31,744 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 00:57:31,744 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 00:57:31,745 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 00:57:31,745 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 00:57:31,748 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 00:57:31,748 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 00:57:31,749 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 00:57:31,749 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 00:57:31,749 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 00:57:31,749 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 00:57:31,749 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 00:57:31,750 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 00:57:31,750 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 00:57:31,750 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 00:57:31,750 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:57:32,065 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 00:57:32,083 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 00:57:32,086 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 00:57:32,088 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 00:57:32,088 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 00:57:32,089 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label12.c [2019-10-07 00:57:32,166 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ab809d95/c925db9cd4284e5982e123238fd5a616/FLAGae41a1068 [2019-10-07 00:57:32,745 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 00:57:32,746 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label12.c [2019-10-07 00:57:32,759 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ab809d95/c925db9cd4284e5982e123238fd5a616/FLAGae41a1068 [2019-10-07 00:57:33,011 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ab809d95/c925db9cd4284e5982e123238fd5a616 [2019-10-07 00:57:33,023 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 00:57:33,025 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 00:57:33,028 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 00:57:33,028 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 00:57:33,031 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 00:57:33,032 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:57:33" (1/1) ... [2019-10-07 00:57:33,035 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3304fef9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:57:33, skipping insertion in model container [2019-10-07 00:57:33,036 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:57:33" (1/1) ... [2019-10-07 00:57:33,043 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 00:57:33,093 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 00:57:33,588 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:57:33,602 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 00:57:33,712 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:57:33,736 INFO L192 MainTranslator]: Completed translation [2019-10-07 00:57:33,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:57:33 WrapperNode [2019-10-07 00:57:33,737 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 00:57:33,738 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 00:57:33,738 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 00:57:33,738 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 00:57:33,748 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:57:33" (1/1) ... [2019-10-07 00:57:33,749 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:57:33" (1/1) ... [2019-10-07 00:57:33,765 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:57:33" (1/1) ... [2019-10-07 00:57:33,766 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:57:33" (1/1) ... [2019-10-07 00:57:33,806 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:57:33" (1/1) ... [2019-10-07 00:57:33,823 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:57:33" (1/1) ... [2019-10-07 00:57:33,827 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:57:33" (1/1) ... [2019-10-07 00:57:33,835 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 00:57:33,835 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 00:57:33,835 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 00:57:33,835 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 00:57:33,836 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:57:33" (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:57:33,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 00:57:33,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 00:57:33,904 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-07 00:57:33,904 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 00:57:33,904 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-07 00:57:33,904 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 00:57:33,904 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 00:57:33,905 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-07 00:57:33,905 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 00:57:33,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 00:57:33,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 00:57:35,975 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 00:57:35,975 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-07 00:57:35,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:57:35 BoogieIcfgContainer [2019-10-07 00:57:35,977 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 00:57:35,978 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 00:57:35,979 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 00:57:35,982 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 00:57:35,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 12:57:33" (1/3) ... [2019-10-07 00:57:35,983 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fa35a6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:57:35, skipping insertion in model container [2019-10-07 00:57:35,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:57:33" (2/3) ... [2019-10-07 00:57:35,984 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fa35a6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:57:35, skipping insertion in model container [2019-10-07 00:57:35,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:57:35" (3/3) ... [2019-10-07 00:57:35,986 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label12.c [2019-10-07 00:57:35,996 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 00:57:36,005 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 00:57:36,017 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 00:57:36,044 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 00:57:36,044 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 00:57:36,044 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 00:57:36,044 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 00:57:36,048 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 00:57:36,049 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 00:57:36,049 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 00:57:36,049 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 00:57:36,071 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states. [2019-10-07 00:57:36,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-07 00:57:36,081 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:57:36,082 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] [2019-10-07 00:57:36,084 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:57:36,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:57:36,091 INFO L82 PathProgramCache]: Analyzing trace with hash -219360969, now seen corresponding path program 1 times [2019-10-07 00:57:36,100 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:57:36,100 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:57:36,101 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:57:36,101 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:57:36,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:57:36,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:57:36,595 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:57:36,596 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:57:36,597 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:57:36,597 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:57:36,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:57:36,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:57:36,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:57:36,623 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 3 states. [2019-10-07 00:57:37,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:57:37,208 INFO L93 Difference]: Finished difference Result 273 states and 508 transitions. [2019-10-07 00:57:37,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:57:37,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-10-07 00:57:37,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:57:37,235 INFO L225 Difference]: With dead ends: 273 [2019-10-07 00:57:37,235 INFO L226 Difference]: Without dead ends: 175 [2019-10-07 00:57:37,242 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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:57:37,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-10-07 00:57:37,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2019-10-07 00:57:37,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-10-07 00:57:37,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 312 transitions. [2019-10-07 00:57:37,348 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 312 transitions. Word has length 86 [2019-10-07 00:57:37,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:57:37,349 INFO L462 AbstractCegarLoop]: Abstraction has 175 states and 312 transitions. [2019-10-07 00:57:37,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:57:37,350 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 312 transitions. [2019-10-07 00:57:37,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-07 00:57:37,356 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:57:37,356 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:57:37,357 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:57:37,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:57:37,358 INFO L82 PathProgramCache]: Analyzing trace with hash -701895748, now seen corresponding path program 1 times [2019-10-07 00:57:37,358 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:57:37,358 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:57:37,359 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:57:37,359 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:57:37,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:57:37,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:57:37,533 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 00:57:37,533 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:57:37,533 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:57:37,534 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:57:37,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:57:37,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:57:37,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:57:37,536 INFO L87 Difference]: Start difference. First operand 175 states and 312 transitions. Second operand 3 states. [2019-10-07 00:57:37,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:57:37,929 INFO L93 Difference]: Finished difference Result 513 states and 937 transitions. [2019-10-07 00:57:37,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:57:37,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-10-07 00:57:37,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:57:37,942 INFO L225 Difference]: With dead ends: 513 [2019-10-07 00:57:37,942 INFO L226 Difference]: Without dead ends: 343 [2019-10-07 00:57:37,945 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:57:37,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-10-07 00:57:37,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2019-10-07 00:57:37,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-10-07 00:57:37,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 575 transitions. [2019-10-07 00:57:37,993 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 575 transitions. Word has length 94 [2019-10-07 00:57:37,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:57:37,994 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 575 transitions. [2019-10-07 00:57:37,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:57:37,995 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 575 transitions. [2019-10-07 00:57:38,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-07 00:57:38,005 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:57:38,005 INFO L385 BasicCegarLoop]: trace histogram [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] [2019-10-07 00:57:38,005 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:57:38,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:57:38,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1307299425, now seen corresponding path program 1 times [2019-10-07 00:57:38,006 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:57:38,006 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:57:38,008 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:57:38,009 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:57:38,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:57:38,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:57:38,118 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:57:38,118 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:57:38,118 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:57:38,119 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 00:57:38,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 00:57:38,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 00:57:38,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-07 00:57:38,120 INFO L87 Difference]: Start difference. First operand 343 states and 575 transitions. Second operand 6 states. [2019-10-07 00:57:38,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:57:38,778 INFO L93 Difference]: Finished difference Result 1059 states and 1887 transitions. [2019-10-07 00:57:38,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 00:57:38,779 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 108 [2019-10-07 00:57:38,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:57:38,786 INFO L225 Difference]: With dead ends: 1059 [2019-10-07 00:57:38,786 INFO L226 Difference]: Without dead ends: 721 [2019-10-07 00:57:38,789 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:57:38,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2019-10-07 00:57:38,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 703. [2019-10-07 00:57:38,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2019-10-07 00:57:38,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 1170 transitions. [2019-10-07 00:57:38,840 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 1170 transitions. Word has length 108 [2019-10-07 00:57:38,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:57:38,840 INFO L462 AbstractCegarLoop]: Abstraction has 703 states and 1170 transitions. [2019-10-07 00:57:38,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 00:57:38,841 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 1170 transitions. [2019-10-07 00:57:38,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-07 00:57:38,846 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:57:38,846 INFO L385 BasicCegarLoop]: trace histogram [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] [2019-10-07 00:57:38,846 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:57:38,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:57:38,847 INFO L82 PathProgramCache]: Analyzing trace with hash 2071206379, now seen corresponding path program 1 times [2019-10-07 00:57:38,847 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:57:38,847 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:57:38,848 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:57:38,848 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:57:38,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:57:38,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:57:38,971 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:57:38,971 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:57:38,972 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:57:38,972 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 00:57:38,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 00:57:38,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 00:57:38,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-07 00:57:38,974 INFO L87 Difference]: Start difference. First operand 703 states and 1170 transitions. Second operand 6 states. [2019-10-07 00:57:39,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:57:39,712 INFO L93 Difference]: Finished difference Result 1783 states and 3030 transitions. [2019-10-07 00:57:39,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 00:57:39,712 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 114 [2019-10-07 00:57:39,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:57:39,721 INFO L225 Difference]: With dead ends: 1783 [2019-10-07 00:57:39,721 INFO L226 Difference]: Without dead ends: 1085 [2019-10-07 00:57:39,725 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:57:39,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1085 states. [2019-10-07 00:57:39,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1085 to 1069. [2019-10-07 00:57:39,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1069 states. [2019-10-07 00:57:39,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 1682 transitions. [2019-10-07 00:57:39,809 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 1682 transitions. Word has length 114 [2019-10-07 00:57:39,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:57:39,809 INFO L462 AbstractCegarLoop]: Abstraction has 1069 states and 1682 transitions. [2019-10-07 00:57:39,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 00:57:39,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1682 transitions. [2019-10-07 00:57:39,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-07 00:57:39,813 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:57:39,814 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:39,814 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:57:39,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:57:39,814 INFO L82 PathProgramCache]: Analyzing trace with hash 5344754, now seen corresponding path program 1 times [2019-10-07 00:57:39,815 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:57:39,815 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:57:39,815 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:57:39,815 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:57:39,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:57:39,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:57:39,981 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 20 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:57:39,981 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:57:39,982 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:57:39,982 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:57:40,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:57:40,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-07 00:57:40,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:57:40,193 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-07 00:57:40,193 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:57:40,249 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-07 00:57:40,250 INFO L211 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-07 00:57:40,250 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 10 [2019-10-07 00:57:40,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 00:57:40,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 00:57:40,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-07 00:57:40,252 INFO L87 Difference]: Start difference. First operand 1069 states and 1682 transitions. Second operand 4 states. [2019-10-07 00:57:40,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:57:40,987 INFO L93 Difference]: Finished difference Result 3159 states and 5117 transitions. [2019-10-07 00:57:40,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 00:57:40,988 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-10-07 00:57:40,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:57:40,998 INFO L225 Difference]: With dead ends: 3159 [2019-10-07 00:57:40,998 INFO L226 Difference]: Without dead ends: 1741 [2019-10-07 00:57:41,002 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-07 00:57:41,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1741 states. [2019-10-07 00:57:41,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1741 to 1573. [2019-10-07 00:57:41,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2019-10-07 00:57:41,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 2099 transitions. [2019-10-07 00:57:41,053 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 2099 transitions. Word has length 121 [2019-10-07 00:57:41,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:57:41,053 INFO L462 AbstractCegarLoop]: Abstraction has 1573 states and 2099 transitions. [2019-10-07 00:57:41,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 00:57:41,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 2099 transitions. [2019-10-07 00:57:41,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-07 00:57:41,059 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:57:41,059 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:41,270 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:57:41,271 INFO L410 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:57:41,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:57:41,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1273080830, now seen corresponding path program 1 times [2019-10-07 00:57:41,272 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:57:41,272 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:57:41,273 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:57:41,273 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:57:41,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:57:41,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:57:41,359 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 46 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:57:41,359 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:57:41,360 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:57:41,360 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:57:41,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:57:41,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-07 00:57:41,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:57:41,477 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-07 00:57:41,477 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:57:41,532 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-07 00:57:41,533 INFO L211 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-07 00:57:41,533 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2019-10-07 00:57:41,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:57:41,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:57:41,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-07 00:57:41,534 INFO L87 Difference]: Start difference. First operand 1573 states and 2099 transitions. Second operand 3 states. [2019-10-07 00:57:41,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:57:41,912 INFO L93 Difference]: Finished difference Result 2083 states and 2795 transitions. [2019-10-07 00:57:41,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:57:41,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-10-07 00:57:41,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:57:41,913 INFO L225 Difference]: With dead ends: 2083 [2019-10-07 00:57:41,913 INFO L226 Difference]: Without dead ends: 0 [2019-10-07 00:57:41,918 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 252 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:57:41,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-07 00:57:41,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-07 00:57:41,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-07 00:57:41,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-07 00:57:41,919 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 127 [2019-10-07 00:57:41,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:57:41,920 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-07 00:57:41,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:57:41,920 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-07 00:57:41,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-07 00:57:42,128 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:57:42,133 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-07 00:57:42,853 WARN L191 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 49 [2019-10-07 00:57:43,034 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 36 [2019-10-07 00:57:43,198 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-10-07 00:57:43,201 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a28~0 |old(~a28~0)|) (= ~a25~0 |old(~a25~0)|)) [2019-10-07 00:57:43,201 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-07 00:57:43,201 INFO L443 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-10-07 00:57:43,202 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 526) no Hoare annotation was computed. [2019-10-07 00:57:43,202 INFO L443 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-10-07 00:57:43,202 INFO L443 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-10-07 00:57:43,202 INFO L443 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-10-07 00:57:43,202 INFO L443 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-10-07 00:57:43,202 INFO L443 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-10-07 00:57:43,202 INFO L443 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-10-07 00:57:43,202 INFO L443 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-10-07 00:57:43,203 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-10-07 00:57:43,203 INFO L443 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-10-07 00:57:43,203 INFO L443 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-10-07 00:57:43,203 INFO L443 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-10-07 00:57:43,203 INFO L443 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-10-07 00:57:43,203 INFO L443 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-10-07 00:57:43,203 INFO L443 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-10-07 00:57:43,203 INFO L443 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-10-07 00:57:43,204 INFO L443 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-10-07 00:57:43,204 INFO L443 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-10-07 00:57:43,204 INFO L443 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-10-07 00:57:43,204 INFO L443 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-10-07 00:57:43,204 INFO L443 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-10-07 00:57:43,204 INFO L443 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-10-07 00:57:43,204 INFO L443 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-10-07 00:57:43,204 INFO L443 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-10-07 00:57:43,205 INFO L443 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-10-07 00:57:43,205 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-10-07 00:57:43,205 INFO L443 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-10-07 00:57:43,205 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-10-07 00:57:43,205 INFO L443 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-10-07 00:57:43,205 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-10-07 00:57:43,205 INFO L443 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-10-07 00:57:43,205 INFO L443 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-10-07 00:57:43,205 INFO L443 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-10-07 00:57:43,206 INFO L443 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-10-07 00:57:43,206 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2019-10-07 00:57:43,206 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2019-10-07 00:57:43,206 INFO L443 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-10-07 00:57:43,206 INFO L443 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-10-07 00:57:43,206 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-10-07 00:57:43,206 INFO L443 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-10-07 00:57:43,206 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-10-07 00:57:43,206 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-10-07 00:57:43,206 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-10-07 00:57:43,206 INFO L443 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-10-07 00:57:43,206 INFO L443 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-10-07 00:57:43,207 INFO L443 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-10-07 00:57:43,207 INFO L443 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-10-07 00:57:43,207 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-10-07 00:57:43,207 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-10-07 00:57:43,207 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-10-07 00:57:43,207 INFO L443 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-10-07 00:57:43,207 INFO L443 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-10-07 00:57:43,207 INFO L443 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-10-07 00:57:43,207 INFO L443 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-10-07 00:57:43,207 INFO L443 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2019-10-07 00:57:43,208 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse1 (not (= 1 |old(~a19~0)|))) (.cse2 (not (<= 10 |old(~a28~0)|))) (.cse11 (= 1 |old(~a25~0)|)) (.cse4 (= ~a19~0 1)) (.cse5 (= ~a28~0 |old(~a28~0)|)) (.cse6 (= ~a25~0 |old(~a25~0)|))) (let ((.cse10 (not (< 8 |old(~a28~0)|))) (.cse9 (= 11 |old(~a28~0)|)) (.cse7 (not (<= 8 |old(~a17~0)|))) (.cse8 (<= 8 ~a17~0)) (.cse12 (and .cse4 .cse5 .cse6)) (.cse13 (or .cse1 .cse2 .cse11)) (.cse0 (= 1 |old(~a11~0)|)) (.cse3 (not (= 1 ~a11~0)))) (and (or .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6)) (or .cse0 .cse7 .cse1 .cse8) (or (and .cse5 .cse6) .cse9 .cse10) (or .cse0 .cse7 (and .cse3 .cse8 .cse5 .cse6) .cse11) (or (and .cse8 .cse5 .cse6) .cse7 .cse9) (or .cse12 .cse1 .cse9) (or .cse0 .cse9 .cse11 .cse3 .cse10) (or .cse0 .cse7 .cse9 .cse3) (or .cse7 .cse13 .cse8) (or .cse12 .cse13) (or .cse0 .cse1 .cse11 .cse3)))) [2019-10-07 00:57:43,208 INFO L443 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-10-07 00:57:43,208 INFO L443 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-10-07 00:57:43,208 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-10-07 00:57:43,208 INFO L443 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-10-07 00:57:43,208 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-10-07 00:57:43,209 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-10-07 00:57:43,209 INFO L443 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-10-07 00:57:43,209 INFO L443 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2019-10-07 00:57:43,209 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-10-07 00:57:43,209 INFO L443 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-10-07 00:57:43,209 INFO L443 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2019-10-07 00:57:43,209 INFO L443 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-10-07 00:57:43,209 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-10-07 00:57:43,210 INFO L443 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-10-07 00:57:43,210 INFO L443 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-10-07 00:57:43,210 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-10-07 00:57:43,210 INFO L443 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-10-07 00:57:43,210 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-10-07 00:57:43,210 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-10-07 00:57:43,210 INFO L443 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-10-07 00:57:43,210 INFO L443 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-10-07 00:57:43,211 INFO L443 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-10-07 00:57:43,211 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-10-07 00:57:43,211 INFO L443 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-10-07 00:57:43,211 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-10-07 00:57:43,211 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-07 00:57:43,211 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= 1 ~a11~0)) (<= 8 ~a17~0) (not (= ~a25~0 1)) (= ~a19~0 1) (not (= ~a28~0 11))) [2019-10-07 00:57:43,211 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-07 00:57:43,212 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-07 00:57:43,212 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (and (not (= 1 ~a11~0)) (<= 8 ~a17~0) (= ~a19~0 1) (= ~a28~0 |old(~a28~0)|) (= ~a25~0 |old(~a25~0)|)) (= 1 |old(~a11~0)|) (not (<= 8 |old(~a17~0)|)) (not (= 1 |old(~a19~0)|)) (= 11 |old(~a28~0)|) (= 1 |old(~a25~0)|)) [2019-10-07 00:57:43,212 INFO L439 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse3 (<= 8 ~a17~0)) (.cse1 (not (= ~a28~0 11))) (.cse2 (not (= 1 ~a11~0))) (.cse4 (not (= ~a25~0 1))) (.cse0 (= ~a19~0 1))) (or (and .cse0 .cse1) (not (<= 8 |old(~a17~0)|)) (and .cse2 .cse3 .cse4) (and .cse3 .cse1) (= 11 |old(~a28~0)|) (= 1 |old(~a25~0)|) (and (< 8 ~a28~0) .cse1) (= 1 |old(~a11~0)|) (and .cse2 .cse0) (not (= 1 |old(~a19~0)|)) (and .cse4 .cse0))) [2019-10-07 00:57:43,212 INFO L443 ceAbstractionStarter]: For program point L606-3(lines 600 617) no Hoare annotation was computed. [2019-10-07 00:57:43,212 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2019-10-07 00:57:43,213 INFO L439 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse3 (<= 8 ~a17~0)) (.cse1 (not (= ~a28~0 11))) (.cse2 (not (= 1 ~a11~0))) (.cse4 (not (= ~a25~0 1))) (.cse0 (= ~a19~0 1))) (or (and .cse0 .cse1) (not (<= 8 |old(~a17~0)|)) (and .cse2 .cse3 .cse4) (and .cse3 .cse1) (= 11 |old(~a28~0)|) (= 1 |old(~a25~0)|) (and (< 8 ~a28~0) .cse1) (= 1 |old(~a11~0)|) (and .cse2 .cse0) (not (= 1 |old(~a19~0)|)) (and .cse4 .cse0))) [2019-10-07 00:57:43,213 INFO L443 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2019-10-07 00:57:43,213 INFO L443 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-10-07 00:57:43,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.10 12:57:43 BoogieIcfgContainer [2019-10-07 00:57:43,235 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-07 00:57:43,237 INFO L168 Benchmark]: Toolchain (without parser) took 10212.09 ms. Allocated memory was 142.6 MB in the beginning and 361.2 MB in the end (delta: 218.6 MB). Free memory was 98.7 MB in the beginning and 178.6 MB in the end (delta: -80.0 MB). Peak memory consumption was 239.1 MB. Max. memory is 7.1 GB. [2019-10-07 00:57:43,238 INFO L168 Benchmark]: CDTParser took 1.15 ms. Allocated memory is still 142.6 MB. Free memory was 119.0 MB in the beginning and 118.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-07 00:57:43,239 INFO L168 Benchmark]: CACSL2BoogieTranslator took 709.88 ms. Allocated memory was 142.6 MB in the beginning and 200.8 MB in the end (delta: 58.2 MB). Free memory was 98.5 MB in the beginning and 163.2 MB in the end (delta: -64.7 MB). Peak memory consumption was 23.9 MB. Max. memory is 7.1 GB. [2019-10-07 00:57:43,239 INFO L168 Benchmark]: Boogie Preprocessor took 97.13 ms. Allocated memory is still 200.8 MB. Free memory was 163.2 MB in the beginning and 158.0 MB in the end (delta: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 7.1 GB. [2019-10-07 00:57:43,240 INFO L168 Benchmark]: RCFGBuilder took 2142.21 ms. Allocated memory was 200.8 MB in the beginning and 255.9 MB in the end (delta: 55.1 MB). Free memory was 158.0 MB in the beginning and 205.9 MB in the end (delta: -47.8 MB). Peak memory consumption was 114.2 MB. Max. memory is 7.1 GB. [2019-10-07 00:57:43,242 INFO L168 Benchmark]: TraceAbstraction took 7256.38 ms. Allocated memory was 255.9 MB in the beginning and 361.2 MB in the end (delta: 105.4 MB). Free memory was 205.9 MB in the beginning and 178.6 MB in the end (delta: 27.2 MB). Peak memory consumption was 233.1 MB. Max. memory is 7.1 GB. [2019-10-07 00:57:43,248 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.15 ms. Allocated memory is still 142.6 MB. Free memory was 119.0 MB in the beginning and 118.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 709.88 ms. Allocated memory was 142.6 MB in the beginning and 200.8 MB in the end (delta: 58.2 MB). Free memory was 98.5 MB in the beginning and 163.2 MB in the end (delta: -64.7 MB). Peak memory consumption was 23.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 97.13 ms. Allocated memory is still 200.8 MB. Free memory was 163.2 MB in the beginning and 158.0 MB in the end (delta: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2142.21 ms. Allocated memory was 200.8 MB in the beginning and 255.9 MB in the end (delta: 55.1 MB). Free memory was 158.0 MB in the beginning and 205.9 MB in the end (delta: -47.8 MB). Peak memory consumption was 114.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7256.38 ms. Allocated memory was 255.9 MB in the beginning and 361.2 MB in the end (delta: 105.4 MB). Free memory was 205.9 MB in the beginning and 178.6 MB in the end (delta: 27.2 MB). Peak memory consumption was 233.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 526]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: ((((((((((a19 == 1 && !(a28 == 11)) || !(8 <= \old(a17))) || ((!(1 == a11) && 8 <= a17) && !(a25 == 1))) || (8 <= a17 && !(a28 == 11))) || 11 == \old(a28)) || 1 == \old(a25)) || (8 < a28 && !(a28 == 11))) || 1 == \old(a11)) || (!(1 == a11) && a19 == 1)) || !(1 == \old(a19))) || (!(a25 == 1) && a19 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 95 locations, 1 error locations. Result: SAFE, OverallTime: 7.1s, OverallIterations: 6, TraceHistogramMax: 3, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.0s, HoareTripleCheckerStatistics: 318 SDtfs, 736 SDslu, 157 SDs, 0 SdLazy, 2175 SolverSat, 550 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 542 GetRequests, 509 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1573occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 6 MinimizatonAttempts, 202 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 61 PreInvPairs, 117 NumberOfFragments, 411 HoareAnnotationTreeSize, 61 FomulaSimplifications, 1504 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 1000 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 898 NumberOfCodeBlocks, 898 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1136 ConstructedInterpolants, 0 QuantifiedInterpolants, 329293 SizeOfPredicates, 4 NumberOfNonLiveVariables, 831 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 295/319 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...