java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem17_label21_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 21:02:13,148 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 21:02:13,150 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 21:02:13,165 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 21:02:13,165 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 21:02:13,166 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 21:02:13,167 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 21:02:13,169 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 21:02:13,171 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 21:02:13,172 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 21:02:13,173 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 21:02:13,173 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 21:02:13,174 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 21:02:13,175 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 21:02:13,176 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 21:02:13,177 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 21:02:13,178 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 21:02:13,179 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 21:02:13,181 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 21:02:13,183 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 21:02:13,184 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 21:02:13,185 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 21:02:13,188 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 21:02:13,188 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 21:02:13,188 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 21:02:13,189 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 21:02:13,190 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 21:02:13,191 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 21:02:13,192 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 21:02:13,193 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 21:02:13,193 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 21:02:13,194 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 21:02:13,194 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 21:02:13,194 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 21:02:13,195 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 21:02:13,196 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 21:02:13,196 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-07 21:02:13,212 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 21:02:13,213 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 21:02:13,213 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 21:02:13,214 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 21:02:13,214 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 21:02:13,214 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 21:02:13,214 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-07 21:02:13,214 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 21:02:13,215 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 21:02:13,215 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 21:02:13,215 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 21:02:13,215 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 21:02:13,215 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 21:02:13,216 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 21:02:13,216 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 21:02:13,217 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 21:02:13,217 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 21:02:13,217 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 21:02:13,217 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 21:02:13,217 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 21:02:13,217 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 21:02:13,218 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 21:02:13,218 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 21:02:13,218 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 21:02:13,218 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 21:02:13,218 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 21:02:13,219 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 21:02:13,219 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 21:02:13,219 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 21:02:13,219 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 21:02:13,219 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 21:02:13,220 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 21:02:13,220 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 21:02:13,220 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 21:02:13,220 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 21:02:13,266 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 21:02:13,282 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 21:02:13,287 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 21:02:13,289 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 21:02:13,289 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 21:02:13,290 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem17_label21_true-unreach-call.c [2018-11-07 21:02:13,348 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e464a1af3/c280f9a4b4b745c28d706e5b935d8330/FLAG87d6a0dde [2018-11-07 21:02:14,092 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 21:02:14,093 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem17_label21_true-unreach-call.c [2018-11-07 21:02:14,123 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e464a1af3/c280f9a4b4b745c28d706e5b935d8330/FLAG87d6a0dde [2018-11-07 21:02:14,146 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e464a1af3/c280f9a4b4b745c28d706e5b935d8330 [2018-11-07 21:02:14,158 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 21:02:14,161 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 21:02:14,162 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 21:02:14,162 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 21:02:14,169 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 21:02:14,170 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:02:14" (1/1) ... [2018-11-07 21:02:14,174 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44783422 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:02:14, skipping insertion in model container [2018-11-07 21:02:14,175 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:02:14" (1/1) ... [2018-11-07 21:02:14,187 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 21:02:14,312 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 21:02:15,379 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 21:02:15,385 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 21:02:15,785 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 21:02:15,811 INFO L193 MainTranslator]: Completed translation [2018-11-07 21:02:15,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:02:15 WrapperNode [2018-11-07 21:02:15,812 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 21:02:15,813 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 21:02:15,813 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 21:02:15,814 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 21:02:15,824 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:02:15" (1/1) ... [2018-11-07 21:02:16,089 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:02:15" (1/1) ... [2018-11-07 21:02:16,098 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 21:02:16,099 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 21:02:16,100 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 21:02:16,100 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 21:02:16,111 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:02:15" (1/1) ... [2018-11-07 21:02:16,111 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:02:15" (1/1) ... [2018-11-07 21:02:16,136 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:02:15" (1/1) ... [2018-11-07 21:02:16,136 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:02:15" (1/1) ... [2018-11-07 21:02:16,216 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:02:15" (1/1) ... [2018-11-07 21:02:16,253 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:02:15" (1/1) ... [2018-11-07 21:02:16,282 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:02:15" (1/1) ... [2018-11-07 21:02:16,314 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 21:02:16,314 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 21:02:16,315 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 21:02:16,315 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 21:02:16,316 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:02:15" (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 [2018-11-07 21:02:16,373 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 21:02:16,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 21:02:16,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 21:02:16,373 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-11-07 21:02:16,373 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-11-07 21:02:16,374 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 21:02:16,374 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 21:02:16,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 21:02:16,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 21:02:16,374 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 21:02:16,375 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 21:02:25,038 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 21:02:25,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:02:25 BoogieIcfgContainer [2018-11-07 21:02:25,039 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 21:02:25,040 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 21:02:25,041 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 21:02:25,044 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 21:02:25,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 09:02:14" (1/3) ... [2018-11-07 21:02:25,045 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73db3de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:02:25, skipping insertion in model container [2018-11-07 21:02:25,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:02:15" (2/3) ... [2018-11-07 21:02:25,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73db3de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:02:25, skipping insertion in model container [2018-11-07 21:02:25,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:02:25" (3/3) ... [2018-11-07 21:02:25,048 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label21_true-unreach-call.c [2018-11-07 21:02:25,058 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 21:02:25,067 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 21:02:25,086 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 21:02:25,127 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 21:02:25,127 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 21:02:25,127 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 21:02:25,127 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 21:02:25,127 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 21:02:25,128 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 21:02:25,128 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 21:02:25,128 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 21:02:25,173 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states. [2018-11-07 21:02:25,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-07 21:02:25,183 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 21:02:25,184 INFO L375 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] [2018-11-07 21:02:25,187 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 21:02:25,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 21:02:25,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1861558100, now seen corresponding path program 1 times [2018-11-07 21:02:25,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 21:02:25,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:02:25,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 21:02:25,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:02:25,247 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 21:02:25,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 21:02:25,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 21:02:25,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 21:02:25,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 21:02:25,789 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 21:02:25,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 21:02:25,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 21:02:25,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 21:02:25,814 INFO L87 Difference]: Start difference. First operand 604 states. Second operand 4 states. [2018-11-07 21:02:33,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 21:02:33,918 INFO L93 Difference]: Finished difference Result 2166 states and 4013 transitions. [2018-11-07 21:02:33,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 21:02:33,930 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-11-07 21:02:33,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 21:02:33,965 INFO L225 Difference]: With dead ends: 2166 [2018-11-07 21:02:33,965 INFO L226 Difference]: Without dead ends: 1556 [2018-11-07 21:02:33,977 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 21:02:33,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1556 states. [2018-11-07 21:02:34,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1556 to 1068. [2018-11-07 21:02:34,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2018-11-07 21:02:34,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1850 transitions. [2018-11-07 21:02:34,133 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1850 transitions. Word has length 66 [2018-11-07 21:02:34,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 21:02:34,134 INFO L480 AbstractCegarLoop]: Abstraction has 1068 states and 1850 transitions. [2018-11-07 21:02:34,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 21:02:34,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1850 transitions. [2018-11-07 21:02:34,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-07 21:02:34,143 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 21:02:34,143 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-07 21:02:34,143 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 21:02:34,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 21:02:34,144 INFO L82 PathProgramCache]: Analyzing trace with hash -436141222, now seen corresponding path program 1 times [2018-11-07 21:02:34,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 21:02:34,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:02:34,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 21:02:34,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:02:34,146 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 21:02:34,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 21:02:34,452 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 21:02:34,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 21:02:34,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 21:02:34,453 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 21:02:34,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 21:02:34,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 21:02:34,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 21:02:34,456 INFO L87 Difference]: Start difference. First operand 1068 states and 1850 transitions. Second operand 6 states. [2018-11-07 21:02:41,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 21:02:41,477 INFO L93 Difference]: Finished difference Result 3059 states and 5419 transitions. [2018-11-07 21:02:41,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 21:02:41,481 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2018-11-07 21:02:41,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 21:02:41,497 INFO L225 Difference]: With dead ends: 3059 [2018-11-07 21:02:41,497 INFO L226 Difference]: Without dead ends: 1997 [2018-11-07 21:02:41,502 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 21:02:41,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1997 states. [2018-11-07 21:02:41,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1997 to 1975. [2018-11-07 21:02:41,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1975 states. [2018-11-07 21:02:41,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1975 states to 1975 states and 3181 transitions. [2018-11-07 21:02:41,584 INFO L78 Accepts]: Start accepts. Automaton has 1975 states and 3181 transitions. Word has length 142 [2018-11-07 21:02:41,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 21:02:41,585 INFO L480 AbstractCegarLoop]: Abstraction has 1975 states and 3181 transitions. [2018-11-07 21:02:41,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 21:02:41,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1975 states and 3181 transitions. [2018-11-07 21:02:41,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-07 21:02:41,604 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 21:02:41,604 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-07 21:02:41,604 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 21:02:41,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 21:02:41,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1261890222, now seen corresponding path program 1 times [2018-11-07 21:02:41,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 21:02:41,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:02:41,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 21:02:41,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:02:41,606 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 21:02:41,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 21:02:41,949 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 21:02:42,183 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 21:02:42,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 21:02:42,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 21:02:42,184 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 21:02:42,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 21:02:42,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 21:02:42,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 21:02:42,185 INFO L87 Difference]: Start difference. First operand 1975 states and 3181 transitions. Second operand 6 states. [2018-11-07 21:02:46,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 21:02:46,198 INFO L93 Difference]: Finished difference Result 4880 states and 7834 transitions. [2018-11-07 21:02:46,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 21:02:46,200 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 146 [2018-11-07 21:02:46,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 21:02:46,222 INFO L225 Difference]: With dead ends: 4880 [2018-11-07 21:02:46,223 INFO L226 Difference]: Without dead ends: 2911 [2018-11-07 21:02:46,232 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 21:02:46,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2911 states. [2018-11-07 21:02:46,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2911 to 2880. [2018-11-07 21:02:46,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2880 states. [2018-11-07 21:02:46,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2880 states to 2880 states and 3936 transitions. [2018-11-07 21:02:46,333 INFO L78 Accepts]: Start accepts. Automaton has 2880 states and 3936 transitions. Word has length 146 [2018-11-07 21:02:46,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 21:02:46,334 INFO L480 AbstractCegarLoop]: Abstraction has 2880 states and 3936 transitions. [2018-11-07 21:02:46,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 21:02:46,334 INFO L276 IsEmpty]: Start isEmpty. Operand 2880 states and 3936 transitions. [2018-11-07 21:02:46,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-07 21:02:46,340 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 21:02:46,340 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-07 21:02:46,340 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 21:02:46,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 21:02:46,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1548926097, now seen corresponding path program 1 times [2018-11-07 21:02:46,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 21:02:46,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:02:46,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 21:02:46,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:02:46,343 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 21:02:46,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 21:02:46,670 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 21:02:46,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 21:02:46,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 21:02:46,671 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 21:02:46,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 21:02:46,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 21:02:46,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 21:02:46,673 INFO L87 Difference]: Start difference. First operand 2880 states and 3936 transitions. Second operand 4 states. [2018-11-07 21:02:51,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 21:02:51,230 INFO L93 Difference]: Finished difference Result 5754 states and 7882 transitions. [2018-11-07 21:02:51,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 21:02:51,231 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 176 [2018-11-07 21:02:51,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 21:02:51,244 INFO L225 Difference]: With dead ends: 5754 [2018-11-07 21:02:51,244 INFO L226 Difference]: Without dead ends: 2880 [2018-11-07 21:02:51,256 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 21:02:51,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2880 states. [2018-11-07 21:02:51,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2880 to 2880. [2018-11-07 21:02:51,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2880 states. [2018-11-07 21:02:51,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2880 states to 2880 states and 3720 transitions. [2018-11-07 21:02:51,313 INFO L78 Accepts]: Start accepts. Automaton has 2880 states and 3720 transitions. Word has length 176 [2018-11-07 21:02:51,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 21:02:51,313 INFO L480 AbstractCegarLoop]: Abstraction has 2880 states and 3720 transitions. [2018-11-07 21:02:51,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 21:02:51,314 INFO L276 IsEmpty]: Start isEmpty. Operand 2880 states and 3720 transitions. [2018-11-07 21:02:51,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-11-07 21:02:51,318 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 21:02:51,318 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2018-11-07 21:02:51,318 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 21:02:51,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 21:02:51,319 INFO L82 PathProgramCache]: Analyzing trace with hash -639298360, now seen corresponding path program 1 times [2018-11-07 21:02:51,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 21:02:51,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:02:51,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 21:02:51,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:02:51,320 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 21:02:51,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 21:02:51,697 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-11-07 21:02:51,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 21:02:51,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 21:02:51,697 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 21:02:51,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 21:02:51,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 21:02:51,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 21:02:51,700 INFO L87 Difference]: Start difference. First operand 2880 states and 3720 transitions. Second operand 4 states. [2018-11-07 21:02:57,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 21:02:57,338 INFO L93 Difference]: Finished difference Result 11049 states and 14698 transitions. [2018-11-07 21:02:57,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 21:02:57,341 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 230 [2018-11-07 21:02:57,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 21:02:57,376 INFO L225 Difference]: With dead ends: 11049 [2018-11-07 21:02:57,376 INFO L226 Difference]: Without dead ends: 8175 [2018-11-07 21:02:57,387 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 21:02:57,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8175 states. [2018-11-07 21:02:57,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8175 to 8171. [2018-11-07 21:02:57,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8171 states. [2018-11-07 21:02:57,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8171 states to 8171 states and 9880 transitions. [2018-11-07 21:02:57,547 INFO L78 Accepts]: Start accepts. Automaton has 8171 states and 9880 transitions. Word has length 230 [2018-11-07 21:02:57,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 21:02:57,547 INFO L480 AbstractCegarLoop]: Abstraction has 8171 states and 9880 transitions. [2018-11-07 21:02:57,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 21:02:57,548 INFO L276 IsEmpty]: Start isEmpty. Operand 8171 states and 9880 transitions. [2018-11-07 21:02:57,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-11-07 21:02:57,555 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 21:02:57,556 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2018-11-07 21:02:57,556 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 21:02:57,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 21:02:57,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1380574037, now seen corresponding path program 1 times [2018-11-07 21:02:57,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 21:02:57,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:02:57,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 21:02:57,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:02:57,558 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 21:02:57,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 21:02:58,004 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 118 proven. 72 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 21:02:58,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 21:02:58,005 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 21:02:58,006 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 254 with the following transitions: [2018-11-07 21:02:58,008 INFO L202 CegarAbsIntRunner]: [0], [1], [711], [718], [726], [734], [742], [750], [758], [766], [774], [782], [790], [798], [806], [814], [822], [830], [838], [846], [854], [862], [870], [878], [886], [894], [902], [910], [918], [926], [934], [942], [950], [958], [966], [974], [982], [990], [998], [1006], [1014], [1022], [1030], [1038], [1046], [1054], [1062], [1070], [1078], [1086], [1094], [1102], [1110], [1118], [1126], [1134], [1138], [1140], [1143], [1151], [1159], [1167], [1175], [1183], [1191], [1199], [1204], [1208], [1212], [1216], [1220], [1224], [1228], [1231], [1232], [1236], [1240], [1244], [1255], [1259], [1263], [1267], [1271], [1275], [1279], [1283], [1287], [1291], [1295], [1299], [1303], [1307], [1318], [1322], [1326], [1330], [1334], [1345], [1349], [1353], [1357], [1361], [1365], [1369], [1373], [1377], [1381], [1384], [2279], [2283], [2287], [2293], [2297], [2299], [2306], [2307], [2308], [2310], [2311] [2018-11-07 21:02:58,059 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 21:02:58,060 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 21:02:58,731 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 21:02:58,749 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 21:02:58,750 INFO L272 AbstractInterpreter]: Visited 115 different actions 115 times. Never merged. Never widened. Never found a fixpoint. Largest state had 26 variables. [2018-11-07 21:02:58,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 21:02:58,806 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 21:02:59,442 INFO L227 lantSequenceWeakener]: Weakened 244 states. On average, predicates are now at 75.75% of their original sizes. [2018-11-07 21:02:59,443 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 21:02:59,903 INFO L415 sIntCurrentIteration]: We unified 252 AI predicates to 252 [2018-11-07 21:02:59,903 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 21:02:59,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 21:02:59,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [6] total 12 [2018-11-07 21:02:59,904 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 21:02:59,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 21:02:59,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 21:02:59,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-07 21:02:59,906 INFO L87 Difference]: Start difference. First operand 8171 states and 9880 transitions. Second operand 8 states. [2018-11-07 21:03:27,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 21:03:27,709 INFO L93 Difference]: Finished difference Result 16772 states and 20222 transitions. [2018-11-07 21:03:27,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 21:03:27,709 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 253 [2018-11-07 21:03:27,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 21:03:27,743 INFO L225 Difference]: With dead ends: 16772 [2018-11-07 21:03:27,743 INFO L226 Difference]: Without dead ends: 8607 [2018-11-07 21:03:27,763 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 254 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-11-07 21:03:27,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8607 states. [2018-11-07 21:03:27,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8607 to 8605. [2018-11-07 21:03:27,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8605 states. [2018-11-07 21:03:27,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8605 states to 8605 states and 10325 transitions. [2018-11-07 21:03:27,939 INFO L78 Accepts]: Start accepts. Automaton has 8605 states and 10325 transitions. Word has length 253 [2018-11-07 21:03:27,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 21:03:27,940 INFO L480 AbstractCegarLoop]: Abstraction has 8605 states and 10325 transitions. [2018-11-07 21:03:27,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 21:03:27,940 INFO L276 IsEmpty]: Start isEmpty. Operand 8605 states and 10325 transitions. [2018-11-07 21:03:27,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-11-07 21:03:27,952 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 21:03:27,953 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2018-11-07 21:03:27,953 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 21:03:27,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 21:03:27,953 INFO L82 PathProgramCache]: Analyzing trace with hash 757180591, now seen corresponding path program 1 times [2018-11-07 21:03:27,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 21:03:27,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:03:27,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 21:03:27,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:03:27,956 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 21:03:28,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 21:03:28,361 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-11-07 21:03:28,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 21:03:28,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 21:03:28,362 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 21:03:28,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 21:03:28,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 21:03:28,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 21:03:28,363 INFO L87 Difference]: Start difference. First operand 8605 states and 10325 transitions. Second operand 4 states. [2018-11-07 21:03:34,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 21:03:34,764 INFO L93 Difference]: Finished difference Result 22089 states and 27084 transitions. [2018-11-07 21:03:34,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 21:03:34,765 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 296 [2018-11-07 21:03:34,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 21:03:34,823 INFO L225 Difference]: With dead ends: 22089 [2018-11-07 21:03:34,824 INFO L226 Difference]: Without dead ends: 13924 [2018-11-07 21:03:34,858 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 21:03:34,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13924 states. [2018-11-07 21:03:35,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13924 to 13912. [2018-11-07 21:03:35,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13912 states. [2018-11-07 21:03:35,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13912 states to 13912 states and 16479 transitions. [2018-11-07 21:03:35,125 INFO L78 Accepts]: Start accepts. Automaton has 13912 states and 16479 transitions. Word has length 296 [2018-11-07 21:03:35,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 21:03:35,126 INFO L480 AbstractCegarLoop]: Abstraction has 13912 states and 16479 transitions. [2018-11-07 21:03:35,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 21:03:35,126 INFO L276 IsEmpty]: Start isEmpty. Operand 13912 states and 16479 transitions. [2018-11-07 21:03:35,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2018-11-07 21:03:35,139 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 21:03:35,139 INFO L375 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, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 21:03:35,139 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 21:03:35,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 21:03:35,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1570509174, now seen corresponding path program 1 times [2018-11-07 21:03:35,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 21:03:35,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:03:35,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 21:03:35,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:03:35,141 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 21:03:35,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 21:03:35,580 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 187 proven. 142 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-11-07 21:03:35,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 21:03:35,580 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 21:03:35,581 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 306 with the following transitions: [2018-11-07 21:03:35,581 INFO L202 CegarAbsIntRunner]: [0], [1], [711], [718], [726], [734], [742], [750], [758], [766], [774], [782], [790], [798], [806], [814], [822], [830], [838], [846], [854], [862], [870], [878], [886], [894], [902], [910], [918], [926], [934], [942], [950], [958], [966], [974], [982], [990], [998], [1006], [1014], [1022], [1030], [1038], [1046], [1054], [1062], [1070], [1078], [1086], [1094], [1102], [1110], [1118], [1126], [1134], [1138], [1140], [1143], [1151], [1159], [1167], [1175], [1183], [1191], [1199], [1204], [1208], [1212], [1216], [1220], [1223], [1224], [1227], [1228], [1232], [1236], [1240], [1244], [1255], [1259], [1263], [1267], [1271], [1275], [1279], [1282], [2279], [2283], [2287], [2293], [2297], [2299], [2306], [2307], [2308], [2310], [2311] [2018-11-07 21:03:35,586 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 21:03:35,586 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 21:03:35,643 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 21:03:36,343 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 21:03:36,343 INFO L272 AbstractInterpreter]: Visited 98 different actions 483 times. Merged at 8 different actions 38 times. Never widened. Found 9 fixpoints after 2 different actions. Largest state had 26 variables. [2018-11-07 21:03:36,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 21:03:36,350 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 21:03:36,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 21:03:36,350 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 21:03:36,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 21:03:36,362 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 21:03:36,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 21:03:36,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 21:03:36,954 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 17 [2018-11-07 21:03:37,443 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 272 proven. 2 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2018-11-07 21:03:37,444 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 21:03:38,545 WARN L179 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 24 [2018-11-07 21:03:39,259 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 187 proven. 211 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 21:03:39,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 21:03:39,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 16 [2018-11-07 21:03:39,293 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 21:03:39,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 21:03:39,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 21:03:39,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2018-11-07 21:03:39,295 INFO L87 Difference]: Start difference. First operand 13912 states and 16479 transitions. Second operand 10 states. [2018-11-07 21:04:08,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 21:04:08,279 INFO L93 Difference]: Finished difference Result 46421 states and 58485 transitions. [2018-11-07 21:04:08,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 21:04:08,280 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 305 [2018-11-07 21:04:08,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 21:04:08,435 INFO L225 Difference]: With dead ends: 46421 [2018-11-07 21:04:08,436 INFO L226 Difference]: Without dead ends: 32949 [2018-11-07 21:04:08,528 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 633 GetRequests, 610 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=164, Invalid=388, Unknown=0, NotChecked=0, Total=552 [2018-11-07 21:04:08,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32949 states. [2018-11-07 21:04:09,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32949 to 32802. [2018-11-07 21:04:09,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32802 states. [2018-11-07 21:04:09,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32802 states to 32802 states and 40399 transitions. [2018-11-07 21:04:09,435 INFO L78 Accepts]: Start accepts. Automaton has 32802 states and 40399 transitions. Word has length 305 [2018-11-07 21:04:09,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 21:04:09,435 INFO L480 AbstractCegarLoop]: Abstraction has 32802 states and 40399 transitions. [2018-11-07 21:04:09,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 21:04:09,436 INFO L276 IsEmpty]: Start isEmpty. Operand 32802 states and 40399 transitions. [2018-11-07 21:04:09,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-11-07 21:04:09,450 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 21:04:09,450 INFO L375 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, 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, 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] [2018-11-07 21:04:09,451 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 21:04:09,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 21:04:09,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1860730581, now seen corresponding path program 1 times [2018-11-07 21:04:09,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 21:04:09,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:04:09,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 21:04:09,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:04:09,452 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 21:04:09,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 21:04:09,911 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 5 [2018-11-07 21:04:10,655 INFO L134 CoverageAnalysis]: Checked inductivity of 404 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2018-11-07 21:04:10,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 21:04:10,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 21:04:10,657 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 21:04:10,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 21:04:10,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 21:04:10,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 21:04:10,658 INFO L87 Difference]: Start difference. First operand 32802 states and 40399 transitions. Second operand 4 states. [2018-11-07 21:04:18,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 21:04:18,807 INFO L93 Difference]: Finished difference Result 85916 states and 109175 transitions. [2018-11-07 21:04:18,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 21:04:18,815 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 328 [2018-11-07 21:04:18,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 21:04:19,021 INFO L225 Difference]: With dead ends: 85916 [2018-11-07 21:04:19,021 INFO L226 Difference]: Without dead ends: 53554 [2018-11-07 21:04:19,115 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 21:04:19,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53554 states. [2018-11-07 21:04:19,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53554 to 47377. [2018-11-07 21:04:19,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47377 states. [2018-11-07 21:04:20,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47377 states to 47377 states and 56875 transitions. [2018-11-07 21:04:20,094 INFO L78 Accepts]: Start accepts. Automaton has 47377 states and 56875 transitions. Word has length 328 [2018-11-07 21:04:20,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 21:04:20,095 INFO L480 AbstractCegarLoop]: Abstraction has 47377 states and 56875 transitions. [2018-11-07 21:04:20,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 21:04:20,095 INFO L276 IsEmpty]: Start isEmpty. Operand 47377 states and 56875 transitions. [2018-11-07 21:04:20,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2018-11-07 21:04:20,131 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 21:04:20,131 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-11-07 21:04:20,132 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 21:04:20,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 21:04:20,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1332328749, now seen corresponding path program 1 times [2018-11-07 21:04:20,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 21:04:20,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:04:20,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 21:04:20,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:04:20,133 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 21:04:20,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 21:04:20,595 INFO L134 CoverageAnalysis]: Checked inductivity of 687 backedges. 465 proven. 2 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 21:04:20,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 21:04:20,596 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 21:04:20,596 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 403 with the following transitions: [2018-11-07 21:04:20,598 INFO L202 CegarAbsIntRunner]: [0], [1], [711], [718], [726], [734], [742], [750], [758], [766], [774], [782], [790], [798], [806], [814], [822], [830], [838], [846], [854], [862], [870], [878], [886], [894], [902], [910], [918], [926], [934], [942], [950], [958], [966], [974], [982], [990], [998], [1006], [1014], [1022], [1030], [1038], [1046], [1054], [1062], [1070], [1078], [1086], [1094], [1102], [1110], [1118], [1126], [1134], [1138], [1140], [1143], [1151], [1159], [1167], [1175], [1183], [1191], [1199], [1204], [1208], [1212], [1216], [1220], [1223], [1224], [1227], [1228], [1232], [1236], [1240], [1244], [1255], [1259], [1263], [1267], [1271], [1275], [1279], [1283], [1287], [1291], [1295], [1299], [1303], [1307], [1318], [1322], [1326], [1330], [1334], [1345], [1349], [1353], [1357], [1361], [1365], [1369], [1373], [1377], [1381], [1384], [2279], [2283], [2287], [2293], [2297], [2299], [2306], [2307], [2308], [2310], [2311] [2018-11-07 21:04:20,606 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 21:04:20,606 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 21:04:20,694 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 21:04:21,260 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 21:04:21,260 INFO L272 AbstractInterpreter]: Visited 120 different actions 346 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-11-07 21:04:21,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 21:04:21,299 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 21:04:21,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 21:04:21,299 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 21:04:21,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 21:04:21,318 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 21:04:21,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 21:04:21,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 21:04:22,570 INFO L134 CoverageAnalysis]: Checked inductivity of 687 backedges. 490 proven. 2 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2018-11-07 21:04:22,571 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 21:04:22,992 WARN L179 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 27 [2018-11-07 21:04:23,419 INFO L134 CoverageAnalysis]: Checked inductivity of 687 backedges. 319 proven. 147 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2018-11-07 21:04:23,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 21:04:23,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-11-07 21:04:23,443 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 21:04:23,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 21:04:23,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 21:04:23,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-07 21:04:23,444 INFO L87 Difference]: Start difference. First operand 47377 states and 56875 transitions. Second operand 8 states. [2018-11-07 21:04:34,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 21:04:34,373 INFO L93 Difference]: Finished difference Result 135996 states and 164035 transitions. [2018-11-07 21:04:34,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-07 21:04:34,374 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 402 [2018-11-07 21:04:34,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 21:04:34,538 INFO L225 Difference]: With dead ends: 135996 [2018-11-07 21:04:34,539 INFO L226 Difference]: Without dead ends: 57200 [2018-11-07 21:04:34,710 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 856 GetRequests, 821 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=270, Invalid=920, Unknown=0, NotChecked=0, Total=1190 [2018-11-07 21:04:34,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57200 states. [2018-11-07 21:04:35,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57200 to 48037. [2018-11-07 21:04:35,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48037 states. [2018-11-07 21:04:35,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48037 states to 48037 states and 55833 transitions. [2018-11-07 21:04:35,787 INFO L78 Accepts]: Start accepts. Automaton has 48037 states and 55833 transitions. Word has length 402 [2018-11-07 21:04:35,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 21:04:35,788 INFO L480 AbstractCegarLoop]: Abstraction has 48037 states and 55833 transitions. [2018-11-07 21:04:35,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 21:04:35,788 INFO L276 IsEmpty]: Start isEmpty. Operand 48037 states and 55833 transitions. [2018-11-07 21:04:35,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2018-11-07 21:04:35,808 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 21:04:35,809 INFO L375 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 21:04:35,809 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 21:04:35,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 21:04:35,809 INFO L82 PathProgramCache]: Analyzing trace with hash -391628634, now seen corresponding path program 1 times [2018-11-07 21:04:35,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 21:04:35,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:04:35,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 21:04:35,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:04:35,811 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 21:04:35,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 21:04:36,221 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2018-11-07 21:04:36,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 21:04:36,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 21:04:36,222 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 21:04:36,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 21:04:36,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 21:04:36,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 21:04:36,224 INFO L87 Difference]: Start difference. First operand 48037 states and 55833 transitions. Second operand 3 states. [2018-11-07 21:04:39,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 21:04:39,614 INFO L93 Difference]: Finished difference Result 116967 states and 137324 transitions. [2018-11-07 21:04:39,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 21:04:39,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 461 [2018-11-07 21:04:39,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 21:04:39,770 INFO L225 Difference]: With dead ends: 116967 [2018-11-07 21:04:39,771 INFO L226 Difference]: Without dead ends: 68486 [2018-11-07 21:04:39,850 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 21:04:39,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68486 states. [2018-11-07 21:04:40,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68486 to 63274. [2018-11-07 21:04:40,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63274 states. [2018-11-07 21:04:40,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63274 states to 63274 states and 72854 transitions. [2018-11-07 21:04:40,754 INFO L78 Accepts]: Start accepts. Automaton has 63274 states and 72854 transitions. Word has length 461 [2018-11-07 21:04:40,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 21:04:40,755 INFO L480 AbstractCegarLoop]: Abstraction has 63274 states and 72854 transitions. [2018-11-07 21:04:40,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 21:04:40,755 INFO L276 IsEmpty]: Start isEmpty. Operand 63274 states and 72854 transitions. [2018-11-07 21:04:40,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2018-11-07 21:04:40,771 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 21:04:40,772 INFO L375 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 21:04:40,772 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 21:04:40,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 21:04:40,773 INFO L82 PathProgramCache]: Analyzing trace with hash -67504576, now seen corresponding path program 1 times [2018-11-07 21:04:40,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 21:04:40,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:04:40,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 21:04:40,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:04:40,774 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 21:04:40,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 21:04:41,473 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2018-11-07 21:04:41,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 21:04:41,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 21:04:41,473 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 21:04:41,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 21:04:41,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 21:04:41,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 21:04:41,475 INFO L87 Difference]: Start difference. First operand 63274 states and 72854 transitions. Second operand 4 states. [2018-11-07 21:04:46,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 21:04:46,177 INFO L93 Difference]: Finished difference Result 149273 states and 172608 transitions. [2018-11-07 21:04:46,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 21:04:46,178 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 470 [2018-11-07 21:04:46,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 21:04:46,346 INFO L225 Difference]: With dead ends: 149273 [2018-11-07 21:04:46,346 INFO L226 Difference]: Without dead ends: 81630 [2018-11-07 21:04:46,425 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 21:04:46,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81630 states. [2018-11-07 21:04:47,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81630 to 73366. [2018-11-07 21:04:47,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73366 states. [2018-11-07 21:04:47,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73366 states to 73366 states and 83506 transitions. [2018-11-07 21:04:47,478 INFO L78 Accepts]: Start accepts. Automaton has 73366 states and 83506 transitions. Word has length 470 [2018-11-07 21:04:47,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 21:04:47,479 INFO L480 AbstractCegarLoop]: Abstraction has 73366 states and 83506 transitions. [2018-11-07 21:04:47,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 21:04:47,479 INFO L276 IsEmpty]: Start isEmpty. Operand 73366 states and 83506 transitions. [2018-11-07 21:04:47,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 673 [2018-11-07 21:04:47,531 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 21:04:47,532 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 21:04:47,532 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 21:04:47,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 21:04:47,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1178967, now seen corresponding path program 1 times [2018-11-07 21:04:47,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 21:04:47,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:04:47,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 21:04:47,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:04:47,534 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 21:04:47,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 21:04:48,378 INFO L134 CoverageAnalysis]: Checked inductivity of 891 backedges. 252 proven. 2 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2018-11-07 21:04:48,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 21:04:48,379 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 21:04:48,379 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 673 with the following transitions: [2018-11-07 21:04:48,380 INFO L202 CegarAbsIntRunner]: [0], [1], [711], [718], [726], [734], [742], [750], [758], [766], [774], [782], [790], [798], [806], [814], [822], [830], [838], [846], [854], [862], [870], [878], [886], [894], [902], [910], [918], [926], [934], [942], [950], [958], [966], [974], [982], [990], [998], [1006], [1014], [1022], [1030], [1038], [1046], [1054], [1062], [1070], [1078], [1086], [1094], [1102], [1110], [1118], [1126], [1134], [1138], [1140], [1143], [1151], [1159], [1167], [1175], [1183], [1191], [1199], [1204], [1208], [1212], [1216], [1220], [1224], [1228], [1232], [1236], [1240], [1244], [1255], [1259], [1263], [1267], [1271], [1275], [1279], [1282], [1283], [1287], [1291], [1295], [1299], [1303], [1307], [1318], [1322], [1326], [1330], [1334], [1345], [1349], [1353], [1357], [1361], [1365], [1369], [1373], [1377], [1381], [1385], [1389], [1393], [1397], [1401], [1405], [1409], [1413], [1417], [1420], [1425], [1427], [1428], [1432], [1436], [1440], [1451], [1455], [1459], [1463], [1467], [1471], [1475], [1479], [1490], [1501], [1505], [1516], [1520], [1524], [1528], [1532], [1536], [1540], [1544], [1548], [1559], [1563], [1567], [1578], [1582], [1593], [1597], [1601], [1612], [1623], [1626], [1627], [1631], [1635], [1639], [1643], [1647], [1651], [1655], [1659], [1663], [1667], [1678], [1689], [1693], [1697], [1701], [1705], [1709], [1713], [1717], [1728], [1732], [1736], [1747], [1751], [1755], [1759], [1763], [1767], [1771], [1775], [1779], [1783], [1787], [1791], [1795], [1799], [1803], [1807], [1818], [1822], [1826], [1830], [1834], [1838], [1842], [1846], [1850], [1854], [1858], [1862], [1866], [1870], [1874], [1878], [1882], [1886], [1890], [1894], [1898], [1902], [1906], [1910], [1914], [1918], [1922], [1933], [1937], [1941], [1945], [1949], [1960], [1964], [1968], [1972], [1976], [1980], [1984], [1988], [1992], [1996], [2000], [2004], [2008], [2012], [2016], [2020], [2024], [2028], [2031], [2034], [2038], [2279], [2283], [2287], [2293], [2297], [2299], [2306], [2307], [2308], [2310], [2311] [2018-11-07 21:04:48,399 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 21:04:48,399 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 21:04:48,506 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 21:04:50,103 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 21:04:50,103 INFO L272 AbstractInterpreter]: Visited 253 different actions 1003 times. Merged at 7 different actions 25 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 26 variables. [2018-11-07 21:04:50,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 21:04:50,140 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 21:04:51,175 INFO L227 lantSequenceWeakener]: Weakened 666 states. On average, predicates are now at 75.33% of their original sizes. [2018-11-07 21:04:51,175 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 21:04:51,646 INFO L415 sIntCurrentIteration]: We unified 671 AI predicates to 671 [2018-11-07 21:04:51,647 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 21:04:51,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 21:04:51,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [3] total 13 [2018-11-07 21:04:51,648 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 21:04:51,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 21:04:51,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 21:04:51,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-11-07 21:04:51,649 INFO L87 Difference]: Start difference. First operand 73366 states and 83506 transitions. Second operand 12 states. Received shutdown request... [2018-11-07 21:05:41,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-07 21:05:41,870 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 21:05:41,876 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 21:05:41,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 09:05:41 BoogieIcfgContainer [2018-11-07 21:05:41,876 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 21:05:41,877 INFO L168 Benchmark]: Toolchain (without parser) took 207717.41 ms. Allocated memory was 1.5 GB in the beginning and 5.3 GB in the end (delta: 3.8 GB). Free memory was 1.4 GB in the beginning and 3.5 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2018-11-07 21:05:41,878 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 21:05:41,878 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1650.39 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 137.4 MB). Peak memory consumption was 137.4 MB. Max. memory is 7.1 GB. [2018-11-07 21:05:41,879 INFO L168 Benchmark]: Boogie Procedure Inliner took 286.07 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 796.4 MB). Free memory was 1.3 GB in the beginning and 2.3 GB in the end (delta: -984.9 MB). Peak memory consumption was 42.5 MB. Max. memory is 7.1 GB. [2018-11-07 21:05:41,880 INFO L168 Benchmark]: Boogie Preprocessor took 214.62 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.3 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2018-11-07 21:05:41,881 INFO L168 Benchmark]: RCFGBuilder took 8724.95 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 1.8 GB in the end (delta: 450.0 MB). Peak memory consumption was 450.0 MB. Max. memory is 7.1 GB. [2018-11-07 21:05:41,883 INFO L168 Benchmark]: TraceAbstraction took 196835.91 ms. Allocated memory was 2.3 GB in the beginning and 5.3 GB in the end (delta: 3.0 GB). Free memory was 1.8 GB in the beginning and 3.5 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2018-11-07 21:05:41,888 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1650.39 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 137.4 MB). Peak memory consumption was 137.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 286.07 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 796.4 MB). Free memory was 1.3 GB in the beginning and 2.3 GB in the end (delta: -984.9 MB). Peak memory consumption was 42.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 214.62 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.3 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 8724.95 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 1.8 GB in the end (delta: 450.0 MB). Peak memory consumption was 450.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 196835.91 ms. Allocated memory was 2.3 GB in the beginning and 5.3 GB in the end (delta: 3.0 GB). Free memory was 1.8 GB in the beginning and 3.5 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 185]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 185). Cancelled while BasicCegarLoop was constructing difference of abstraction (73366states) and FLOYD_HOARE automaton (currently 24 states, 12 states before enhancement),while ReachableStatesComputation was computing reachable states (58139 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 604 locations, 1 error locations. TIMEOUT Result, 196.7s OverallTime, 13 OverallIterations, 5 TraceHistogramMax, 171.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6432 SDtfs, 23538 SDslu, 4022 SDs, 0 SdLazy, 47543 SolverSat, 8287 SolverUnsat, 121 SolverUnknown, 0 SolverNotchecked, 106.9s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 2485 GetRequests, 2364 SyntacticMatches, 6 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 521 ImplicationChecksByTransitivity, 6.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73366occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 4.0s AbstIntTime, 4 AbstIntIterations, 2 AbstIntStrong, 0.9982240845498656 AbsIntWeakeningRatio, 0.07367280606717226 AbsIntAvgWeakeningVarsNumRemoved, 22.84940411700975 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 5.8s AutomataMinimizationTime, 12 MinimizatonAttempts, 29522 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 8.7s InterpolantComputationTime, 4654 NumberOfCodeBlocks, 4654 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 5344 ConstructedInterpolants, 93 QuantifiedInterpolants, 4883077 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1211 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 17 InterpolantComputations, 9 PerfectInterpolantSequences, 5681/6261 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown