/usr/bin/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 --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label56.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 22:37:08,859 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 22:37:08,862 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 22:37:08,880 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 22:37:08,880 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 22:37:08,882 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 22:37:08,884 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 22:37:08,892 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 22:37:08,896 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 22:37:08,900 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 22:37:08,900 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 22:37:08,902 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 22:37:08,902 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 22:37:08,904 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 22:37:08,905 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 22:37:08,907 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 22:37:08,909 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 22:37:08,910 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 22:37:08,911 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 22:37:08,913 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 22:37:08,917 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 22:37:08,920 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 22:37:08,922 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 22:37:08,923 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 22:37:08,925 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 22:37:08,925 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 22:37:08,926 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 22:37:08,927 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 22:37:08,928 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 22:37:08,930 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 22:37:08,930 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 22:37:08,931 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 22:37:08,932 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 22:37:08,933 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 22:37:08,935 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 22:37:08,935 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 22:37:08,935 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 22:37:08,936 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 22:37:08,936 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 22:37:08,937 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 22:37:08,937 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 22:37:08,938 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-11-06 22:37:08,973 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 22:37:08,973 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 22:37:08,974 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 22:37:08,974 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 22:37:08,974 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 22:37:08,975 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 22:37:08,975 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 22:37:08,975 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 22:37:08,975 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 22:37:08,975 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 22:37:08,976 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 22:37:08,976 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 22:37:08,976 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 22:37:08,976 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 22:37:08,976 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 22:37:08,976 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 22:37:08,977 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 22:37:08,979 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 22:37:08,979 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 22:37:08,979 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 22:37:08,980 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 22:37:08,980 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 22:37:08,980 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 22:37:08,980 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 22:37:08,980 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 22:37:08,981 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 22:37:08,981 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 22:37:08,981 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 22:37:08,981 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-11-06 22:37:09,277 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 22:37:09,300 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 22:37:09,303 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 22:37:09,304 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 22:37:09,305 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 22:37:09,305 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label56.c [2019-11-06 22:37:09,373 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5553fe9f6/5c357666fe584a40b8dc4251d02db6f6/FLAG8b55c4cce [2019-11-06 22:37:09,889 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 22:37:09,890 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label56.c [2019-11-06 22:37:09,900 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5553fe9f6/5c357666fe584a40b8dc4251d02db6f6/FLAG8b55c4cce [2019-11-06 22:37:10,194 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5553fe9f6/5c357666fe584a40b8dc4251d02db6f6 [2019-11-06 22:37:10,204 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 22:37:10,206 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 22:37:10,207 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 22:37:10,207 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 22:37:10,210 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 22:37:10,211 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:37:10" (1/1) ... [2019-11-06 22:37:10,214 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ba9d4c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:37:10, skipping insertion in model container [2019-11-06 22:37:10,214 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:37:10" (1/1) ... [2019-11-06 22:37:10,222 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 22:37:10,269 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 22:37:10,768 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:37:10,773 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 22:37:10,953 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:37:10,969 INFO L192 MainTranslator]: Completed translation [2019-11-06 22:37:10,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:37:10 WrapperNode [2019-11-06 22:37:10,970 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 22:37:10,971 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 22:37:10,971 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 22:37:10,971 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 22:37:10,985 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:37:10" (1/1) ... [2019-11-06 22:37:10,985 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:37:10" (1/1) ... [2019-11-06 22:37:11,002 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:37:10" (1/1) ... [2019-11-06 22:37:11,003 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:37:10" (1/1) ... [2019-11-06 22:37:11,041 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:37:10" (1/1) ... [2019-11-06 22:37:11,061 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:37:10" (1/1) ... [2019-11-06 22:37:11,072 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:37:10" (1/1) ... [2019-11-06 22:37:11,089 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 22:37:11,090 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 22:37:11,090 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 22:37:11,090 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 22:37:11,094 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:37:10" (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-11-06 22:37:11,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 22:37:11,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 22:37:11,186 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-11-06 22:37:11,187 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 22:37:11,187 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-11-06 22:37:11,188 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 22:37:11,188 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 22:37:11,189 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-06 22:37:11,189 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 22:37:11,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 22:37:11,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 22:37:12,581 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 22:37:12,581 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-06 22:37:12,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:37:12 BoogieIcfgContainer [2019-11-06 22:37:12,583 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 22:37:12,584 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 22:37:12,584 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 22:37:12,587 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 22:37:12,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:37:10" (1/3) ... [2019-11-06 22:37:12,588 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27806cc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:37:12, skipping insertion in model container [2019-11-06 22:37:12,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:37:10" (2/3) ... [2019-11-06 22:37:12,589 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27806cc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:37:12, skipping insertion in model container [2019-11-06 22:37:12,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:37:12" (3/3) ... [2019-11-06 22:37:12,591 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label56.c [2019-11-06 22:37:12,600 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 22:37:12,609 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 22:37:12,621 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 22:37:12,650 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 22:37:12,650 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 22:37:12,650 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 22:37:12,650 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 22:37:12,651 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 22:37:12,651 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 22:37:12,651 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 22:37:12,651 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 22:37:12,677 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states. [2019-11-06 22:37:12,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-11-06 22:37:12,693 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:37:12,694 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:37:12,696 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:37:12,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:37:12,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1821084561, now seen corresponding path program 1 times [2019-11-06 22:37:12,712 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:37:12,712 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342746564] [2019-11-06 22:37:12,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:37:12,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:37:13,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:37:13,214 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342746564] [2019-11-06 22:37:13,215 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:37:13,216 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:37:13,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795870185] [2019-11-06 22:37:13,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:37:13,224 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:37:13,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:37:13,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:37:13,242 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 3 states. [2019-11-06 22:37:14,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:37:14,138 INFO L93 Difference]: Finished difference Result 618 states and 1056 transitions. [2019-11-06 22:37:14,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:37:14,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-11-06 22:37:14,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:37:14,171 INFO L225 Difference]: With dead ends: 618 [2019-11-06 22:37:14,171 INFO L226 Difference]: Without dead ends: 320 [2019-11-06 22:37:14,184 INFO L630 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-11-06 22:37:14,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-11-06 22:37:14,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-11-06 22:37:14,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-11-06 22:37:14,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 465 transitions. [2019-11-06 22:37:14,298 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 465 transitions. Word has length 129 [2019-11-06 22:37:14,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:37:14,302 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 465 transitions. [2019-11-06 22:37:14,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:37:14,302 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 465 transitions. [2019-11-06 22:37:14,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-11-06 22:37:14,314 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:37:14,314 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 22:37:14,314 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:37:14,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:37:14,315 INFO L82 PathProgramCache]: Analyzing trace with hash 2111824342, now seen corresponding path program 1 times [2019-11-06 22:37:14,315 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:37:14,315 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312689470] [2019-11-06 22:37:14,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:37:14,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:37:14,691 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:37:14,691 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312689470] [2019-11-06 22:37:14,691 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:37:14,692 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:37:14,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974173811] [2019-11-06 22:37:14,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:37:14,694 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:37:14,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:37:14,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:37:14,695 INFO L87 Difference]: Start difference. First operand 320 states and 465 transitions. Second operand 5 states. [2019-11-06 22:37:15,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:37:15,345 INFO L93 Difference]: Finished difference Result 721 states and 1089 transitions. [2019-11-06 22:37:15,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:37:15,351 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 137 [2019-11-06 22:37:15,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:37:15,355 INFO L225 Difference]: With dead ends: 721 [2019-11-06 22:37:15,356 INFO L226 Difference]: Without dead ends: 320 [2019-11-06 22:37:15,357 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:37:15,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-11-06 22:37:15,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-11-06 22:37:15,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-11-06 22:37:15,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 461 transitions. [2019-11-06 22:37:15,382 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 461 transitions. Word has length 137 [2019-11-06 22:37:15,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:37:15,382 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 461 transitions. [2019-11-06 22:37:15,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:37:15,382 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 461 transitions. [2019-11-06 22:37:15,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-06 22:37:15,384 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:37:15,385 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-06 22:37:15,385 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:37:15,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:37:15,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1931807906, now seen corresponding path program 1 times [2019-11-06 22:37:15,386 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:37:15,386 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265448935] [2019-11-06 22:37:15,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:37:15,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:37:15,726 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:37:15,727 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265448935] [2019-11-06 22:37:15,727 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:37:15,727 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:37:15,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653308948] [2019-11-06 22:37:15,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:37:15,729 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:37:15,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:37:15,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:37:15,729 INFO L87 Difference]: Start difference. First operand 320 states and 461 transitions. Second operand 5 states. [2019-11-06 22:37:16,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:37:16,515 INFO L93 Difference]: Finished difference Result 717 states and 1075 transitions. [2019-11-06 22:37:16,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:37:16,515 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 143 [2019-11-06 22:37:16,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:37:16,518 INFO L225 Difference]: With dead ends: 717 [2019-11-06 22:37:16,518 INFO L226 Difference]: Without dead ends: 320 [2019-11-06 22:37:16,519 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:37:16,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-11-06 22:37:16,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-11-06 22:37:16,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-11-06 22:37:16,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 455 transitions. [2019-11-06 22:37:16,533 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 455 transitions. Word has length 143 [2019-11-06 22:37:16,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:37:16,534 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 455 transitions. [2019-11-06 22:37:16,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:37:16,534 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 455 transitions. [2019-11-06 22:37:16,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-06 22:37:16,536 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:37:16,536 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 22:37:16,536 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:37:16,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:37:16,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1452547207, now seen corresponding path program 1 times [2019-11-06 22:37:16,537 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:37:16,537 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321306946] [2019-11-06 22:37:16,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:37:16,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:37:16,621 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:37:16,621 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321306946] [2019-11-06 22:37:16,622 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:37:16,622 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 22:37:16,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386310532] [2019-11-06 22:37:16,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 22:37:16,623 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:37:16,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 22:37:16,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:37:16,624 INFO L87 Difference]: Start difference. First operand 320 states and 455 transitions. Second operand 6 states. [2019-11-06 22:37:17,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:37:17,451 INFO L93 Difference]: Finished difference Result 951 states and 1383 transitions. [2019-11-06 22:37:17,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 22:37:17,452 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 151 [2019-11-06 22:37:17,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:37:17,456 INFO L225 Difference]: With dead ends: 951 [2019-11-06 22:37:17,456 INFO L226 Difference]: Without dead ends: 637 [2019-11-06 22:37:17,457 INFO L630 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-11-06 22:37:17,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2019-11-06 22:37:17,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 626. [2019-11-06 22:37:17,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-11-06 22:37:17,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 871 transitions. [2019-11-06 22:37:17,482 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 871 transitions. Word has length 151 [2019-11-06 22:37:17,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:37:17,482 INFO L462 AbstractCegarLoop]: Abstraction has 626 states and 871 transitions. [2019-11-06 22:37:17,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 22:37:17,483 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 871 transitions. [2019-11-06 22:37:17,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-06 22:37:17,485 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:37:17,486 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-06 22:37:17,486 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:37:17,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:37:17,486 INFO L82 PathProgramCache]: Analyzing trace with hash 337022397, now seen corresponding path program 1 times [2019-11-06 22:37:17,487 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:37:17,487 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983501711] [2019-11-06 22:37:17,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:37:17,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:37:17,701 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:37:17,702 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983501711] [2019-11-06 22:37:17,702 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:37:17,702 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:37:17,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589937107] [2019-11-06 22:37:17,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:37:17,703 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:37:17,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:37:17,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:37:17,705 INFO L87 Difference]: Start difference. First operand 626 states and 871 transitions. Second operand 5 states. [2019-11-06 22:37:18,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:37:18,331 INFO L93 Difference]: Finished difference Result 1330 states and 1903 transitions. [2019-11-06 22:37:18,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:37:18,331 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2019-11-06 22:37:18,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:37:18,335 INFO L225 Difference]: With dead ends: 1330 [2019-11-06 22:37:18,335 INFO L226 Difference]: Without dead ends: 626 [2019-11-06 22:37:18,337 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:37:18,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-11-06 22:37:18,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-11-06 22:37:18,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-11-06 22:37:18,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 859 transitions. [2019-11-06 22:37:18,357 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 859 transitions. Word has length 153 [2019-11-06 22:37:18,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:37:18,358 INFO L462 AbstractCegarLoop]: Abstraction has 626 states and 859 transitions. [2019-11-06 22:37:18,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:37:18,358 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 859 transitions. [2019-11-06 22:37:18,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-06 22:37:18,361 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:37:18,361 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 22:37:18,361 INFO L410 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:37:18,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:37:18,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1950615551, now seen corresponding path program 1 times [2019-11-06 22:37:18,362 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:37:18,362 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56494412] [2019-11-06 22:37:18,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:37:18,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:37:18,535 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:37:18,535 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56494412] [2019-11-06 22:37:18,535 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:37:18,535 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:37:18,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538419424] [2019-11-06 22:37:18,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:37:18,536 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:37:18,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:37:18,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:37:18,537 INFO L87 Difference]: Start difference. First operand 626 states and 859 transitions. Second operand 5 states. [2019-11-06 22:37:19,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:37:19,192 INFO L93 Difference]: Finished difference Result 1332 states and 1878 transitions. [2019-11-06 22:37:19,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:37:19,193 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 155 [2019-11-06 22:37:19,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:37:19,196 INFO L225 Difference]: With dead ends: 1332 [2019-11-06 22:37:19,197 INFO L226 Difference]: Without dead ends: 626 [2019-11-06 22:37:19,198 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:37:19,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-11-06 22:37:19,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-11-06 22:37:19,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-11-06 22:37:19,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 843 transitions. [2019-11-06 22:37:19,218 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 843 transitions. Word has length 155 [2019-11-06 22:37:19,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:37:19,218 INFO L462 AbstractCegarLoop]: Abstraction has 626 states and 843 transitions. [2019-11-06 22:37:19,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:37:19,218 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 843 transitions. [2019-11-06 22:37:19,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-06 22:37:19,221 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:37:19,221 INFO L410 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, 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] [2019-11-06 22:37:19,222 INFO L410 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:37:19,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:37:19,222 INFO L82 PathProgramCache]: Analyzing trace with hash 2134314121, now seen corresponding path program 1 times [2019-11-06 22:37:19,222 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:37:19,222 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951672953] [2019-11-06 22:37:19,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:37:19,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:37:19,304 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:37:19,304 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951672953] [2019-11-06 22:37:19,305 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:37:19,305 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 22:37:19,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660359471] [2019-11-06 22:37:19,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 22:37:19,306 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:37:19,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 22:37:19,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:37:19,307 INFO L87 Difference]: Start difference. First operand 626 states and 843 transitions. Second operand 6 states. [2019-11-06 22:37:20,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:37:20,132 INFO L93 Difference]: Finished difference Result 1858 states and 2601 transitions. [2019-11-06 22:37:20,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 22:37:20,133 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 159 [2019-11-06 22:37:20,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:37:20,140 INFO L225 Difference]: With dead ends: 1858 [2019-11-06 22:37:20,140 INFO L226 Difference]: Without dead ends: 1238 [2019-11-06 22:37:20,142 INFO L630 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-11-06 22:37:20,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2019-11-06 22:37:20,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1218. [2019-11-06 22:37:20,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1218 states. [2019-11-06 22:37:20,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1637 transitions. [2019-11-06 22:37:20,180 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1637 transitions. Word has length 159 [2019-11-06 22:37:20,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:37:20,180 INFO L462 AbstractCegarLoop]: Abstraction has 1218 states and 1637 transitions. [2019-11-06 22:37:20,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 22:37:20,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1637 transitions. [2019-11-06 22:37:20,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-06 22:37:20,185 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:37:20,186 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 22:37:20,186 INFO L410 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:37:20,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:37:20,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1429632528, now seen corresponding path program 1 times [2019-11-06 22:37:20,187 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:37:20,187 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956742077] [2019-11-06 22:37:20,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:37:20,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:37:20,366 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 25 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:37:20,366 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956742077] [2019-11-06 22:37:20,366 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708531323] [2019-11-06 22:37:20,367 INFO L94 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-11-06 22:37:20,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:37:20,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-06 22:37:20,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:37:20,626 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-06 22:37:20,626 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-06 22:37:20,706 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-06 22:37:20,707 INFO L218 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-06 22:37:20,707 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [9] total 10 [2019-11-06 22:37:20,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068078572] [2019-11-06 22:37:20,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:37:20,709 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:37:20,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:37:20,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:37:20,710 INFO L87 Difference]: Start difference. First operand 1218 states and 1637 transitions. Second operand 3 states. [2019-11-06 22:37:21,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:37:21,233 INFO L93 Difference]: Finished difference Result 3012 states and 4067 transitions. [2019-11-06 22:37:21,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:37:21,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2019-11-06 22:37:21,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:37:21,240 INFO L225 Difference]: With dead ends: 3012 [2019-11-06 22:37:21,241 INFO L226 Difference]: Without dead ends: 1060 [2019-11-06 22:37:21,247 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 328 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:37:21,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2019-11-06 22:37:21,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 1060. [2019-11-06 22:37:21,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1060 states. [2019-11-06 22:37:21,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1380 transitions. [2019-11-06 22:37:21,285 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1380 transitions. Word has length 164 [2019-11-06 22:37:21,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:37:21,286 INFO L462 AbstractCegarLoop]: Abstraction has 1060 states and 1380 transitions. [2019-11-06 22:37:21,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:37:21,286 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1380 transitions. [2019-11-06 22:37:21,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-11-06 22:37:21,291 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:37:21,291 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-06 22:37:21,497 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:37:21,498 INFO L410 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:37:21,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:37:21,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1714787223, now seen corresponding path program 1 times [2019-11-06 22:37:21,500 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:37:21,500 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39539000] [2019-11-06 22:37:21,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:37:21,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:37:21,661 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 70 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:37:21,661 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39539000] [2019-11-06 22:37:21,661 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530614130] [2019-11-06 22:37:21,662 INFO L94 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-11-06 22:37:21,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:37:21,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-06 22:37:21,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:37:21,840 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-06 22:37:21,841 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-06 22:37:21,907 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-06 22:37:21,908 INFO L218 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-06 22:37:21,908 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 8 [2019-11-06 22:37:21,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075791902] [2019-11-06 22:37:21,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:37:21,909 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:37:21,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:37:21,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-06 22:37:21,910 INFO L87 Difference]: Start difference. First operand 1060 states and 1380 transitions. Second operand 4 states. [2019-11-06 22:37:22,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:37:22,672 INFO L93 Difference]: Finished difference Result 2844 states and 3759 transitions. [2019-11-06 22:37:22,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:37:22,673 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 196 [2019-11-06 22:37:22,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:37:22,674 INFO L225 Difference]: With dead ends: 2844 [2019-11-06 22:37:22,674 INFO L226 Difference]: Without dead ends: 0 [2019-11-06 22:37:22,679 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 391 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-06 22:37:22,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-06 22:37:22,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-06 22:37:22,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-06 22:37:22,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-06 22:37:22,680 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 196 [2019-11-06 22:37:22,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:37:22,681 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-06 22:37:22,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:37:22,681 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-06 22:37:22,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-06 22:37:22,893 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:37:22,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-06 22:37:23,378 WARN L191 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 64 [2019-11-06 22:37:23,544 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-11-06 22:37:23,544 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-11-06 22:37:23,544 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-11-06 22:37:23,545 INFO L443 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2019-11-06 22:37:23,545 INFO L443 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2019-11-06 22:37:23,545 INFO L443 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2019-11-06 22:37:23,545 INFO L443 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2019-11-06 22:37:23,545 INFO L443 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2019-11-06 22:37:23,545 INFO L443 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-11-06 22:37:23,545 INFO L443 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-11-06 22:37:23,546 INFO L443 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2019-11-06 22:37:23,546 INFO L443 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2019-11-06 22:37:23,546 INFO L443 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2019-11-06 22:37:23,546 INFO L443 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2019-11-06 22:37:23,546 INFO L443 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2019-11-06 22:37:23,546 INFO L443 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-11-06 22:37:23,546 INFO L443 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-11-06 22:37:23,546 INFO L443 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-11-06 22:37:23,547 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2019-11-06 22:37:23,547 INFO L443 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2019-11-06 22:37:23,547 INFO L443 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-11-06 22:37:23,547 INFO L443 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2019-11-06 22:37:23,547 INFO L443 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2019-11-06 22:37:23,547 INFO L443 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2019-11-06 22:37:23,547 INFO L443 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2019-11-06 22:37:23,547 INFO L443 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-11-06 22:37:23,548 INFO L443 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2019-11-06 22:37:23,548 INFO L443 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-11-06 22:37:23,548 INFO L443 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2019-11-06 22:37:23,548 INFO L443 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2019-11-06 22:37:23,548 INFO L443 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2019-11-06 22:37:23,548 INFO L443 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2019-11-06 22:37:23,548 INFO L443 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2019-11-06 22:37:23,548 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-11-06 22:37:23,548 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2019-11-06 22:37:23,548 INFO L443 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2019-11-06 22:37:23,549 INFO L443 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-11-06 22:37:23,549 INFO L443 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-11-06 22:37:23,549 INFO L443 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-11-06 22:37:23,549 INFO L443 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2019-11-06 22:37:23,549 INFO L443 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2019-11-06 22:37:23,549 INFO L443 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-11-06 22:37:23,549 INFO L443 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2019-11-06 22:37:23,549 INFO L443 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2019-11-06 22:37:23,549 INFO L443 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2019-11-06 22:37:23,550 INFO L443 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2019-11-06 22:37:23,550 INFO L443 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2019-11-06 22:37:23,550 INFO L443 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2019-11-06 22:37:23,550 INFO L443 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-11-06 22:37:23,550 INFO L443 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2019-11-06 22:37:23,550 INFO L443 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2019-11-06 22:37:23,550 INFO L443 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2019-11-06 22:37:23,550 INFO L443 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2019-11-06 22:37:23,551 INFO L443 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2019-11-06 22:37:23,551 INFO L443 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2019-11-06 22:37:23,551 INFO L443 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-11-06 22:37:23,551 INFO L443 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-11-06 22:37:23,551 INFO L443 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-11-06 22:37:23,551 INFO L443 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2019-11-06 22:37:23,551 INFO L443 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2019-11-06 22:37:23,551 INFO L443 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2019-11-06 22:37:23,551 INFO L443 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2019-11-06 22:37:23,552 INFO L443 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2019-11-06 22:37:23,552 INFO L443 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-11-06 22:37:23,552 INFO L443 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-11-06 22:37:23,552 INFO L443 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-11-06 22:37:23,552 INFO L443 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2019-11-06 22:37:23,552 INFO L443 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2019-11-06 22:37:23,552 INFO L443 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2019-11-06 22:37:23,552 INFO L443 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2019-11-06 22:37:23,552 INFO L443 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2019-11-06 22:37:23,553 INFO L443 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-11-06 22:37:23,553 INFO L443 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-11-06 22:37:23,553 INFO L443 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-11-06 22:37:23,553 INFO L443 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-11-06 22:37:23,553 INFO L443 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-11-06 22:37:23,553 INFO L443 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2019-11-06 22:37:23,553 INFO L443 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2019-11-06 22:37:23,553 INFO L443 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2019-11-06 22:37:23,554 INFO L443 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2019-11-06 22:37:23,554 INFO L443 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2019-11-06 22:37:23,554 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-11-06 22:37:23,554 INFO L443 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2019-11-06 22:37:23,554 INFO L443 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2019-11-06 22:37:23,554 INFO L443 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2019-11-06 22:37:23,554 INFO L443 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2019-11-06 22:37:23,554 INFO L443 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2019-11-06 22:37:23,554 INFO L443 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-11-06 22:37:23,555 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-11-06 22:37:23,555 INFO L443 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-11-06 22:37:23,555 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-11-06 22:37:23,555 INFO L443 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-11-06 22:37:23,555 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 541) no Hoare annotation was computed. [2019-11-06 22:37:23,555 INFO L443 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-11-06 22:37:23,555 INFO L443 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-11-06 22:37:23,555 INFO L443 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2019-11-06 22:37:23,556 INFO L443 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-11-06 22:37:23,556 INFO L443 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2019-11-06 22:37:23,556 INFO L443 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2019-11-06 22:37:23,556 INFO L443 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2019-11-06 22:37:23,556 INFO L443 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2019-11-06 22:37:23,556 INFO L443 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2019-11-06 22:37:23,556 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2019-11-06 22:37:23,556 INFO L443 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2019-11-06 22:37:23,556 INFO L443 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2019-11-06 22:37:23,557 INFO L443 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2019-11-06 22:37:23,557 INFO L443 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2019-11-06 22:37:23,557 INFO L443 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2019-11-06 22:37:23,557 INFO L443 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2019-11-06 22:37:23,557 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2019-11-06 22:37:23,557 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2019-11-06 22:37:23,557 INFO L443 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2019-11-06 22:37:23,557 INFO L443 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2019-11-06 22:37:23,557 INFO L443 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2019-11-06 22:37:23,558 INFO L443 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2019-11-06 22:37:23,558 INFO L443 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2019-11-06 22:37:23,558 INFO L443 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2019-11-06 22:37:23,558 INFO L443 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-11-06 22:37:23,558 INFO L443 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-11-06 22:37:23,558 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-11-06 22:37:23,558 INFO L443 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-11-06 22:37:23,558 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-11-06 22:37:23,558 INFO L443 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2019-11-06 22:37:23,559 INFO L443 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2019-11-06 22:37:23,559 INFO L443 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2019-11-06 22:37:23,559 INFO L443 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2019-11-06 22:37:23,559 INFO L443 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2019-11-06 22:37:23,559 INFO L443 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2019-11-06 22:37:23,559 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-11-06 22:37:23,559 INFO L443 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2019-11-06 22:37:23,559 INFO L443 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2019-11-06 22:37:23,559 INFO L443 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2019-11-06 22:37:23,559 INFO L443 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2019-11-06 22:37:23,560 INFO L443 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2019-11-06 22:37:23,560 INFO L443 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2019-11-06 22:37:23,560 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-11-06 22:37:23,560 INFO L443 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-11-06 22:37:23,560 INFO L443 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-11-06 22:37:23,560 INFO L443 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-11-06 22:37:23,560 INFO L443 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2019-11-06 22:37:23,560 INFO L443 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2019-11-06 22:37:23,560 INFO L443 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2019-11-06 22:37:23,561 INFO L443 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2019-11-06 22:37:23,561 INFO L443 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2019-11-06 22:37:23,561 INFO L443 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2019-11-06 22:37:23,561 INFO L443 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-11-06 22:37:23,561 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-11-06 22:37:23,561 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-11-06 22:37:23,561 INFO L443 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2019-11-06 22:37:23,561 INFO L443 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2019-11-06 22:37:23,561 INFO L443 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2019-11-06 22:37:23,562 INFO L443 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2019-11-06 22:37:23,562 INFO L443 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2019-11-06 22:37:23,562 INFO L443 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2019-11-06 22:37:23,562 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-11-06 22:37:23,562 INFO L443 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-11-06 22:37:23,562 INFO L443 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-11-06 22:37:23,562 INFO L443 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-11-06 22:37:23,562 INFO L443 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-11-06 22:37:23,562 INFO L443 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2019-11-06 22:37:23,563 INFO L443 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2019-11-06 22:37:23,563 INFO L443 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2019-11-06 22:37:23,563 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse1 (= 1 |old(~a11~0)|)) (.cse12 (= 1 |old(~a19~0)|)) (.cse13 (= 1 |old(~a25~0)|))) (let ((.cse4 (not .cse13)) (.cse5 (not .cse12)) (.cse11 (not (= 7 |old(~a28~0)|))) (.cse9 (= ~a19~0 1)) (.cse8 (= ~a17~0 8)) (.cse10 (= ~a11~0 1)) (.cse6 (not (= 8 |old(~a17~0)|))) (.cse7 (not .cse1)) (.cse0 (not (= 1 ~a21~0))) (.cse2 (= ~a28~0 |old(~a28~0)|)) (.cse3 (= ~a25~0 |old(~a25~0)|))) (and (or .cse0 .cse1 (and (not (= 1 ~a11~0)) .cse2 .cse3)) (or .cse0 (not (= 10 |old(~a28~0)|)) .cse4 .cse5 .cse6 .cse7 (and (= ~a28~0 10) .cse8 .cse9 .cse10 .cse3)) (or .cse0 (and (<= ~a17~0 7) .cse2 .cse3) (not (<= |old(~a17~0)| 7))) (or .cse0 .cse4 .cse5 .cse6 (and .cse8 .cse9 .cse10) (not (= 9 |old(~a28~0)|)) .cse7) (or .cse0 .cse11 .cse4 .cse5 (and (= ~a17~0 7) .cse9 .cse10) .cse7 (not (= 7 |old(~a17~0)|))) (or .cse12 .cse0 .cse11 (and (not .cse9) .cse8 .cse10) .cse6 .cse7 .cse13) (or .cse0 (and .cse2 .cse3) (not (< |old(~a28~0)| 10)))))) [2019-11-06 22:37:23,563 INFO L443 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2019-11-06 22:37:23,563 INFO L443 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2019-11-06 22:37:23,564 INFO L443 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2019-11-06 22:37:23,564 INFO L443 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-11-06 22:37:23,564 INFO L443 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-11-06 22:37:23,564 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-11-06 22:37:23,564 INFO L443 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2019-11-06 22:37:23,564 INFO L443 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2019-11-06 22:37:23,564 INFO L443 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2019-11-06 22:37:23,564 INFO L443 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2019-11-06 22:37:23,564 INFO L443 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2019-11-06 22:37:23,565 INFO L443 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2019-11-06 22:37:23,565 INFO L443 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-11-06 22:37:23,565 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-11-06 22:37:23,565 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-11-06 22:37:23,565 INFO L443 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-11-06 22:37:23,565 INFO L443 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2019-11-06 22:37:23,565 INFO L443 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2019-11-06 22:37:23,565 INFO L443 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2019-11-06 22:37:23,565 INFO L443 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2019-11-06 22:37:23,566 INFO L443 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2019-11-06 22:37:23,566 INFO L443 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2019-11-06 22:37:23,566 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-11-06 22:37:23,566 INFO L443 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-11-06 22:37:23,566 INFO L443 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2019-11-06 22:37:23,566 INFO L443 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2019-11-06 22:37:23,566 INFO L443 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2019-11-06 22:37:23,566 INFO L443 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2019-11-06 22:37:23,566 INFO L443 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2019-11-06 22:37:23,566 INFO L443 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2019-11-06 22:37:23,567 INFO L443 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-11-06 22:37:23,567 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-11-06 22:37:23,567 INFO L443 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-11-06 22:37:23,567 INFO L443 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2019-11-06 22:37:23,567 INFO L443 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2019-11-06 22:37:23,567 INFO L443 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-11-06 22:37:23,567 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-11-06 22:37:23,567 INFO L443 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2019-11-06 22:37:23,567 INFO L443 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2019-11-06 22:37:23,567 INFO L443 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2019-11-06 22:37:23,568 INFO L443 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2019-11-06 22:37:23,568 INFO L443 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2019-11-06 22:37:23,568 INFO L443 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2019-11-06 22:37:23,568 INFO L443 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-11-06 22:37:23,568 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-11-06 22:37:23,568 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-11-06 22:37:23,568 INFO L443 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-11-06 22:37:23,568 INFO L443 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2019-11-06 22:37:23,568 INFO L443 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2019-11-06 22:37:23,568 INFO L443 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2019-11-06 22:37:23,569 INFO L443 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2019-11-06 22:37:23,569 INFO L443 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2019-11-06 22:37:23,569 INFO L443 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2019-11-06 22:37:23,569 INFO L443 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-11-06 22:37:23,569 INFO L443 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2019-11-06 22:37:23,569 INFO L443 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-11-06 22:37:23,569 INFO L443 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2019-11-06 22:37:23,569 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-11-06 22:37:23,569 INFO L443 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2019-11-06 22:37:23,569 INFO L443 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2019-11-06 22:37:23,569 INFO L443 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-11-06 22:37:23,569 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-11-06 22:37:23,570 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-06 22:37:23,570 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= 1 ~a11~0)) (<= ~a28~0 7) (not (= ~a25~0 1)) (= ~a21~0 1)) [2019-11-06 22:37:23,570 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-06 22:37:23,570 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-06 22:37:23,570 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (= 1 ~a21~0)) (not (<= |old(~a28~0)| 7)) (= 1 |old(~a11~0)|) (and (not (= 1 ~a11~0)) (= ~a28~0 |old(~a28~0)|) (= ~a25~0 |old(~a25~0)|)) (= 1 |old(~a25~0)|)) [2019-11-06 22:37:23,570 INFO L439 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (or (not (= 1 ~a21~0)) (not (<= |old(~a28~0)| 7)) (<= ~a17~0 7) (= 1 |old(~a25~0)|) (= 1 |old(~a11~0)|) (not (= 1 ~a11~0)) (< ~a28~0 10) (and (= ~a28~0 10) (= ~a17~0 8) (= ~a19~0 1) (= ~a25~0 1))) [2019-11-06 22:37:23,570 INFO L443 ceAbstractionStarter]: For program point L606-3(lines 600 617) no Hoare annotation was computed. [2019-11-06 22:37:23,570 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2019-11-06 22:37:23,570 INFO L439 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (or (not (= 1 ~a21~0)) (not (<= |old(~a28~0)| 7)) (<= ~a17~0 7) (= 1 |old(~a25~0)|) (= 1 |old(~a11~0)|) (not (= 1 ~a11~0)) (< ~a28~0 10) (and (= ~a28~0 10) (= ~a17~0 8) (= ~a19~0 1) (= ~a25~0 1))) [2019-11-06 22:37:23,570 INFO L443 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2019-11-06 22:37:23,570 INFO L443 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-11-06 22:37:23,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:37:23 BoogieIcfgContainer [2019-11-06 22:37:23,588 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-06 22:37:23,590 INFO L168 Benchmark]: Toolchain (without parser) took 13383.79 ms. Allocated memory was 139.5 MB in the beginning and 412.6 MB in the end (delta: 273.2 MB). Free memory was 101.0 MB in the beginning and 132.1 MB in the end (delta: -31.1 MB). Peak memory consumption was 242.0 MB. Max. memory is 7.1 GB. [2019-11-06 22:37:23,591 INFO L168 Benchmark]: CDTParser took 1.43 ms. Allocated memory is still 139.5 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-06 22:37:23,592 INFO L168 Benchmark]: CACSL2BoogieTranslator took 763.23 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 100.8 MB in the beginning and 164.9 MB in the end (delta: -64.1 MB). Peak memory consumption was 27.6 MB. Max. memory is 7.1 GB. [2019-11-06 22:37:23,593 INFO L168 Benchmark]: Boogie Preprocessor took 119.00 ms. Allocated memory is still 203.4 MB. Free memory was 164.9 MB in the beginning and 160.2 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 7.1 GB. [2019-11-06 22:37:23,594 INFO L168 Benchmark]: RCFGBuilder took 1493.14 ms. Allocated memory was 203.4 MB in the beginning and 234.9 MB in the end (delta: 31.5 MB). Free memory was 160.2 MB in the beginning and 171.0 MB in the end (delta: -10.8 MB). Peak memory consumption was 75.2 MB. Max. memory is 7.1 GB. [2019-11-06 22:37:23,595 INFO L168 Benchmark]: TraceAbstraction took 11003.84 ms. Allocated memory was 234.9 MB in the beginning and 412.6 MB in the end (delta: 177.7 MB). Free memory was 171.0 MB in the beginning and 132.1 MB in the end (delta: 39.0 MB). Peak memory consumption was 216.7 MB. Max. memory is 7.1 GB. [2019-11-06 22:37:23,599 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.43 ms. Allocated memory is still 139.5 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 763.23 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 100.8 MB in the beginning and 164.9 MB in the end (delta: -64.1 MB). Peak memory consumption was 27.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 119.00 ms. Allocated memory is still 203.4 MB. Free memory was 164.9 MB in the beginning and 160.2 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1493.14 ms. Allocated memory was 203.4 MB in the beginning and 234.9 MB in the end (delta: 31.5 MB). Free memory was 160.2 MB in the beginning and 171.0 MB in the end (delta: -10.8 MB). Peak memory consumption was 75.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11003.84 ms. Allocated memory was 234.9 MB in the beginning and 412.6 MB in the end (delta: 177.7 MB). Free memory was 171.0 MB in the beginning and 132.1 MB in the end (delta: 39.0 MB). Peak memory consumption was 216.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 541]: 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: ((((((!(1 == a21) || !(\old(a28) <= 7)) || a17 <= 7) || 1 == \old(a25)) || 1 == \old(a11)) || !(1 == a11)) || a28 < 10) || (((a28 == 10 && a17 == 8) && a19 == 1) && a25 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 236 locations, 1 error locations. Result: SAFE, OverallTime: 10.9s, OverallIterations: 9, TraceHistogramMax: 3, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, HoareTripleCheckerStatistics: 751 SDtfs, 2547 SDslu, 355 SDs, 0 SdLazy, 4764 SolverSat, 813 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 792 GetRequests, 746 SyntacticMatches, 5 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1218occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 31 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 61 PreInvPairs, 103 NumberOfFragments, 325 HoareAnnotationTreeSize, 61 FomulaSimplifications, 1014 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 832 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1747 NumberOfCodeBlocks, 1747 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2094 ConstructedInterpolants, 0 QuantifiedInterpolants, 1684477 SizeOfPredicates, 4 NumberOfNonLiveVariables, 868 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 13 InterpolantComputations, 11 PerfectInterpolantSequences, 429/448 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...