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.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem17_label21_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 03:55:24,123 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 03:55:24,125 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 03:55:24,137 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 03:55:24,137 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 03:55:24,138 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 03:55:24,140 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 03:55:24,142 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 03:55:24,143 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 03:55:24,144 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 03:55:24,145 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 03:55:24,146 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 03:55:24,147 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 03:55:24,148 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 03:55:24,149 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 03:55:24,150 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 03:55:24,153 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 03:55:24,156 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 03:55:24,161 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 03:55:24,166 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 03:55:24,167 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 03:55:24,168 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 03:55:24,170 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 03:55:24,171 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 03:55:24,171 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 03:55:24,172 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 03:55:24,173 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 03:55:24,173 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 03:55:24,174 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 03:55:24,175 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 03:55:24,175 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 03:55:24,176 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 03:55:24,176 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 03:55:24,176 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 03:55:24,178 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 03:55:24,179 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 03:55:24,180 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-11-07 03:55:24,203 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 03:55:24,203 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 03:55:24,204 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 03:55:24,204 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 03:55:24,204 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 03:55:24,204 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 03:55:24,205 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 03:55:24,205 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 03:55:24,205 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 03:55:24,205 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 03:55:24,205 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 03:55:24,206 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 03:55:24,206 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 03:55:24,207 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 03:55:24,207 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 03:55:24,207 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 03:55:24,207 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 03:55:24,207 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 03:55:24,208 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 03:55:24,208 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 03:55:24,208 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 03:55:24,208 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 03:55:24,208 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 03:55:24,208 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 03:55:24,209 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 03:55:24,209 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 03:55:24,209 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 03:55:24,209 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 03:55:24,210 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 03:55:24,210 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 03:55:24,210 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 03:55:24,210 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 03:55:24,210 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 03:55:24,211 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 03:55:24,256 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 03:55:24,271 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 03:55:24,275 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 03:55:24,276 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 03:55:24,277 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 03:55:24,277 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 03:55:24,348 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c5917340/7aebe10b6e2e45ed9cbaf58f9df9ceb4/FLAG1487469f2 [2018-11-07 03:55:25,136 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 03:55:25,137 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem17_label21_true-unreach-call.c [2018-11-07 03:55:25,167 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c5917340/7aebe10b6e2e45ed9cbaf58f9df9ceb4/FLAG1487469f2 [2018-11-07 03:55:25,184 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c5917340/7aebe10b6e2e45ed9cbaf58f9df9ceb4 [2018-11-07 03:55:25,197 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 03:55:25,199 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 03:55:25,200 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 03:55:25,200 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 03:55:25,205 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 03:55:25,206 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:55:25" (1/1) ... [2018-11-07 03:55:25,209 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68992734 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:55:25, skipping insertion in model container [2018-11-07 03:55:25,210 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:55:25" (1/1) ... [2018-11-07 03:55:25,221 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 03:55:25,336 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 03:55:26,265 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 03:55:26,270 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 03:55:26,687 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 03:55:26,712 INFO L193 MainTranslator]: Completed translation [2018-11-07 03:55:26,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:55:26 WrapperNode [2018-11-07 03:55:26,713 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 03:55:26,714 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 03:55:26,715 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 03:55:26,715 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 03:55:26,726 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:55:26" (1/1) ... [2018-11-07 03:55:27,032 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:55:26" (1/1) ... [2018-11-07 03:55:27,044 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 03:55:27,045 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 03:55:27,045 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 03:55:27,045 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 03:55:27,058 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:55:26" (1/1) ... [2018-11-07 03:55:27,059 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:55:26" (1/1) ... [2018-11-07 03:55:27,073 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:55:26" (1/1) ... [2018-11-07 03:55:27,074 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:55:26" (1/1) ... [2018-11-07 03:55:27,180 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:55:26" (1/1) ... [2018-11-07 03:55:27,222 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:55:26" (1/1) ... [2018-11-07 03:55:27,259 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:55:26" (1/1) ... [2018-11-07 03:55:27,292 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 03:55:27,293 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 03:55:27,293 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 03:55:27,293 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 03:55:27,294 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:55:26" (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 03:55:27,372 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 03:55:27,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 03:55:27,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 03:55:27,373 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-11-07 03:55:27,373 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-11-07 03:55:27,373 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 03:55:27,374 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 03:55:27,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 03:55:27,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 03:55:27,374 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 03:55:27,375 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 03:55:36,565 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 03:55:36,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:55:36 BoogieIcfgContainer [2018-11-07 03:55:36,566 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 03:55:36,568 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 03:55:36,568 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 03:55:36,571 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 03:55:36,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:55:25" (1/3) ... [2018-11-07 03:55:36,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fd44024 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:55:36, skipping insertion in model container [2018-11-07 03:55:36,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:55:26" (2/3) ... [2018-11-07 03:55:36,573 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fd44024 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:55:36, skipping insertion in model container [2018-11-07 03:55:36,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:55:36" (3/3) ... [2018-11-07 03:55:36,575 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label21_true-unreach-call.c [2018-11-07 03:55:36,586 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 03:55:36,597 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 03:55:36,615 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 03:55:36,662 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 03:55:36,662 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 03:55:36,663 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 03:55:36,663 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 03:55:36,663 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 03:55:36,663 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 03:55:36,663 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 03:55:36,663 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 03:55:36,705 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states. [2018-11-07 03:55:36,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-07 03:55:36,716 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 03:55:36,717 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 03:55:36,720 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 03:55:36,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 03:55:36,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1861558100, now seen corresponding path program 1 times [2018-11-07 03:55:36,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 03:55:36,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:55:36,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 03:55:36,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:55:36,778 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 03:55:36,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 03:55:37,319 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 03:55:37,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 03:55:37,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 03:55:37,322 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 03:55:37,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 03:55:37,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 03:55:37,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 03:55:37,351 INFO L87 Difference]: Start difference. First operand 604 states. Second operand 4 states. [2018-11-07 03:55:46,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 03:55:46,322 INFO L93 Difference]: Finished difference Result 2166 states and 4013 transitions. [2018-11-07 03:55:46,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 03:55:46,334 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-11-07 03:55:46,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 03:55:46,377 INFO L225 Difference]: With dead ends: 2166 [2018-11-07 03:55:46,377 INFO L226 Difference]: Without dead ends: 1556 [2018-11-07 03:55:46,388 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 03:55:46,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1556 states. [2018-11-07 03:55:46,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1556 to 1068. [2018-11-07 03:55:46,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2018-11-07 03:55:46,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1850 transitions. [2018-11-07 03:55:46,538 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1850 transitions. Word has length 66 [2018-11-07 03:55:46,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 03:55:46,539 INFO L480 AbstractCegarLoop]: Abstraction has 1068 states and 1850 transitions. [2018-11-07 03:55:46,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 03:55:46,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1850 transitions. [2018-11-07 03:55:46,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-07 03:55:46,554 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 03:55:46,554 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 03:55:46,555 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 03:55:46,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 03:55:46,555 INFO L82 PathProgramCache]: Analyzing trace with hash -436141222, now seen corresponding path program 1 times [2018-11-07 03:55:46,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 03:55:46,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:55:46,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 03:55:46,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:55:46,558 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 03:55:46,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 03:55:47,011 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 03:55:47,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 03:55:47,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 03:55:47,012 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 03:55:47,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 03:55:47,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 03:55:47,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 03:55:47,015 INFO L87 Difference]: Start difference. First operand 1068 states and 1850 transitions. Second operand 6 states. [2018-11-07 03:55:54,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 03:55:54,129 INFO L93 Difference]: Finished difference Result 3059 states and 5419 transitions. [2018-11-07 03:55:54,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 03:55:54,130 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2018-11-07 03:55:54,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 03:55:54,144 INFO L225 Difference]: With dead ends: 3059 [2018-11-07 03:55:54,145 INFO L226 Difference]: Without dead ends: 1997 [2018-11-07 03:55:54,149 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 03:55:54,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1997 states. [2018-11-07 03:55:54,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1997 to 1975. [2018-11-07 03:55:54,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1975 states. [2018-11-07 03:55:54,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1975 states to 1975 states and 3181 transitions. [2018-11-07 03:55:54,228 INFO L78 Accepts]: Start accepts. Automaton has 1975 states and 3181 transitions. Word has length 142 [2018-11-07 03:55:54,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 03:55:54,229 INFO L480 AbstractCegarLoop]: Abstraction has 1975 states and 3181 transitions. [2018-11-07 03:55:54,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 03:55:54,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1975 states and 3181 transitions. [2018-11-07 03:55:54,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-07 03:55:54,242 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 03:55:54,242 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 03:55:54,242 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 03:55:54,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 03:55:54,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1261890222, now seen corresponding path program 1 times [2018-11-07 03:55:54,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 03:55:54,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:55:54,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 03:55:54,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:55:54,245 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 03:55:54,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 03:55:54,561 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 03:55:54,785 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 03:55:54,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 03:55:54,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 03:55:54,785 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 03:55:54,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 03:55:54,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 03:55:54,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 03:55:54,787 INFO L87 Difference]: Start difference. First operand 1975 states and 3181 transitions. Second operand 6 states. [2018-11-07 03:55:59,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 03:55:59,064 INFO L93 Difference]: Finished difference Result 4880 states and 7834 transitions. [2018-11-07 03:55:59,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 03:55:59,065 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 146 [2018-11-07 03:55:59,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 03:55:59,083 INFO L225 Difference]: With dead ends: 4880 [2018-11-07 03:55:59,083 INFO L226 Difference]: Without dead ends: 2911 [2018-11-07 03:55:59,092 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 03:55:59,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2911 states. [2018-11-07 03:55:59,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2911 to 2880. [2018-11-07 03:55:59,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2880 states. [2018-11-07 03:55:59,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2880 states to 2880 states and 3936 transitions. [2018-11-07 03:55:59,181 INFO L78 Accepts]: Start accepts. Automaton has 2880 states and 3936 transitions. Word has length 146 [2018-11-07 03:55:59,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 03:55:59,181 INFO L480 AbstractCegarLoop]: Abstraction has 2880 states and 3936 transitions. [2018-11-07 03:55:59,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 03:55:59,182 INFO L276 IsEmpty]: Start isEmpty. Operand 2880 states and 3936 transitions. [2018-11-07 03:55:59,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-07 03:55:59,185 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 03:55:59,186 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 03:55:59,186 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 03:55:59,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 03:55:59,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1548926097, now seen corresponding path program 1 times [2018-11-07 03:55:59,186 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 03:55:59,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:55:59,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 03:55:59,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:55:59,188 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 03:55:59,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 03:55:59,424 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 03:55:59,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 03:55:59,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 03:55:59,425 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 03:55:59,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 03:55:59,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 03:55:59,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 03:55:59,427 INFO L87 Difference]: Start difference. First operand 2880 states and 3936 transitions. Second operand 4 states. [2018-11-07 03:56:03,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 03:56:03,898 INFO L93 Difference]: Finished difference Result 5754 states and 7882 transitions. [2018-11-07 03:56:03,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 03:56:03,899 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 176 [2018-11-07 03:56:03,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 03:56:03,914 INFO L225 Difference]: With dead ends: 5754 [2018-11-07 03:56:03,915 INFO L226 Difference]: Without dead ends: 2880 [2018-11-07 03:56:03,926 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 03:56:03,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2880 states. [2018-11-07 03:56:03,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2880 to 2880. [2018-11-07 03:56:03,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2880 states. [2018-11-07 03:56:03,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2880 states to 2880 states and 3720 transitions. [2018-11-07 03:56:03,992 INFO L78 Accepts]: Start accepts. Automaton has 2880 states and 3720 transitions. Word has length 176 [2018-11-07 03:56:03,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 03:56:03,992 INFO L480 AbstractCegarLoop]: Abstraction has 2880 states and 3720 transitions. [2018-11-07 03:56:03,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 03:56:03,993 INFO L276 IsEmpty]: Start isEmpty. Operand 2880 states and 3720 transitions. [2018-11-07 03:56:03,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-11-07 03:56:03,996 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 03:56:03,997 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 03:56:03,997 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 03:56:03,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 03:56:03,997 INFO L82 PathProgramCache]: Analyzing trace with hash -639298360, now seen corresponding path program 1 times [2018-11-07 03:56:03,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 03:56:03,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:56:03,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 03:56:03,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:56:03,999 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 03:56:04,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 03:56:04,405 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 03:56:04,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 03:56:04,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 03:56:04,407 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 03:56:04,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 03:56:04,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 03:56:04,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 03:56:04,409 INFO L87 Difference]: Start difference. First operand 2880 states and 3720 transitions. Second operand 4 states. [2018-11-07 03:56:10,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 03:56:10,005 INFO L93 Difference]: Finished difference Result 11049 states and 14698 transitions. [2018-11-07 03:56:10,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 03:56:10,007 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 230 [2018-11-07 03:56:10,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 03:56:10,047 INFO L225 Difference]: With dead ends: 11049 [2018-11-07 03:56:10,047 INFO L226 Difference]: Without dead ends: 8175 [2018-11-07 03:56:10,060 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 03:56:10,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8175 states. [2018-11-07 03:56:10,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8175 to 8171. [2018-11-07 03:56:10,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8171 states. [2018-11-07 03:56:10,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8171 states to 8171 states and 9880 transitions. [2018-11-07 03:56:10,318 INFO L78 Accepts]: Start accepts. Automaton has 8171 states and 9880 transitions. Word has length 230 [2018-11-07 03:56:10,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 03:56:10,319 INFO L480 AbstractCegarLoop]: Abstraction has 8171 states and 9880 transitions. [2018-11-07 03:56:10,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 03:56:10,319 INFO L276 IsEmpty]: Start isEmpty. Operand 8171 states and 9880 transitions. [2018-11-07 03:56:10,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-11-07 03:56:10,327 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 03:56:10,327 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 03:56:10,327 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 03:56:10,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 03:56:10,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1380574037, now seen corresponding path program 1 times [2018-11-07 03:56:10,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 03:56:10,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:56:10,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 03:56:10,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:56:10,329 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 03:56:10,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 03:56:10,915 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 03:56:10,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 03:56:10,916 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 03:56:10,917 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 254 with the following transitions: [2018-11-07 03:56:10,919 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 03:56:10,996 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 03:56:10,997 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 03:56:13,592 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 03:56:14,064 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 03:56:14,066 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 03:56:14,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 03:56:14,074 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 03:56:16,390 INFO L227 lantSequenceWeakener]: Weakened 245 states. On average, predicates are now at 75.85% of their original sizes. [2018-11-07 03:56:16,391 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 03:56:16,990 INFO L415 sIntCurrentIteration]: We unified 252 AI predicates to 252 [2018-11-07 03:56:16,990 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 03:56:16,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 03:56:16,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [6] total 12 [2018-11-07 03:56:16,992 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 03:56:16,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 03:56:16,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 03:56:16,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-07 03:56:16,993 INFO L87 Difference]: Start difference. First operand 8171 states and 9880 transitions. Second operand 8 states. [2018-11-07 03:58:18,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 03:58:18,680 INFO L93 Difference]: Finished difference Result 16772 states and 20222 transitions. [2018-11-07 03:58:18,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 03:58:18,680 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 253 [2018-11-07 03:58:18,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 03:58:18,713 INFO L225 Difference]: With dead ends: 16772 [2018-11-07 03:58:18,713 INFO L226 Difference]: Without dead ends: 8607 [2018-11-07 03:58:18,731 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 254 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-11-07 03:58:18,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8607 states. [2018-11-07 03:58:18,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8607 to 8605. [2018-11-07 03:58:18,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8605 states. [2018-11-07 03:58:18,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8605 states to 8605 states and 10325 transitions. [2018-11-07 03:58:18,905 INFO L78 Accepts]: Start accepts. Automaton has 8605 states and 10325 transitions. Word has length 253 [2018-11-07 03:58:18,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 03:58:18,905 INFO L480 AbstractCegarLoop]: Abstraction has 8605 states and 10325 transitions. [2018-11-07 03:58:18,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 03:58:18,905 INFO L276 IsEmpty]: Start isEmpty. Operand 8605 states and 10325 transitions. [2018-11-07 03:58:18,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-11-07 03:58:18,916 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 03:58:18,917 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 03:58:18,917 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 03:58:18,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 03:58:18,918 INFO L82 PathProgramCache]: Analyzing trace with hash 757180591, now seen corresponding path program 1 times [2018-11-07 03:58:18,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 03:58:18,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:58:18,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 03:58:18,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:58:18,919 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 03:58:18,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 03:58:19,306 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 03:58:19,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 03:58:19,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 03:58:19,307 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 03:58:19,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 03:58:19,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 03:58:19,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 03:58:19,309 INFO L87 Difference]: Start difference. First operand 8605 states and 10325 transitions. Second operand 4 states. [2018-11-07 03:58:24,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 03:58:24,831 INFO L93 Difference]: Finished difference Result 22089 states and 27084 transitions. [2018-11-07 03:58:24,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 03:58:24,833 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 296 [2018-11-07 03:58:24,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 03:58:24,878 INFO L225 Difference]: With dead ends: 22089 [2018-11-07 03:58:24,878 INFO L226 Difference]: Without dead ends: 13924 [2018-11-07 03:58:24,909 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 03:58:24,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13924 states. [2018-11-07 03:58:25,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13924 to 13912. [2018-11-07 03:58:25,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13912 states. [2018-11-07 03:58:25,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13912 states to 13912 states and 16479 transitions. [2018-11-07 03:58:25,192 INFO L78 Accepts]: Start accepts. Automaton has 13912 states and 16479 transitions. Word has length 296 [2018-11-07 03:58:25,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 03:58:25,193 INFO L480 AbstractCegarLoop]: Abstraction has 13912 states and 16479 transitions. [2018-11-07 03:58:25,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 03:58:25,194 INFO L276 IsEmpty]: Start isEmpty. Operand 13912 states and 16479 transitions. [2018-11-07 03:58:25,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2018-11-07 03:58:25,206 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 03:58:25,207 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 03:58:25,207 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 03:58:25,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 03:58:25,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1570509174, now seen corresponding path program 1 times [2018-11-07 03:58:25,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 03:58:25,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:58:25,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 03:58:25,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:58:25,209 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 03:58:25,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 03:58:25,947 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 03:58:25,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 03:58:25,948 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 03:58:25,948 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 306 with the following transitions: [2018-11-07 03:58:25,948 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 03:58:25,954 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 03:58:25,954 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 03:58:27,179 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. Received shutdown request... [2018-11-07 03:59:14,081 WARN L572 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-11-07 03:59:14,081 WARN L158 AbstractInterpreter]: Abstract interpretation run out of time [2018-11-07 03:59:14,083 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 03:59:14,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 03:59:14,083 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 03:59:14,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 03:59:14,094 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 03:59:14,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 03:59:14,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 03:59:14,240 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-11-07 03:59:14,441 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 03:59:14,441 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 03:59:14,446 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 03:59:14,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 03:59:14 BoogieIcfgContainer [2018-11-07 03:59:14,447 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 03:59:14,448 INFO L168 Benchmark]: Toolchain (without parser) took 229249.88 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 3.4 GB in the end (delta: -2.0 GB). Peak memory consumption was 617.9 MB. Max. memory is 7.1 GB. [2018-11-07 03:59:14,449 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 03:59:14,449 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1513.34 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Peak memory consumption was 137.4 MB. Max. memory is 7.1 GB. [2018-11-07 03:59:14,450 INFO L168 Benchmark]: Boogie Procedure Inliner took 330.20 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 730.3 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -917.8 MB). Peak memory consumption was 42.4 MB. Max. memory is 7.1 GB. [2018-11-07 03:59:14,451 INFO L168 Benchmark]: Boogie Preprocessor took 247.78 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2018-11-07 03:59:14,452 INFO L168 Benchmark]: RCFGBuilder took 9273.65 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 458.4 MB). Peak memory consumption was 458.4 MB. Max. memory is 7.1 GB. [2018-11-07 03:59:14,454 INFO L168 Benchmark]: TraceAbstraction took 217879.19 ms. Allocated memory was 2.2 GB in the beginning and 4.1 GB in the end (delta: 1.9 GB). Free memory was 1.7 GB in the beginning and 3.4 GB in the end (delta: -1.7 GB). Peak memory consumption was 194.8 MB. Max. memory is 7.1 GB. [2018-11-07 03:59:14,459 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.16 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1513.34 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 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 330.20 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 730.3 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -917.8 MB). Peak memory consumption was 42.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 247.78 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 9273.65 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 458.4 MB). Peak memory consumption was 458.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 217879.19 ms. Allocated memory was 2.2 GB in the beginning and 4.1 GB in the end (delta: 1.9 GB). Free memory was 1.7 GB in the beginning and 3.4 GB in the end (delta: -1.7 GB). Peak memory consumption was 194.8 MB. 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 analyzing trace of length 306 with TraceHistMax 4,while TraceCheckSpWp was constructing forward predicates,while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 604 locations, 1 error locations. TIMEOUT Result, 217.7s OverallTime, 8 OverallIterations, 4 TraceHistogramMax, 157.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3735 SDtfs, 8714 SDslu, 1775 SDs, 0 SdLazy, 16811 SolverSat, 3444 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 124.1s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 295 GetRequests, 263 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13912occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 51.2s AbstIntTime, 2 AbstIntIterations, 1 AbstIntStrong, 0.9961538461538461 AbsIntWeakeningRatio, 0.10714285714285714 AbsIntAvgWeakeningVarsNumRemoved, 1053.9484126984128 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 559 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1309 NumberOfCodeBlocks, 1309 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1302 ConstructedInterpolants, 0 QuantifiedInterpolants, 948345 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 6 PerfectInterpolantSequences, 700/772 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown