java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem14_label28_false-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 23:38:01,327 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 23:38:01,330 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 23:38:01,347 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 23:38:01,348 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 23:38:01,349 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 23:38:01,351 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 23:38:01,353 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 23:38:01,354 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 23:38:01,356 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 23:38:01,357 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 23:38:01,357 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 23:38:01,360 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 23:38:01,361 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 23:38:01,362 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 23:38:01,370 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 23:38:01,371 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 23:38:01,373 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 23:38:01,376 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 23:38:01,378 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 23:38:01,379 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 23:38:01,380 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 23:38:01,382 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 23:38:01,382 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 23:38:01,382 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 23:38:01,383 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 23:38:01,384 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 23:38:01,385 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 23:38:01,386 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 23:38:01,387 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 23:38:01,387 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 23:38:01,388 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 23:38:01,388 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 23:38:01,388 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 23:38:01,389 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 23:38:01,390 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 23:38:01,390 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-24 23:38:01,404 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 23:38:01,405 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 23:38:01,406 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 23:38:01,406 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-24 23:38:01,406 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-24 23:38:01,406 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-24 23:38:01,406 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-24 23:38:01,407 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-24 23:38:01,407 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-24 23:38:01,407 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-24 23:38:01,407 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-24 23:38:01,407 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-24 23:38:01,407 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-24 23:38:01,408 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-24 23:38:01,408 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 23:38:01,409 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 23:38:01,409 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 23:38:01,409 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 23:38:01,409 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 23:38:01,409 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 23:38:01,410 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 23:38:01,410 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 23:38:01,410 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 23:38:01,410 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 23:38:01,410 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 23:38:01,411 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 23:38:01,411 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 23:38:01,411 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 23:38:01,411 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 23:38:01,411 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 23:38:01,412 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-24 23:38:01,412 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 23:38:01,412 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 23:38:01,412 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 23:38:01,412 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 23:38:01,413 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-24 23:38:01,456 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 23:38:01,469 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 23:38:01,474 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 23:38:01,475 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 23:38:01,476 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 23:38:01,477 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label28_false-unreach-call_false-termination.c [2018-10-24 23:38:01,553 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/83c6c406b/3d05dc1406e2440890ce1cff1caa5796/FLAG900cfb799 [2018-10-24 23:38:02,181 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 23:38:02,183 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label28_false-unreach-call_false-termination.c [2018-10-24 23:38:02,195 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/83c6c406b/3d05dc1406e2440890ce1cff1caa5796/FLAG900cfb799 [2018-10-24 23:38:02,211 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/83c6c406b/3d05dc1406e2440890ce1cff1caa5796 [2018-10-24 23:38:02,226 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 23:38:02,228 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 23:38:02,229 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 23:38:02,233 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 23:38:02,237 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 23:38:02,238 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:38:02" (1/1) ... [2018-10-24 23:38:02,242 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19392d65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:38:02, skipping insertion in model container [2018-10-24 23:38:02,242 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:38:02" (1/1) ... [2018-10-24 23:38:02,253 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 23:38:02,334 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 23:38:02,867 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 23:38:02,872 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 23:38:03,041 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 23:38:03,063 INFO L193 MainTranslator]: Completed translation [2018-10-24 23:38:03,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:38:03 WrapperNode [2018-10-24 23:38:03,064 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 23:38:03,065 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 23:38:03,065 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 23:38:03,065 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 23:38:03,074 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:38:03" (1/1) ... [2018-10-24 23:38:03,109 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:38:03" (1/1) ... [2018-10-24 23:38:03,278 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 23:38:03,278 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 23:38:03,278 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 23:38:03,279 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 23:38:03,290 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:38:03" (1/1) ... [2018-10-24 23:38:03,290 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:38:03" (1/1) ... [2018-10-24 23:38:03,299 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:38:03" (1/1) ... [2018-10-24 23:38:03,300 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:38:03" (1/1) ... [2018-10-24 23:38:03,347 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:38:03" (1/1) ... [2018-10-24 23:38:03,372 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:38:03" (1/1) ... [2018-10-24 23:38:03,388 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:38:03" (1/1) ... [2018-10-24 23:38:03,409 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 23:38:03,410 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 23:38:03,410 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 23:38:03,410 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 23:38:03,413 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:38:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 23:38:03,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-24 23:38:03,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-24 23:38:03,491 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-24 23:38:03,491 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-24 23:38:03,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 23:38:03,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 23:38:03,492 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-24 23:38:03,492 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-24 23:38:07,080 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 23:38:07,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:38:07 BoogieIcfgContainer [2018-10-24 23:38:07,085 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 23:38:07,087 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 23:38:07,087 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 23:38:07,091 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 23:38:07,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:38:02" (1/3) ... [2018-10-24 23:38:07,095 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62104a5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:38:07, skipping insertion in model container [2018-10-24 23:38:07,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:38:03" (2/3) ... [2018-10-24 23:38:07,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62104a5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:38:07, skipping insertion in model container [2018-10-24 23:38:07,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:38:07" (3/3) ... [2018-10-24 23:38:07,099 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label28_false-unreach-call_false-termination.c [2018-10-24 23:38:07,110 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 23:38:07,125 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 23:38:07,145 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 23:38:07,205 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 23:38:07,206 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 23:38:07,206 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 23:38:07,206 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 23:38:07,206 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 23:38:07,207 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 23:38:07,207 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 23:38:07,207 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 23:38:07,250 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states. [2018-10-24 23:38:07,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-24 23:38:07,259 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:38:07,261 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:38:07,265 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:38:07,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:38:07,274 INFO L82 PathProgramCache]: Analyzing trace with hash 2018061625, now seen corresponding path program 1 times [2018-10-24 23:38:07,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:38:07,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:38:07,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:38:07,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:38:07,340 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:38:07,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:38:07,682 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 5 [2018-10-24 23:38:07,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:38:07,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:38:07,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 23:38:07,690 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:38:07,696 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 23:38:07,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 23:38:07,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 23:38:07,717 INFO L87 Difference]: Start difference. First operand 255 states. Second operand 4 states. [2018-10-24 23:38:10,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:38:10,865 INFO L93 Difference]: Finished difference Result 894 states and 1610 transitions. [2018-10-24 23:38:10,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 23:38:10,875 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-10-24 23:38:10,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:38:10,910 INFO L225 Difference]: With dead ends: 894 [2018-10-24 23:38:10,910 INFO L226 Difference]: Without dead ends: 633 [2018-10-24 23:38:10,918 INFO L605 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-10-24 23:38:10,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2018-10-24 23:38:11,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 434. [2018-10-24 23:38:11,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-10-24 23:38:11,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 662 transitions. [2018-10-24 23:38:11,015 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 662 transitions. Word has length 17 [2018-10-24 23:38:11,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:38:11,016 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 662 transitions. [2018-10-24 23:38:11,016 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 23:38:11,016 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 662 transitions. [2018-10-24 23:38:11,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-10-24 23:38:11,022 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:38:11,022 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 23:38:11,023 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:38:11,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:38:11,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1257410928, now seen corresponding path program 1 times [2018-10-24 23:38:11,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:38:11,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:38:11,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:38:11,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:38:11,025 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:38:11,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:38:11,573 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:38:11,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:38:11,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 23:38:11,574 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:38:11,576 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:38:11,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:38:11,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:38:11,577 INFO L87 Difference]: Start difference. First operand 434 states and 662 transitions. Second operand 6 states. [2018-10-24 23:38:16,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:38:16,396 INFO L93 Difference]: Finished difference Result 1423 states and 2197 transitions. [2018-10-24 23:38:16,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-24 23:38:16,399 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2018-10-24 23:38:16,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:38:16,409 INFO L225 Difference]: With dead ends: 1423 [2018-10-24 23:38:16,409 INFO L226 Difference]: Without dead ends: 995 [2018-10-24 23:38:16,413 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-10-24 23:38:16,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2018-10-24 23:38:16,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 944. [2018-10-24 23:38:16,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 944 states. [2018-10-24 23:38:16,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1365 transitions. [2018-10-24 23:38:16,469 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1365 transitions. Word has length 101 [2018-10-24 23:38:16,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:38:16,470 INFO L481 AbstractCegarLoop]: Abstraction has 944 states and 1365 transitions. [2018-10-24 23:38:16,470 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 23:38:16,470 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1365 transitions. [2018-10-24 23:38:16,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-24 23:38:16,479 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:38:16,479 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:38:16,479 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:38:16,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:38:16,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1352215460, now seen corresponding path program 1 times [2018-10-24 23:38:16,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:38:16,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:38:16,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:38:16,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:38:16,481 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:38:16,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:38:16,639 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:38:16,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:38:16,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 23:38:16,639 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:38:16,640 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 23:38:16,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 23:38:16,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 23:38:16,641 INFO L87 Difference]: Start difference. First operand 944 states and 1365 transitions. Second operand 3 states. [2018-10-24 23:38:18,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:38:18,471 INFO L93 Difference]: Finished difference Result 2575 states and 3844 transitions. [2018-10-24 23:38:18,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 23:38:18,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2018-10-24 23:38:18,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:38:18,486 INFO L225 Difference]: With dead ends: 2575 [2018-10-24 23:38:18,486 INFO L226 Difference]: Without dead ends: 1637 [2018-10-24 23:38:18,493 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 23:38:18,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1637 states. [2018-10-24 23:38:18,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1637 to 1637. [2018-10-24 23:38:18,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1637 states. [2018-10-24 23:38:18,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1637 states to 1637 states and 2219 transitions. [2018-10-24 23:38:18,557 INFO L78 Accepts]: Start accepts. Automaton has 1637 states and 2219 transitions. Word has length 127 [2018-10-24 23:38:18,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:38:18,557 INFO L481 AbstractCegarLoop]: Abstraction has 1637 states and 2219 transitions. [2018-10-24 23:38:18,558 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 23:38:18,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1637 states and 2219 transitions. [2018-10-24 23:38:18,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-10-24 23:38:18,567 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:38:18,569 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:38:18,569 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:38:18,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:38:18,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1698418821, now seen corresponding path program 1 times [2018-10-24 23:38:18,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:38:18,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:38:18,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:38:18,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:38:18,571 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:38:18,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:38:18,844 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:38:18,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:38:18,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 23:38:18,845 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:38:18,846 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:38:18,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:38:18,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:38:18,846 INFO L87 Difference]: Start difference. First operand 1637 states and 2219 transitions. Second operand 6 states. [2018-10-24 23:38:20,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:38:20,450 INFO L93 Difference]: Finished difference Result 3871 states and 5463 transitions. [2018-10-24 23:38:20,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 23:38:20,451 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 158 [2018-10-24 23:38:20,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:38:20,470 INFO L225 Difference]: With dead ends: 3871 [2018-10-24 23:38:20,470 INFO L226 Difference]: Without dead ends: 2240 [2018-10-24 23:38:20,477 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-24 23:38:20,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2240 states. [2018-10-24 23:38:20,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2240 to 2206. [2018-10-24 23:38:20,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2206 states. [2018-10-24 23:38:20,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2206 states to 2206 states and 2933 transitions. [2018-10-24 23:38:20,552 INFO L78 Accepts]: Start accepts. Automaton has 2206 states and 2933 transitions. Word has length 158 [2018-10-24 23:38:20,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:38:20,553 INFO L481 AbstractCegarLoop]: Abstraction has 2206 states and 2933 transitions. [2018-10-24 23:38:20,554 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 23:38:20,554 INFO L276 IsEmpty]: Start isEmpty. Operand 2206 states and 2933 transitions. [2018-10-24 23:38:20,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-10-24 23:38:20,557 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:38:20,558 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 23:38:20,558 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:38:20,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:38:20,559 INFO L82 PathProgramCache]: Analyzing trace with hash 723896290, now seen corresponding path program 1 times [2018-10-24 23:38:20,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:38:20,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:38:20,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:38:20,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:38:20,560 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:38:20,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:38:21,045 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-24 23:38:21,256 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-24 23:38:21,480 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-24 23:38:21,729 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-10-24 23:38:22,143 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 102 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:38:22,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 23:38:22,143 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 23:38:22,145 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 187 with the following transitions: [2018-10-24 23:38:22,147 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [37], [39], [42], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [550], [551], [554], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-10-24 23:38:22,198 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 23:38:22,198 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 23:38:22,821 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 23:38:22,823 INFO L272 AbstractInterpreter]: Visited 93 different actions 179 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-10-24 23:38:22,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:38:22,855 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 23:38:23,553 INFO L232 lantSequenceWeakener]: Weakened 85 states. On average, predicates are now at 77.51% of their original sizes. [2018-10-24 23:38:23,553 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 23:38:24,022 INFO L413 sIntCurrentIteration]: We have 185 unified AI predicates [2018-10-24 23:38:24,022 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 23:38:24,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 23:38:24,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [12] total 25 [2018-10-24 23:38:24,024 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:38:24,025 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-24 23:38:24,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-24 23:38:24,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-10-24 23:38:24,026 INFO L87 Difference]: Start difference. First operand 2206 states and 2933 transitions. Second operand 15 states. [2018-10-24 23:39:33,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-24 23:39:33,210 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger: modulus not positive at java.math.BigInteger.mod(BigInteger.java:2458) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:154) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:100) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:78) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:78) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.handleAssumeStatement(NonrelationalStatementProcessor.java:363) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processStatement(NonrelationalStatementProcessor.java:160) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:142) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:128) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:362) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:353) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.applyInternally(CompoundDomainPostOperator.java:306) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:131) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.applyPost(TermConjunctEvaluator.java:305) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$4(TermConjunctEvaluator.java:178) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computeFixpoint(TermConjunctEvaluator.java:198) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$1(TermConjunctEvaluator.java:150) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computePost(TermConjunctEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormanCachedPostOperation.applyPost(PoormanCachedPostOperation.java:308) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.applyPost(PoormansAbstractPostOperator.java:217) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:119) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:537) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalTransitionWithValidState(AbsIntHoareTripleChecker.java:352) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalAbsInt(AbsIntHoareTripleChecker.java:249) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternal(AbsIntHoareTripleChecker.java:181) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:673) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:473) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-10-24 23:39:33,216 INFO L168 Benchmark]: Toolchain (without parser) took 90988.97 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 3.1 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2018-10-24 23:39:33,217 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-10-24 23:39:33,218 INFO L168 Benchmark]: CACSL2BoogieTranslator took 834.83 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 7.1 GB. [2018-10-24 23:39:33,218 INFO L168 Benchmark]: Boogie Procedure Inliner took 213.17 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 750.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -839.9 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. [2018-10-24 23:39:33,220 INFO L168 Benchmark]: Boogie Preprocessor took 131.23 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. [2018-10-24 23:39:33,220 INFO L168 Benchmark]: RCFGBuilder took 3675.75 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 116.4 MB). Peak memory consumption was 116.4 MB. Max. memory is 7.1 GB. [2018-10-24 23:39:33,221 INFO L168 Benchmark]: TraceAbstraction took 86128.20 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 3.1 GB in the end (delta: -963.2 MB). Peak memory consumption was 953.1 MB. Max. memory is 7.1 GB. [2018-10-24 23:39:33,227 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 834.83 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 213.17 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 750.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -839.9 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 131.23 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3675.75 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 116.4 MB). Peak memory consumption was 116.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 86128.20 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 3.1 GB in the end (delta: -963.2 MB). Peak memory consumption was 953.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger: modulus not positive de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger: modulus not positive: java.math.BigInteger.mod(BigInteger.java:2458) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...