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 -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label26.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 17:54:20,171 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 17:54:20,174 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 17:54:20,194 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 17:54:20,194 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 17:54:20,196 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 17:54:20,198 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 17:54:20,208 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 17:54:20,212 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 17:54:20,214 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 17:54:20,215 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 17:54:20,216 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 17:54:20,216 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 17:54:20,217 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 17:54:20,218 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 17:54:20,219 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 17:54:20,220 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 17:54:20,221 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 17:54:20,224 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 17:54:20,225 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 17:54:20,227 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 17:54:20,228 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 17:54:20,229 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 17:54:20,230 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 17:54:20,232 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 17:54:20,232 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 17:54:20,233 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 17:54:20,233 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 17:54:20,234 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 17:54:20,235 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 17:54:20,235 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 17:54:20,237 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 17:54:20,239 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 17:54:20,240 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 17:54:20,241 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 17:54:20,241 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 17:54:20,242 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 17:54:20,242 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 17:54:20,242 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 17:54:20,243 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 17:54:20,244 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 17:54:20,245 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 17:54:20,259 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 17:54:20,259 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 17:54:20,260 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 17:54:20,261 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 17:54:20,261 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 17:54:20,261 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 17:54:20,261 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 17:54:20,261 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 17:54:20,262 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 17:54:20,262 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 17:54:20,262 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 17:54:20,262 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 17:54:20,262 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 17:54:20,263 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 17:54:20,263 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 17:54:20,263 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 17:54:20,263 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 17:54:20,263 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 17:54:20,264 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 17:54:20,264 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 17:54:20,264 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 17:54:20,264 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 17:54:20,265 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 17:54:20,265 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 17:54:20,265 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 17:54:20,265 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 17:54:20,265 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 17:54:20,266 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 17:54:20,266 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 17:54:20,575 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 17:54:20,592 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 17:54:20,596 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 17:54:20,598 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 17:54:20,598 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 17:54:20,599 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label26.c [2019-10-13 17:54:20,677 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ca1cfba8/ab8f38148d424c19987cdf9669f07fc3/FLAGda1f53066 [2019-10-13 17:54:21,253 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 17:54:21,253 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label26.c [2019-10-13 17:54:21,265 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ca1cfba8/ab8f38148d424c19987cdf9669f07fc3/FLAGda1f53066 [2019-10-13 17:54:21,515 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ca1cfba8/ab8f38148d424c19987cdf9669f07fc3 [2019-10-13 17:54:21,528 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 17:54:21,531 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 17:54:21,532 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 17:54:21,532 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 17:54:21,536 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 17:54:21,537 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:54:21" (1/1) ... [2019-10-13 17:54:21,540 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d066b29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:54:21, skipping insertion in model container [2019-10-13 17:54:21,541 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:54:21" (1/1) ... [2019-10-13 17:54:21,550 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 17:54:21,608 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 17:54:22,137 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 17:54:22,151 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 17:54:22,385 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 17:54:22,415 INFO L192 MainTranslator]: Completed translation [2019-10-13 17:54:22,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:54:22 WrapperNode [2019-10-13 17:54:22,416 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 17:54:22,416 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 17:54:22,416 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 17:54:22,417 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 17:54:22,434 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:54:22" (1/1) ... [2019-10-13 17:54:22,435 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:54:22" (1/1) ... [2019-10-13 17:54:22,466 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:54:22" (1/1) ... [2019-10-13 17:54:22,467 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:54:22" (1/1) ... [2019-10-13 17:54:22,543 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:54:22" (1/1) ... [2019-10-13 17:54:22,563 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:54:22" (1/1) ... [2019-10-13 17:54:22,568 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:54:22" (1/1) ... [2019-10-13 17:54:22,576 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 17:54:22,577 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 17:54:22,577 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 17:54:22,577 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 17:54:22,581 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:54:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 17:54:22,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 17:54:22,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 17:54:22,661 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-13 17:54:22,661 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 17:54:22,661 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-13 17:54:22,661 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 17:54:22,661 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 17:54:22,662 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 17:54:22,662 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 17:54:22,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 17:54:22,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 17:54:23,945 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 17:54:23,947 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 17:54:23,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:54:23 BoogieIcfgContainer [2019-10-13 17:54:23,951 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 17:54:23,953 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 17:54:23,953 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 17:54:23,958 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 17:54:23,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 05:54:21" (1/3) ... [2019-10-13 17:54:23,960 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1de6a81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:54:23, skipping insertion in model container [2019-10-13 17:54:23,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:54:22" (2/3) ... [2019-10-13 17:54:23,961 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1de6a81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:54:23, skipping insertion in model container [2019-10-13 17:54:23,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:54:23" (3/3) ... [2019-10-13 17:54:23,970 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label26.c [2019-10-13 17:54:23,987 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 17:54:23,998 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 17:54:24,010 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 17:54:24,049 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 17:54:24,050 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 17:54:24,050 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 17:54:24,050 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 17:54:24,050 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 17:54:24,051 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 17:54:24,051 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 17:54:24,051 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 17:54:24,089 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states. [2019-10-13 17:54:24,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-13 17:54:24,113 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:54:24,114 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:54:24,117 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:54:24,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:54:24,124 INFO L82 PathProgramCache]: Analyzing trace with hash 2085668238, now seen corresponding path program 1 times [2019-10-13 17:54:24,135 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:54:24,135 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561561924] [2019-10-13 17:54:24,135 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:54:24,136 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:54:24,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:54:24,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:54:24,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:54:24,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 17:54:24,774 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561561924] [2019-10-13 17:54:24,775 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 17:54:24,775 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 17:54:24,776 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252946077] [2019-10-13 17:54:24,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 17:54:24,784 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:54:24,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 17:54:24,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 17:54:24,802 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 5 states. [2019-10-13 17:54:26,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:54:26,413 INFO L93 Difference]: Finished difference Result 627 states and 1073 transitions. [2019-10-13 17:54:26,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 17:54:26,416 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 142 [2019-10-13 17:54:26,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:54:26,433 INFO L225 Difference]: With dead ends: 627 [2019-10-13 17:54:26,433 INFO L226 Difference]: Without dead ends: 327 [2019-10-13 17:54:26,440 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-13 17:54:26,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-10-13 17:54:26,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 319. [2019-10-13 17:54:26,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-10-13 17:54:26,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 480 transitions. [2019-10-13 17:54:26,525 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 480 transitions. Word has length 142 [2019-10-13 17:54:26,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:54:26,528 INFO L462 AbstractCegarLoop]: Abstraction has 319 states and 480 transitions. [2019-10-13 17:54:26,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 17:54:26,529 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 480 transitions. [2019-10-13 17:54:26,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-13 17:54:26,547 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:54:26,548 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:54:26,548 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:54:26,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:54:26,549 INFO L82 PathProgramCache]: Analyzing trace with hash -2119639181, now seen corresponding path program 1 times [2019-10-13 17:54:26,549 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:54:26,550 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028632534] [2019-10-13 17:54:26,550 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:54:26,550 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:54:26,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:54:26,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:54:26,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:54:26,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:54:26,870 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 17:54:26,871 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028632534] [2019-10-13 17:54:26,871 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 17:54:26,872 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 17:54:26,872 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327616252] [2019-10-13 17:54:26,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 17:54:26,874 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:54:26,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 17:54:26,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-10-13 17:54:26,875 INFO L87 Difference]: Start difference. First operand 319 states and 480 transitions. Second operand 8 states. [2019-10-13 17:54:28,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:54:28,563 INFO L93 Difference]: Finished difference Result 972 states and 1528 transitions. [2019-10-13 17:54:28,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 17:54:28,564 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 157 [2019-10-13 17:54:28,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:54:28,569 INFO L225 Difference]: With dead ends: 972 [2019-10-13 17:54:28,569 INFO L226 Difference]: Without dead ends: 659 [2019-10-13 17:54:28,571 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-10-13 17:54:28,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2019-10-13 17:54:28,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 625. [2019-10-13 17:54:28,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 625 states. [2019-10-13 17:54:28,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 924 transitions. [2019-10-13 17:54:28,633 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 924 transitions. Word has length 157 [2019-10-13 17:54:28,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:54:28,634 INFO L462 AbstractCegarLoop]: Abstraction has 625 states and 924 transitions. [2019-10-13 17:54:28,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 17:54:28,634 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 924 transitions. [2019-10-13 17:54:28,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-13 17:54:28,638 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:54:28,638 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:54:28,638 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:54:28,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:54:28,639 INFO L82 PathProgramCache]: Analyzing trace with hash 105434168, now seen corresponding path program 1 times [2019-10-13 17:54:28,639 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:54:28,639 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627997593] [2019-10-13 17:54:28,640 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:54:28,640 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:54:28,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:54:28,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:54:28,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:54:28,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:54:28,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:54:28,897 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 17:54:28,898 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627997593] [2019-10-13 17:54:28,898 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833501190] [2019-10-13 17:54:28,898 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-10-13 17:54:28,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:54:28,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 17:54:29,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:54:29,105 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 23 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 17:54:29,106 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:54:29,106 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 12 [2019-10-13 17:54:29,107 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550914486] [2019-10-13 17:54:29,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 17:54:29,108 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:54:29,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 17:54:29,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-10-13 17:54:29,109 INFO L87 Difference]: Start difference. First operand 625 states and 924 transitions. Second operand 12 states. [2019-10-13 17:54:31,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:54:31,079 INFO L93 Difference]: Finished difference Result 1246 states and 1870 transitions. [2019-10-13 17:54:31,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 17:54:31,080 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 165 [2019-10-13 17:54:31,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:54:31,084 INFO L225 Difference]: With dead ends: 1246 [2019-10-13 17:54:31,085 INFO L226 Difference]: Without dead ends: 627 [2019-10-13 17:54:31,086 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2019-10-13 17:54:31,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2019-10-13 17:54:31,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 310. [2019-10-13 17:54:31,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-10-13 17:54:31,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 437 transitions. [2019-10-13 17:54:31,131 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 437 transitions. Word has length 165 [2019-10-13 17:54:31,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:54:31,131 INFO L462 AbstractCegarLoop]: Abstraction has 310 states and 437 transitions. [2019-10-13 17:54:31,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 17:54:31,131 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 437 transitions. [2019-10-13 17:54:31,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-13 17:54:31,136 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:54:31,136 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:54:31,337 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:54:31,338 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:54:31,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:54:31,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1005880998, now seen corresponding path program 1 times [2019-10-13 17:54:31,339 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:54:31,339 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356873340] [2019-10-13 17:54:31,340 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:54:31,340 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:54:31,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:54:31,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:54:31,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:54:31,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:54:31,550 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 17:54:31,551 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356873340] [2019-10-13 17:54:31,551 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 17:54:31,551 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 17:54:31,551 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192331550] [2019-10-13 17:54:31,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 17:54:31,552 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:54:31,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 17:54:31,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-10-13 17:54:31,553 INFO L87 Difference]: Start difference. First operand 310 states and 437 transitions. Second operand 9 states. [2019-10-13 17:54:33,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:54:33,484 INFO L93 Difference]: Finished difference Result 1090 states and 1577 transitions. [2019-10-13 17:54:33,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 17:54:33,489 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 164 [2019-10-13 17:54:33,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:54:33,493 INFO L225 Difference]: With dead ends: 1090 [2019-10-13 17:54:33,494 INFO L226 Difference]: Without dead ends: 786 [2019-10-13 17:54:33,495 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2019-10-13 17:54:33,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2019-10-13 17:54:33,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 760. [2019-10-13 17:54:33,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 760 states. [2019-10-13 17:54:33,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1044 transitions. [2019-10-13 17:54:33,529 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1044 transitions. Word has length 164 [2019-10-13 17:54:33,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:54:33,530 INFO L462 AbstractCegarLoop]: Abstraction has 760 states and 1044 transitions. [2019-10-13 17:54:33,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 17:54:33,530 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1044 transitions. [2019-10-13 17:54:33,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-13 17:54:33,534 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:54:33,534 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:54:33,534 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:54:33,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:54:33,535 INFO L82 PathProgramCache]: Analyzing trace with hash -315093218, now seen corresponding path program 1 times [2019-10-13 17:54:33,535 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:54:33,535 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410678829] [2019-10-13 17:54:33,536 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:54:33,536 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:54:33,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:54:33,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:54:33,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:54:33,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:54:34,028 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 17:54:34,029 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410678829] [2019-10-13 17:54:34,030 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859243135] [2019-10-13 17:54:34,030 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-10-13 17:54:34,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:54:34,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 17:54:34,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:54:34,341 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 17:54:34,342 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 17:54:34,342 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-10-13 17:54:34,343 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500702703] [2019-10-13 17:54:34,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 17:54:34,343 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:54:34,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 17:54:34,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-13 17:54:34,344 INFO L87 Difference]: Start difference. First operand 760 states and 1044 transitions. Second operand 3 states. [2019-10-13 17:54:34,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:54:34,871 INFO L93 Difference]: Finished difference Result 2099 states and 2947 transitions. [2019-10-13 17:54:34,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 17:54:34,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-10-13 17:54:34,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:54:34,893 INFO L225 Difference]: With dead ends: 2099 [2019-10-13 17:54:34,894 INFO L226 Difference]: Without dead ends: 1345 [2019-10-13 17:54:34,898 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 172 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-13 17:54:34,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2019-10-13 17:54:34,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1199. [2019-10-13 17:54:34,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1199 states. [2019-10-13 17:54:34,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 1542 transitions. [2019-10-13 17:54:34,974 INFO L78 Accepts]: Start accepts. Automaton has 1199 states and 1542 transitions. Word has length 168 [2019-10-13 17:54:34,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:54:34,976 INFO L462 AbstractCegarLoop]: Abstraction has 1199 states and 1542 transitions. [2019-10-13 17:54:34,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 17:54:34,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 1542 transitions. [2019-10-13 17:54:34,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-10-13 17:54:34,982 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:54:34,983 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:54:35,188 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:54:35,188 INFO L410 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:54:35,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:54:35,189 INFO L82 PathProgramCache]: Analyzing trace with hash -393389681, now seen corresponding path program 1 times [2019-10-13 17:54:35,189 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:54:35,190 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582000047] [2019-10-13 17:54:35,190 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:54:35,190 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:54:35,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:54:35,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:54:35,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:54:35,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:54:35,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:54:35,455 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 27 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-13 17:54:35,455 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582000047] [2019-10-13 17:54:35,456 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100679536] [2019-10-13 17:54:35,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:54:35,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:54:35,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 17:54:35,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:54:35,616 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 17:54:35,617 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 17:54:35,617 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 7 [2019-10-13 17:54:35,617 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816099327] [2019-10-13 17:54:35,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 17:54:35,618 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:54:35,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 17:54:35,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-13 17:54:35,619 INFO L87 Difference]: Start difference. First operand 1199 states and 1542 transitions. Second operand 3 states. [2019-10-13 17:54:36,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:54:36,157 INFO L93 Difference]: Finished difference Result 3421 states and 4504 transitions. [2019-10-13 17:54:36,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 17:54:36,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2019-10-13 17:54:36,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:54:36,181 INFO L225 Difference]: With dead ends: 3421 [2019-10-13 17:54:36,181 INFO L226 Difference]: Without dead ends: 2228 [2019-10-13 17:54:36,186 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-13 17:54:36,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2228 states. [2019-10-13 17:54:36,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2228 to 2083. [2019-10-13 17:54:36,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2083 states. [2019-10-13 17:54:36,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2083 states to 2083 states and 2579 transitions. [2019-10-13 17:54:36,254 INFO L78 Accepts]: Start accepts. Automaton has 2083 states and 2579 transitions. Word has length 177 [2019-10-13 17:54:36,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:54:36,254 INFO L462 AbstractCegarLoop]: Abstraction has 2083 states and 2579 transitions. [2019-10-13 17:54:36,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 17:54:36,254 INFO L276 IsEmpty]: Start isEmpty. Operand 2083 states and 2579 transitions. [2019-10-13 17:54:36,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-10-13 17:54:36,261 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:54:36,261 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:54:36,465 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:54:36,465 INFO L410 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:54:36,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:54:36,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1336045319, now seen corresponding path program 1 times [2019-10-13 17:54:36,467 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:54:36,467 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637340890] [2019-10-13 17:54:36,468 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:54:36,468 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:54:36,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:54:36,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:54:36,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:54:36,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:54:36,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:54:36,653 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 39 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 17:54:36,654 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637340890] [2019-10-13 17:54:36,654 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290638706] [2019-10-13 17:54:36,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:54:36,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:54:36,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 17:54:36,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:54:36,912 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 40 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 17:54:36,912 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:54:36,912 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-10-13 17:54:36,913 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618109767] [2019-10-13 17:54:36,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-13 17:54:36,914 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:54:36,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-13 17:54:36,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-10-13 17:54:36,915 INFO L87 Difference]: Start difference. First operand 2083 states and 2579 transitions. Second operand 11 states. [2019-10-13 17:54:41,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:54:41,241 INFO L93 Difference]: Finished difference Result 5563 states and 7405 transitions. [2019-10-13 17:54:41,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-13 17:54:41,242 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 181 [2019-10-13 17:54:41,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:54:41,263 INFO L225 Difference]: With dead ends: 5563 [2019-10-13 17:54:41,263 INFO L226 Difference]: Without dead ends: 3486 [2019-10-13 17:54:41,271 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=214, Invalid=778, Unknown=0, NotChecked=0, Total=992 [2019-10-13 17:54:41,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3486 states. [2019-10-13 17:54:41,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3486 to 2987. [2019-10-13 17:54:41,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2987 states. [2019-10-13 17:54:41,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2987 states to 2987 states and 3441 transitions. [2019-10-13 17:54:41,371 INFO L78 Accepts]: Start accepts. Automaton has 2987 states and 3441 transitions. Word has length 181 [2019-10-13 17:54:41,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:54:41,372 INFO L462 AbstractCegarLoop]: Abstraction has 2987 states and 3441 transitions. [2019-10-13 17:54:41,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-13 17:54:41,372 INFO L276 IsEmpty]: Start isEmpty. Operand 2987 states and 3441 transitions. [2019-10-13 17:54:41,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-10-13 17:54:41,383 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:54:41,384 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-13 17:54:41,588 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:54:41,589 INFO L410 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:54:41,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:54:41,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1660093140, now seen corresponding path program 1 times [2019-10-13 17:54:41,590 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:54:41,591 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133086890] [2019-10-13 17:54:41,591 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:54:41,594 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:54:41,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:54:41,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:54:41,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:54:41,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:54:41,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:54:41,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:54:41,998 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 125 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-13 17:54:41,998 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133086890] [2019-10-13 17:54:41,999 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852849986] [2019-10-13 17:54:41,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:54:42,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:54:42,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 17:54:42,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:54:42,187 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 130 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 17:54:42,188 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:54:42,188 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 12 [2019-10-13 17:54:42,189 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182977519] [2019-10-13 17:54:42,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 17:54:42,191 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:54:42,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 17:54:42,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-10-13 17:54:42,192 INFO L87 Difference]: Start difference. First operand 2987 states and 3441 transitions. Second operand 12 states. [2019-10-13 17:54:45,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:54:45,371 INFO L93 Difference]: Finished difference Result 6412 states and 7468 transitions. [2019-10-13 17:54:45,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 17:54:45,372 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 247 [2019-10-13 17:54:45,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:54:45,387 INFO L225 Difference]: With dead ends: 6412 [2019-10-13 17:54:45,387 INFO L226 Difference]: Without dead ends: 3131 [2019-10-13 17:54:45,396 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 259 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2019-10-13 17:54:45,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3131 states. [2019-10-13 17:54:45,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3131 to 2835. [2019-10-13 17:54:45,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2835 states. [2019-10-13 17:54:45,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2835 states to 2835 states and 3235 transitions. [2019-10-13 17:54:45,476 INFO L78 Accepts]: Start accepts. Automaton has 2835 states and 3235 transitions. Word has length 247 [2019-10-13 17:54:45,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:54:45,476 INFO L462 AbstractCegarLoop]: Abstraction has 2835 states and 3235 transitions. [2019-10-13 17:54:45,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 17:54:45,477 INFO L276 IsEmpty]: Start isEmpty. Operand 2835 states and 3235 transitions. [2019-10-13 17:54:45,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-10-13 17:54:45,486 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:54:45,487 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-13 17:54:45,691 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:54:45,692 INFO L410 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:54:45,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:54:45,693 INFO L82 PathProgramCache]: Analyzing trace with hash -6191215, now seen corresponding path program 1 times [2019-10-13 17:54:45,693 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:54:45,693 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002879324] [2019-10-13 17:54:45,693 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:54:45,694 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:54:45,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:54:45,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:54:45,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:54:45,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:54:45,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:54:45,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:54:45,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:54:46,030 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 126 proven. 43 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 17:54:46,031 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002879324] [2019-10-13 17:54:46,031 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974160071] [2019-10-13 17:54:46,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:54:46,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:54:46,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 17:54:46,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:54:46,291 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 101 proven. 2 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-10-13 17:54:46,292 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:54:46,292 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 11 [2019-10-13 17:54:46,292 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38525177] [2019-10-13 17:54:46,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-13 17:54:46,293 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:54:46,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-13 17:54:46,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-10-13 17:54:46,294 INFO L87 Difference]: Start difference. First operand 2835 states and 3235 transitions. Second operand 11 states. [2019-10-13 17:54:47,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:54:47,647 INFO L93 Difference]: Finished difference Result 5103 states and 5827 transitions. [2019-10-13 17:54:47,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 17:54:47,647 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 270 [2019-10-13 17:54:47,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:54:47,660 INFO L225 Difference]: With dead ends: 5103 [2019-10-13 17:54:47,661 INFO L226 Difference]: Without dead ends: 2676 [2019-10-13 17:54:47,667 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2019-10-13 17:54:47,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2676 states. [2019-10-13 17:54:47,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2676 to 2530. [2019-10-13 17:54:47,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2530 states. [2019-10-13 17:54:47,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2530 states to 2530 states and 2753 transitions. [2019-10-13 17:54:47,773 INFO L78 Accepts]: Start accepts. Automaton has 2530 states and 2753 transitions. Word has length 270 [2019-10-13 17:54:47,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:54:47,773 INFO L462 AbstractCegarLoop]: Abstraction has 2530 states and 2753 transitions. [2019-10-13 17:54:47,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-13 17:54:47,773 INFO L276 IsEmpty]: Start isEmpty. Operand 2530 states and 2753 transitions. [2019-10-13 17:54:47,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-10-13 17:54:47,781 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:54:47,782 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-13 17:54:47,994 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:54:47,994 INFO L410 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:54:47,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:54:47,995 INFO L82 PathProgramCache]: Analyzing trace with hash 780172313, now seen corresponding path program 1 times [2019-10-13 17:54:47,996 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:54:47,996 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230298870] [2019-10-13 17:54:47,996 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:54:47,997 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:54:47,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:54:48,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:54:48,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:54:48,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:54:48,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:54:48,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:54:48,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:54:48,264 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 134 proven. 43 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-13 17:54:48,265 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230298870] [2019-10-13 17:54:48,265 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503787430] [2019-10-13 17:54:48,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:54:48,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:54:48,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 616 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-13 17:54:48,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:54:48,436 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 117 proven. 2 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-10-13 17:54:48,436 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:54:48,436 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 9 [2019-10-13 17:54:48,437 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052804573] [2019-10-13 17:54:48,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 17:54:48,438 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:54:48,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 17:54:48,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-10-13 17:54:48,439 INFO L87 Difference]: Start difference. First operand 2530 states and 2753 transitions. Second operand 9 states. [2019-10-13 17:54:50,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:54:50,102 INFO L93 Difference]: Finished difference Result 4634 states and 5025 transitions. [2019-10-13 17:54:50,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 17:54:50,102 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 274 [2019-10-13 17:54:50,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:54:50,109 INFO L225 Difference]: With dead ends: 4634 [2019-10-13 17:54:50,109 INFO L226 Difference]: Without dead ends: 2242 [2019-10-13 17:54:50,114 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2019-10-13 17:54:50,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2242 states. [2019-10-13 17:54:50,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2242 to 2094. [2019-10-13 17:54:50,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2094 states. [2019-10-13 17:54:50,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2094 states to 2094 states and 2197 transitions. [2019-10-13 17:54:50,163 INFO L78 Accepts]: Start accepts. Automaton has 2094 states and 2197 transitions. Word has length 274 [2019-10-13 17:54:50,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:54:50,163 INFO L462 AbstractCegarLoop]: Abstraction has 2094 states and 2197 transitions. [2019-10-13 17:54:50,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 17:54:50,163 INFO L276 IsEmpty]: Start isEmpty. Operand 2094 states and 2197 transitions. [2019-10-13 17:54:50,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-10-13 17:54:50,171 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:54:50,171 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-13 17:54:50,377 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:54:50,377 INFO L410 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:54:50,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:54:50,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1557581639, now seen corresponding path program 1 times [2019-10-13 17:54:50,378 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:54:50,378 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731596647] [2019-10-13 17:54:50,378 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:54:50,379 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:54:50,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:54:50,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:54:50,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:54:50,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:54:50,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:54:50,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:54:50,797 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 245 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-13 17:54:50,798 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731596647] [2019-10-13 17:54:50,798 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802956065] [2019-10-13 17:54:50,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:54:50,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:54:50,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-13 17:54:50,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:54:50,997 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-10-13 17:54:50,997 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 17:54:50,998 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2019-10-13 17:54:50,998 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432704470] [2019-10-13 17:54:50,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 17:54:50,999 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:54:50,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 17:54:51,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-10-13 17:54:51,000 INFO L87 Difference]: Start difference. First operand 2094 states and 2197 transitions. Second operand 3 states. [2019-10-13 17:54:51,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:54:51,471 INFO L93 Difference]: Finished difference Result 4321 states and 4542 transitions. [2019-10-13 17:54:51,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 17:54:51,471 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 305 [2019-10-13 17:54:51,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:54:51,472 INFO L225 Difference]: With dead ends: 4321 [2019-10-13 17:54:51,473 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 17:54:51,479 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 311 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-10-13 17:54:51,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 17:54:51,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 17:54:51,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 17:54:51,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 17:54:51,481 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 305 [2019-10-13 17:54:51,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:54:51,481 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 17:54:51,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 17:54:51,481 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 17:54:51,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 17:54:51,685 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:54:51,692 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 17:54:52,485 WARN L191 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 162 [2019-10-13 17:54:52,850 WARN L191 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 162 [2019-10-13 17:54:53,962 WARN L191 SmtUtils]: Spent 993.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 64 [2019-10-13 17:54:54,717 WARN L191 SmtUtils]: Spent 717.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 59 [2019-10-13 17:54:55,415 WARN L191 SmtUtils]: Spent 695.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 59 [2019-10-13 17:54:55,418 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-13 17:54:55,418 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a11~0 |old(~a11~0)|) (= ~z~0 |old(~z~0)|) (= ~w~0 |old(~w~0)|) (= ~u~0 |old(~u~0)|) (= ~e~0 |old(~e~0)|) (= ~a21~0 |old(~a21~0)|) (= ~c~0 |old(~c~0)|) (= ~v~0 |old(~v~0)|) (= ~a17~0 |old(~a17~0)|) (= ~y~0 |old(~y~0)|) (= ~f~0 |old(~f~0)|) (= ~a~0 |old(~a~0)|) (= ~x~0 |old(~x~0)|) (= ~a19~0 |old(~a19~0)|) (= ~a28~0 |old(~a28~0)|) (= ~a25~0 |old(~a25~0)|) (= ~d~0 |old(~d~0)|)) [2019-10-13 17:54:55,418 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-13 17:54:55,419 INFO L443 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2019-10-13 17:54:55,419 INFO L443 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2019-10-13 17:54:55,419 INFO L443 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2019-10-13 17:54:55,419 INFO L443 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2019-10-13 17:54:55,419 INFO L443 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2019-10-13 17:54:55,419 INFO L443 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-10-13 17:54:55,419 INFO L443 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-10-13 17:54:55,419 INFO L443 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2019-10-13 17:54:55,419 INFO L443 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2019-10-13 17:54:55,420 INFO L443 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2019-10-13 17:54:55,420 INFO L443 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2019-10-13 17:54:55,420 INFO L443 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2019-10-13 17:54:55,420 INFO L443 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-10-13 17:54:55,420 INFO L443 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-10-13 17:54:55,420 INFO L443 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-10-13 17:54:55,420 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2019-10-13 17:54:55,420 INFO L443 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2019-10-13 17:54:55,421 INFO L443 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-10-13 17:54:55,421 INFO L443 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2019-10-13 17:54:55,421 INFO L443 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2019-10-13 17:54:55,421 INFO L443 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2019-10-13 17:54:55,421 INFO L443 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2019-10-13 17:54:55,421 INFO L443 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-10-13 17:54:55,421 INFO L443 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2019-10-13 17:54:55,421 INFO L443 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-10-13 17:54:55,421 INFO L443 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2019-10-13 17:54:55,422 INFO L443 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2019-10-13 17:54:55,422 INFO L443 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2019-10-13 17:54:55,422 INFO L443 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2019-10-13 17:54:55,422 INFO L443 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2019-10-13 17:54:55,422 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-10-13 17:54:55,422 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2019-10-13 17:54:55,422 INFO L443 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2019-10-13 17:54:55,422 INFO L443 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-10-13 17:54:55,422 INFO L443 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-10-13 17:54:55,423 INFO L443 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-10-13 17:54:55,423 INFO L443 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2019-10-13 17:54:55,423 INFO L443 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2019-10-13 17:54:55,423 INFO L443 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-10-13 17:54:55,423 INFO L443 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2019-10-13 17:54:55,423 INFO L443 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2019-10-13 17:54:55,423 INFO L443 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2019-10-13 17:54:55,423 INFO L443 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2019-10-13 17:54:55,423 INFO L443 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2019-10-13 17:54:55,423 INFO L443 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2019-10-13 17:54:55,423 INFO L443 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-10-13 17:54:55,423 INFO L443 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2019-10-13 17:54:55,424 INFO L443 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2019-10-13 17:54:55,424 INFO L443 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2019-10-13 17:54:55,424 INFO L443 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2019-10-13 17:54:55,424 INFO L443 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2019-10-13 17:54:55,424 INFO L443 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2019-10-13 17:54:55,424 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 580) no Hoare annotation was computed. [2019-10-13 17:54:55,424 INFO L443 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-10-13 17:54:55,424 INFO L443 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-10-13 17:54:55,424 INFO L443 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-10-13 17:54:55,424 INFO L443 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2019-10-13 17:54:55,424 INFO L443 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2019-10-13 17:54:55,424 INFO L443 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2019-10-13 17:54:55,424 INFO L443 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2019-10-13 17:54:55,425 INFO L443 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2019-10-13 17:54:55,425 INFO L443 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-10-13 17:54:55,425 INFO L443 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-10-13 17:54:55,425 INFO L443 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-10-13 17:54:55,425 INFO L443 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2019-10-13 17:54:55,425 INFO L443 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2019-10-13 17:54:55,425 INFO L443 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2019-10-13 17:54:55,425 INFO L443 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2019-10-13 17:54:55,425 INFO L443 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2019-10-13 17:54:55,425 INFO L443 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-10-13 17:54:55,425 INFO L443 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-10-13 17:54:55,425 INFO L443 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-10-13 17:54:55,425 INFO L443 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-10-13 17:54:55,426 INFO L443 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-10-13 17:54:55,426 INFO L443 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2019-10-13 17:54:55,426 INFO L443 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2019-10-13 17:54:55,426 INFO L443 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2019-10-13 17:54:55,426 INFO L443 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2019-10-13 17:54:55,426 INFO L443 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2019-10-13 17:54:55,426 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-10-13 17:54:55,426 INFO L443 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2019-10-13 17:54:55,426 INFO L443 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2019-10-13 17:54:55,426 INFO L443 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2019-10-13 17:54:55,426 INFO L443 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2019-10-13 17:54:55,426 INFO L443 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2019-10-13 17:54:55,427 INFO L443 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-10-13 17:54:55,427 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-10-13 17:54:55,427 INFO L443 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-10-13 17:54:55,427 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-10-13 17:54:55,427 INFO L443 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-10-13 17:54:55,427 INFO L443 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-10-13 17:54:55,427 INFO L443 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-10-13 17:54:55,427 INFO L443 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2019-10-13 17:54:55,427 INFO L443 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-10-13 17:54:55,427 INFO L443 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2019-10-13 17:54:55,427 INFO L443 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2019-10-13 17:54:55,427 INFO L443 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2019-10-13 17:54:55,427 INFO L443 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2019-10-13 17:54:55,427 INFO L443 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2019-10-13 17:54:55,428 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2019-10-13 17:54:55,428 INFO L443 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2019-10-13 17:54:55,428 INFO L443 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2019-10-13 17:54:55,428 INFO L443 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2019-10-13 17:54:55,428 INFO L443 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2019-10-13 17:54:55,428 INFO L443 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2019-10-13 17:54:55,428 INFO L443 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2019-10-13 17:54:55,428 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2019-10-13 17:54:55,428 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2019-10-13 17:54:55,428 INFO L443 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2019-10-13 17:54:55,428 INFO L443 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2019-10-13 17:54:55,428 INFO L443 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2019-10-13 17:54:55,428 INFO L443 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2019-10-13 17:54:55,428 INFO L443 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2019-10-13 17:54:55,429 INFO L443 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2019-10-13 17:54:55,429 INFO L443 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-10-13 17:54:55,429 INFO L443 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-10-13 17:54:55,429 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-10-13 17:54:55,429 INFO L443 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-10-13 17:54:55,429 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-10-13 17:54:55,429 INFO L443 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2019-10-13 17:54:55,429 INFO L443 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2019-10-13 17:54:55,429 INFO L443 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2019-10-13 17:54:55,429 INFO L443 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2019-10-13 17:54:55,429 INFO L443 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2019-10-13 17:54:55,429 INFO L443 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2019-10-13 17:54:55,429 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-10-13 17:54:55,429 INFO L443 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2019-10-13 17:54:55,429 INFO L443 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2019-10-13 17:54:55,430 INFO L443 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2019-10-13 17:54:55,430 INFO L443 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2019-10-13 17:54:55,430 INFO L443 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2019-10-13 17:54:55,430 INFO L443 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2019-10-13 17:54:55,430 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-10-13 17:54:55,430 INFO L443 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-10-13 17:54:55,430 INFO L443 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-10-13 17:54:55,430 INFO L443 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-10-13 17:54:55,430 INFO L443 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2019-10-13 17:54:55,430 INFO L443 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2019-10-13 17:54:55,430 INFO L443 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2019-10-13 17:54:55,430 INFO L443 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2019-10-13 17:54:55,431 INFO L443 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2019-10-13 17:54:55,431 INFO L443 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2019-10-13 17:54:55,431 INFO L443 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-10-13 17:54:55,431 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-10-13 17:54:55,431 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-10-13 17:54:55,431 INFO L443 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2019-10-13 17:54:55,431 INFO L443 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2019-10-13 17:54:55,431 INFO L443 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2019-10-13 17:54:55,431 INFO L443 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2019-10-13 17:54:55,431 INFO L443 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2019-10-13 17:54:55,431 INFO L443 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2019-10-13 17:54:55,432 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-10-13 17:54:55,432 INFO L443 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-10-13 17:54:55,432 INFO L443 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-10-13 17:54:55,432 INFO L443 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-10-13 17:54:55,432 INFO L443 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-10-13 17:54:55,432 INFO L443 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2019-10-13 17:54:55,432 INFO L443 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2019-10-13 17:54:55,432 INFO L443 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2019-10-13 17:54:55,432 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse12 (= ~a17~0 |old(~a17~0)|)) (.cse16 (not (<= |old(~a19~0)| 0))) (.cse11 (= ~a11~0 |old(~a11~0)|)) (.cse13 (= ~a19~0 |old(~a19~0)|)) (.cse14 (= ~a28~0 |old(~a28~0)|)) (.cse15 (= ~a25~0 |old(~a25~0)|)) (.cse18 (not (<= |old(~a17~0)| 8)))) (let ((.cse4 (= |old(~a17~0)| |old(~a28~0)|)) (.cse10 (or .cse18 (not (<= |old(~a28~0)| 7)))) (.cse2 (and .cse11 (= ~a17~0 8) .cse13 .cse14 .cse15)) (.cse3 (not (= 8 |old(~a17~0)|))) (.cse0 (not (= 1 |old(~a25~0)|))) (.cse6 (or .cse18 .cse16)) (.cse5 (and .cse11 .cse12 .cse13 .cse14 .cse15)) (.cse8 (not (<= |old(~a28~0)| 10))) (.cse1 (not (= 1 |old(~a19~0)|))) (.cse17 (not (<= 10 |old(~a28~0)|))) (.cse9 (not (<= |old(~a25~0)| 0))) (.cse7 (not (<= |old(~a17~0)| 7)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse4 .cse5 .cse6 .cse7) (or .cse8 .cse1 .cse4 .cse9 .cse2 .cse3) (or .cse10 .cse1 (and (and .cse11 .cse12 .cse13 .cse14) .cse15) .cse7) (or .cse8 (or .cse9 .cse16 .cse3) .cse2) (or .cse5 (or (or .cse10 .cse16) .cse3)) (or .cse8 .cse1 .cse17 .cse2 .cse3) (or .cse8 .cse0 .cse17 .cse6 .cse5) (or .cse8 (and .cse14 .cse15 .cse11 .cse12 .cse13) .cse1 .cse17 .cse9 (not (= 1 |old(~a11~0)|)) .cse7)))) [2019-10-13 17:54:55,432 INFO L443 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2019-10-13 17:54:55,432 INFO L443 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2019-10-13 17:54:55,432 INFO L443 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2019-10-13 17:54:55,433 INFO L443 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-10-13 17:54:55,433 INFO L443 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-10-13 17:54:55,433 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-10-13 17:54:55,433 INFO L443 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2019-10-13 17:54:55,433 INFO L443 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2019-10-13 17:54:55,433 INFO L443 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2019-10-13 17:54:55,433 INFO L443 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2019-10-13 17:54:55,433 INFO L443 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2019-10-13 17:54:55,433 INFO L443 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2019-10-13 17:54:55,433 INFO L443 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-10-13 17:54:55,433 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-10-13 17:54:55,434 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-10-13 17:54:55,434 INFO L443 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-10-13 17:54:55,434 INFO L443 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2019-10-13 17:54:55,434 INFO L443 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2019-10-13 17:54:55,434 INFO L443 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2019-10-13 17:54:55,434 INFO L443 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2019-10-13 17:54:55,434 INFO L443 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2019-10-13 17:54:55,434 INFO L443 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2019-10-13 17:54:55,434 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-10-13 17:54:55,434 INFO L443 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-10-13 17:54:55,434 INFO L443 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2019-10-13 17:54:55,434 INFO L443 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2019-10-13 17:54:55,434 INFO L443 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2019-10-13 17:54:55,434 INFO L443 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2019-10-13 17:54:55,435 INFO L443 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2019-10-13 17:54:55,435 INFO L443 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2019-10-13 17:54:55,435 INFO L443 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-10-13 17:54:55,435 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-10-13 17:54:55,435 INFO L443 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-10-13 17:54:55,435 INFO L443 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2019-10-13 17:54:55,435 INFO L443 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2019-10-13 17:54:55,435 INFO L443 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-10-13 17:54:55,435 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-10-13 17:54:55,435 INFO L443 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2019-10-13 17:54:55,435 INFO L443 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2019-10-13 17:54:55,435 INFO L443 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2019-10-13 17:54:55,435 INFO L443 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2019-10-13 17:54:55,435 INFO L443 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2019-10-13 17:54:55,435 INFO L443 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2019-10-13 17:54:55,436 INFO L443 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-10-13 17:54:55,436 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-10-13 17:54:55,436 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-10-13 17:54:55,436 INFO L443 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-10-13 17:54:55,436 INFO L443 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2019-10-13 17:54:55,436 INFO L443 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2019-10-13 17:54:55,436 INFO L443 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2019-10-13 17:54:55,436 INFO L443 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2019-10-13 17:54:55,436 INFO L443 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2019-10-13 17:54:55,436 INFO L443 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2019-10-13 17:54:55,436 INFO L443 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-10-13 17:54:55,436 INFO L443 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2019-10-13 17:54:55,436 INFO L443 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-10-13 17:54:55,436 INFO L443 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2019-10-13 17:54:55,436 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-10-13 17:54:55,437 INFO L443 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2019-10-13 17:54:55,437 INFO L443 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2019-10-13 17:54:55,437 INFO L443 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-10-13 17:54:55,437 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-10-13 17:54:55,437 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-13 17:54:55,437 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= ~a28~0 7) (= ~a17~0 8) (= ~a19~0 1) (not (= ~a19~0 ~a11~0)) (<= ~a25~0 0)) [2019-10-13 17:54:55,437 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-13 17:54:55,437 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-13 17:54:55,437 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (<= |old(~a28~0)| 7)) (and (= ~a28~0 |old(~a28~0)|) (= ~a25~0 |old(~a25~0)|) (= ~a11~0 |old(~a11~0)|) (= ~a17~0 8) (= ~a19~0 |old(~a19~0)|)) (not (= 1 |old(~a19~0)|)) (= |old(~a11~0)| |old(~a19~0)|) (not (<= |old(~a25~0)| 0)) (not (= 8 |old(~a17~0)|))) [2019-10-13 17:54:55,437 INFO L439 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse0 (<= ~a19~0 0)) (.cse12 (<= ~a17~0 8)) (.cse10 (= ~a17~0 8)) (.cse13 (<= ~a25~0 0))) (let ((.cse1 (and .cse10 .cse13)) (.cse4 (and (<= ~a28~0 7) .cse12)) (.cse7 (= ~a25~0 1)) (.cse3 (<= ~a17~0 7)) (.cse6 (not (= ~a17~0 ~a28~0))) (.cse9 (and .cse0 .cse12)) (.cse5 (= ~a19~0 1)) (.cse8 (<= 10 ~a28~0)) (.cse11 (= ~a19~0 |old(~a19~0)|)) (.cse2 (<= ~a28~0 10))) (or (and (and .cse0 .cse1) .cse2) (not (<= |old(~a28~0)| 7)) (and .cse3 (and .cse4 .cse5)) (and .cse6 .cse2 (and .cse1 .cse5)) (= |old(~a11~0)| |old(~a19~0)|) (and .cse2 .cse7 (and .cse8 .cse9)) (and .cse6 (and .cse4 .cse0)) (and (and .cse10 .cse11) .cse7) (not (<= |old(~a25~0)| 0)) (and .cse3 .cse6 .cse9) (and .cse8 .cse2 .cse5 .cse12 .cse13 (= ~a11~0 1)) (not (= 1 |old(~a19~0)|)) (and (and .cse8 .cse11) (= ~a17~0 |old(~a17~0)|) .cse2) (not (= 8 |old(~a17~0)|))))) [2019-10-13 17:54:55,438 INFO L443 ceAbstractionStarter]: For program point L606-3(lines 600 617) no Hoare annotation was computed. [2019-10-13 17:54:55,438 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2019-10-13 17:54:55,438 INFO L439 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse0 (<= ~a19~0 0)) (.cse12 (<= ~a17~0 8)) (.cse10 (= ~a17~0 8)) (.cse13 (<= ~a25~0 0))) (let ((.cse1 (and .cse10 .cse13)) (.cse4 (and (<= ~a28~0 7) .cse12)) (.cse7 (= ~a25~0 1)) (.cse3 (<= ~a17~0 7)) (.cse6 (not (= ~a17~0 ~a28~0))) (.cse9 (and .cse0 .cse12)) (.cse5 (= ~a19~0 1)) (.cse8 (<= 10 ~a28~0)) (.cse11 (= ~a19~0 |old(~a19~0)|)) (.cse2 (<= ~a28~0 10))) (or (and (and .cse0 .cse1) .cse2) (not (<= |old(~a28~0)| 7)) (and .cse3 (and .cse4 .cse5)) (and .cse6 .cse2 (and .cse1 .cse5)) (= |old(~a11~0)| |old(~a19~0)|) (and .cse2 .cse7 (and .cse8 .cse9)) (and .cse6 (and .cse4 .cse0)) (and (and .cse10 .cse11) .cse7) (not (<= |old(~a25~0)| 0)) (and .cse3 .cse6 .cse9) (and .cse8 .cse2 .cse5 .cse12 .cse13 (= ~a11~0 1)) (not (= 1 |old(~a19~0)|)) (and (and .cse8 .cse11) (= ~a17~0 |old(~a17~0)|) .cse2) (not (= 8 |old(~a17~0)|))))) [2019-10-13 17:54:55,438 INFO L443 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2019-10-13 17:54:55,438 INFO L443 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-10-13 17:54:55,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 05:54:55 BoogieIcfgContainer [2019-10-13 17:54:55,459 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-13 17:54:55,461 INFO L168 Benchmark]: Toolchain (without parser) took 33929.29 ms. Allocated memory was 143.1 MB in the beginning and 651.2 MB in the end (delta: 508.0 MB). Free memory was 98.2 MB in the beginning and 286.0 MB in the end (delta: -187.8 MB). Peak memory consumption was 532.0 MB. Max. memory is 7.1 GB. [2019-10-13 17:54:55,461 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 143.1 MB. Free memory was 118.2 MB in the beginning and 118.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-13 17:54:55,462 INFO L168 Benchmark]: CACSL2BoogieTranslator took 883.80 ms. Allocated memory was 143.1 MB in the beginning and 201.9 MB in the end (delta: 58.7 MB). Free memory was 98.0 MB in the beginning and 168.3 MB in the end (delta: -70.3 MB). Peak memory consumption was 30.5 MB. Max. memory is 7.1 GB. [2019-10-13 17:54:55,463 INFO L168 Benchmark]: Boogie Preprocessor took 159.97 ms. Allocated memory is still 201.9 MB. Free memory was 168.3 MB in the beginning and 163.2 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 7.1 GB. [2019-10-13 17:54:55,464 INFO L168 Benchmark]: RCFGBuilder took 1374.71 ms. Allocated memory was 201.9 MB in the beginning and 231.2 MB in the end (delta: 29.4 MB). Free memory was 163.2 MB in the beginning and 180.3 MB in the end (delta: -17.1 MB). Peak memory consumption was 86.2 MB. Max. memory is 7.1 GB. [2019-10-13 17:54:55,465 INFO L168 Benchmark]: TraceAbstraction took 31505.56 ms. Allocated memory was 231.2 MB in the beginning and 651.2 MB in the end (delta: 420.0 MB). Free memory was 180.3 MB in the beginning and 286.0 MB in the end (delta: -105.7 MB). Peak memory consumption was 526.0 MB. Max. memory is 7.1 GB. [2019-10-13 17:54:55,469 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 143.1 MB. Free memory was 118.2 MB in the beginning and 118.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 883.80 ms. Allocated memory was 143.1 MB in the beginning and 201.9 MB in the end (delta: 58.7 MB). Free memory was 98.0 MB in the beginning and 168.3 MB in the end (delta: -70.3 MB). Peak memory consumption was 30.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 159.97 ms. Allocated memory is still 201.9 MB. Free memory was 168.3 MB in the beginning and 163.2 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1374.71 ms. Allocated memory was 201.9 MB in the beginning and 231.2 MB in the end (delta: 29.4 MB). Free memory was 163.2 MB in the beginning and 180.3 MB in the end (delta: -17.1 MB). Peak memory consumption was 86.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 31505.56 ms. Allocated memory was 231.2 MB in the beginning and 651.2 MB in the end (delta: 420.0 MB). Free memory was 180.3 MB in the beginning and 286.0 MB in the end (delta: -105.7 MB). Peak memory consumption was 526.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 580]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: ((((((((((((((a19 <= 0 && a17 == 8 && a25 <= 0) && a28 <= 10) || !(\old(a28) <= 7)) || (a17 <= 7 && (a28 <= 7 && a17 <= 8) && a19 == 1)) || ((!(a17 == a28) && a28 <= 10) && (a17 == 8 && a25 <= 0) && a19 == 1)) || \old(a11) == \old(a19)) || ((a28 <= 10 && a25 == 1) && 10 <= a28 && a19 <= 0 && a17 <= 8)) || (!(a17 == a28) && (a28 <= 7 && a17 <= 8) && a19 <= 0)) || ((a17 == 8 && a19 == \old(a19)) && a25 == 1)) || !(\old(a25) <= 0)) || ((a17 <= 7 && !(a17 == a28)) && a19 <= 0 && a17 <= 8)) || (((((10 <= a28 && a28 <= 10) && a19 == 1) && a17 <= 8) && a25 <= 0) && a11 == 1)) || !(1 == \old(a19))) || (((10 <= a28 && a19 == \old(a19)) && a17 == \old(a17)) && a28 <= 10)) || !(8 == \old(a17)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 236 locations, 1 error locations. Result: SAFE, OverallTime: 31.3s, OverallIterations: 11, TraceHistogramMax: 5, AutomataDifference: 19.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.7s, HoareTripleCheckerStatistics: 839 SDtfs, 7664 SDslu, 613 SDs, 0 SdLazy, 11105 SolverSat, 2469 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2011 GetRequests, 1868 SyntacticMatches, 6 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2987occurred 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.6s AutomataMinimizationTime, 11 MinimizatonAttempts, 1765 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 125 PreInvPairs, 179 NumberOfFragments, 746 HoareAnnotationTreeSize, 125 FomulaSimplifications, 239302 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 13594 FormulaSimplificationTreeSizeReductionInter, 2.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 4037 NumberOfCodeBlocks, 4037 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 4018 ConstructedInterpolants, 0 QuantifiedInterpolants, 2378649 SizeOfPredicates, 7 NumberOfNonLiveVariables, 4039 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 19 InterpolantComputations, 6 PerfectInterpolantSequences, 1872/1993 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...