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_label22_false-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 23:37:55,349 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 23:37:55,351 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 23:37:55,363 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 23:37:55,364 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 23:37:55,365 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 23:37:55,366 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 23:37:55,368 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 23:37:55,370 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 23:37:55,370 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 23:37:55,371 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 23:37:55,372 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 23:37:55,373 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 23:37:55,374 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 23:37:55,375 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 23:37:55,376 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 23:37:55,377 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 23:37:55,378 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 23:37:55,380 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 23:37:55,382 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 23:37:55,383 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 23:37:55,385 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 23:37:55,387 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 23:37:55,387 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 23:37:55,388 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 23:37:55,389 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 23:37:55,390 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 23:37:55,391 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 23:37:55,391 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 23:37:55,393 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 23:37:55,393 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 23:37:55,394 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 23:37:55,394 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 23:37:55,394 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 23:37:55,395 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 23:37:55,396 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 23:37:55,396 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:37:55,412 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 23:37:55,412 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 23:37:55,413 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 23:37:55,413 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-24 23:37:55,413 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-24 23:37:55,413 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-24 23:37:55,414 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-24 23:37:55,414 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-24 23:37:55,414 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-24 23:37:55,414 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-24 23:37:55,414 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-24 23:37:55,414 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-24 23:37:55,415 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-24 23:37:55,415 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-24 23:37:55,416 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 23:37:55,416 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 23:37:55,416 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 23:37:55,416 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 23:37:55,416 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 23:37:55,416 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 23:37:55,417 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 23:37:55,417 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 23:37:55,417 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 23:37:55,417 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 23:37:55,417 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 23:37:55,418 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 23:37:55,418 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 23:37:55,418 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 23:37:55,418 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 23:37:55,418 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 23:37:55,419 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-24 23:37:55,419 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 23:37:55,419 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 23:37:55,419 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 23:37:55,419 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 23:37:55,419 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-24 23:37:55,464 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 23:37:55,475 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 23:37:55,479 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 23:37:55,480 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 23:37:55,481 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 23:37:55,481 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label22_false-unreach-call_false-termination.c [2018-10-24 23:37:55,541 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/d5b8683bb/b8c4a74e527140999a73ae621299de5a/FLAGacae25173 [2018-10-24 23:37:56,110 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 23:37:56,110 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label22_false-unreach-call_false-termination.c [2018-10-24 23:37:56,128 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/d5b8683bb/b8c4a74e527140999a73ae621299de5a/FLAGacae25173 [2018-10-24 23:37:56,147 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/d5b8683bb/b8c4a74e527140999a73ae621299de5a [2018-10-24 23:37:56,160 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 23:37:56,163 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 23:37:56,164 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 23:37:56,164 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 23:37:56,172 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 23:37:56,173 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:37:56" (1/1) ... [2018-10-24 23:37:56,178 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9d4514e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:37:56, skipping insertion in model container [2018-10-24 23:37:56,178 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:37:56" (1/1) ... [2018-10-24 23:37:56,189 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 23:37:56,273 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 23:37:56,795 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 23:37:56,800 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 23:37:56,960 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 23:37:56,977 INFO L193 MainTranslator]: Completed translation [2018-10-24 23:37:56,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:37:56 WrapperNode [2018-10-24 23:37:56,978 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 23:37:56,979 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 23:37:56,979 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 23:37:56,980 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 23:37:56,989 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:37:56" (1/1) ... [2018-10-24 23:37:57,012 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:37:56" (1/1) ... [2018-10-24 23:37:57,197 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 23:37:57,198 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 23:37:57,198 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 23:37:57,198 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 23:37:57,209 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:37:56" (1/1) ... [2018-10-24 23:37:57,209 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:37:56" (1/1) ... [2018-10-24 23:37:57,216 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:37:56" (1/1) ... [2018-10-24 23:37:57,216 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:37:56" (1/1) ... [2018-10-24 23:37:57,258 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:37:56" (1/1) ... [2018-10-24 23:37:57,274 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:37:56" (1/1) ... [2018-10-24 23:37:57,293 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:37:56" (1/1) ... [2018-10-24 23:37:57,301 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 23:37:57,302 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 23:37:57,302 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 23:37:57,302 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 23:37:57,303 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:37:56" (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:37:57,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-24 23:37:57,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-24 23:37:57,372 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-24 23:37:57,373 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-24 23:37:57,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 23:37:57,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 23:37:57,373 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-24 23:37:57,373 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-24 23:38:00,981 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 23:38:00,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:38:00 BoogieIcfgContainer [2018-10-24 23:38:00,982 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 23:38:00,983 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 23:38:00,983 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 23:38:00,986 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 23:38:00,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:37:56" (1/3) ... [2018-10-24 23:38:00,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79f8351 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:38:00, skipping insertion in model container [2018-10-24 23:38:00,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:37:56" (2/3) ... [2018-10-24 23:38:00,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79f8351 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:38:00, skipping insertion in model container [2018-10-24 23:38:00,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:38:00" (3/3) ... [2018-10-24 23:38:00,990 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label22_false-unreach-call_false-termination.c [2018-10-24 23:38:01,000 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 23:38:01,008 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 23:38:01,025 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 23:38:01,065 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 23:38:01,065 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 23:38:01,065 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 23:38:01,065 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 23:38:01,065 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 23:38:01,066 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 23:38:01,066 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 23:38:01,066 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 23:38:01,096 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states. [2018-10-24 23:38:01,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-24 23:38:01,103 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:38:01,104 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] [2018-10-24 23:38:01,107 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:38:01,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:38:01,115 INFO L82 PathProgramCache]: Analyzing trace with hash -874290308, now seen corresponding path program 1 times [2018-10-24 23:38:01,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:38:01,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:38:01,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:38:01,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:38:01,170 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:38:01,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:38:01,523 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-24 23:38:01,632 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:01,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:38:01,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 23:38:01,636 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:38:01,642 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 23:38:01,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 23:38:01,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 23:38:01,662 INFO L87 Difference]: Start difference. First operand 255 states. Second operand 3 states. [2018-10-24 23:38:03,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:38:03,649 INFO L93 Difference]: Finished difference Result 691 states and 1226 transitions. [2018-10-24 23:38:03,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 23:38:03,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-10-24 23:38:03,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:38:03,675 INFO L225 Difference]: With dead ends: 691 [2018-10-24 23:38:03,676 INFO L226 Difference]: Without dead ends: 434 [2018-10-24 23:38:03,684 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 23:38:03,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-10-24 23:38:03,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2018-10-24 23:38:03,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-10-24 23:38:03,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 765 transitions. [2018-10-24 23:38:03,766 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 765 transitions. Word has length 20 [2018-10-24 23:38:03,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:38:03,767 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 765 transitions. [2018-10-24 23:38:03,767 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 23:38:03,767 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 765 transitions. [2018-10-24 23:38:03,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-24 23:38:03,773 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:38:03,773 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:38:03,773 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:38:03,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:38:03,774 INFO L82 PathProgramCache]: Analyzing trace with hash 473181535, now seen corresponding path program 1 times [2018-10-24 23:38:03,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:38:03,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:38:03,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:38:03,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:38:03,776 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:38:03,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:38:04,047 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:38:04,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:38:04,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 23:38:04,048 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:38:04,050 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:38:04,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:38:04,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:38:04,051 INFO L87 Difference]: Start difference. First operand 434 states and 765 transitions. Second operand 6 states. [2018-10-24 23:38:06,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:38:06,108 INFO L93 Difference]: Finished difference Result 1062 states and 1897 transitions. [2018-10-24 23:38:06,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 23:38:06,111 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2018-10-24 23:38:06,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:38:06,118 INFO L225 Difference]: With dead ends: 1062 [2018-10-24 23:38:06,118 INFO L226 Difference]: Without dead ends: 634 [2018-10-24 23:38:06,120 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:06,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2018-10-24 23:38:06,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 625. [2018-10-24 23:38:06,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 625 states. [2018-10-24 23:38:06,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 1019 transitions. [2018-10-24 23:38:06,165 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 1019 transitions. Word has length 95 [2018-10-24 23:38:06,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:38:06,165 INFO L481 AbstractCegarLoop]: Abstraction has 625 states and 1019 transitions. [2018-10-24 23:38:06,166 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 23:38:06,166 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 1019 transitions. [2018-10-24 23:38:06,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-24 23:38:06,173 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:38:06,173 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:38:06,173 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:38:06,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:38:06,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1939267164, now seen corresponding path program 1 times [2018-10-24 23:38:06,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:38:06,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:38:06,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:38:06,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:38:06,178 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:38:06,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:38:06,374 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:38:06,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:38:06,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 23:38:06,375 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:38:06,378 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 23:38:06,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 23:38:06,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 23:38:06,379 INFO L87 Difference]: Start difference. First operand 625 states and 1019 transitions. Second operand 4 states. [2018-10-24 23:38:10,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:38:10,363 INFO L93 Difference]: Finished difference Result 2350 states and 4011 transitions. [2018-10-24 23:38:10,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 23:38:10,366 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2018-10-24 23:38:10,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:38:10,384 INFO L225 Difference]: With dead ends: 2350 [2018-10-24 23:38:10,384 INFO L226 Difference]: Without dead ends: 1731 [2018-10-24 23:38:10,390 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 23:38:10,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1731 states. [2018-10-24 23:38:10,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1731 to 1731. [2018-10-24 23:38:10,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1731 states. [2018-10-24 23:38:10,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1731 states to 1731 states and 2640 transitions. [2018-10-24 23:38:10,477 INFO L78 Accepts]: Start accepts. Automaton has 1731 states and 2640 transitions. Word has length 104 [2018-10-24 23:38:10,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:38:10,478 INFO L481 AbstractCegarLoop]: Abstraction has 1731 states and 2640 transitions. [2018-10-24 23:38:10,478 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 23:38:10,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1731 states and 2640 transitions. [2018-10-24 23:38:10,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-10-24 23:38:10,501 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:38:10,501 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 23:38:10,502 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:38:10,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:38:10,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1125198180, now seen corresponding path program 1 times [2018-10-24 23:38:10,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:38:10,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:38:10,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:38:10,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:38:10,503 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:38:10,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:38:10,816 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-10-24 23:38:10,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:38:10,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 23:38:10,817 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:38:10,818 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 23:38:10,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 23:38:10,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 23:38:10,818 INFO L87 Difference]: Start difference. First operand 1731 states and 2640 transitions. Second operand 3 states. [2018-10-24 23:38:12,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:38:12,236 INFO L93 Difference]: Finished difference Result 4928 states and 7680 transitions. [2018-10-24 23:38:12,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 23:38:12,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 214 [2018-10-24 23:38:12,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:38:12,269 INFO L225 Difference]: With dead ends: 4928 [2018-10-24 23:38:12,269 INFO L226 Difference]: Without dead ends: 3203 [2018-10-24 23:38:12,292 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 23:38:12,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3203 states. [2018-10-24 23:38:12,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3203 to 3203. [2018-10-24 23:38:12,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3203 states. [2018-10-24 23:38:12,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3203 states to 3203 states and 4752 transitions. [2018-10-24 23:38:12,415 INFO L78 Accepts]: Start accepts. Automaton has 3203 states and 4752 transitions. Word has length 214 [2018-10-24 23:38:12,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:38:12,416 INFO L481 AbstractCegarLoop]: Abstraction has 3203 states and 4752 transitions. [2018-10-24 23:38:12,416 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 23:38:12,416 INFO L276 IsEmpty]: Start isEmpty. Operand 3203 states and 4752 transitions. [2018-10-24 23:38:12,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-10-24 23:38:12,429 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:38:12,430 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10-24 23:38:12,430 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:38:12,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:38:12,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1192909764, now seen corresponding path program 1 times [2018-10-24 23:38:12,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:38:12,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:38:12,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:38:12,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:38:12,432 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:38:12,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:38:12,982 WARN L179 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 10 [2018-10-24 23:38:13,676 WARN L179 SmtUtils]: Spent 618.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 18 [2018-10-24 23:38:13,917 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-10-24 23:38:14,577 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 117 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:38:14,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 23:38:14,578 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 23:38:14,579 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 227 with the following transitions: [2018-10-24 23:38:14,582 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [61], [63], [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], [551], [555], [559], [563], [567], [571], [575], [579], [583], [586], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [666], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-10-24 23:38:14,639 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 23:38:14,639 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 23:38:19,220 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 23:38:19,222 INFO L272 AbstractInterpreter]: Visited 118 different actions 118 times. Never merged. Never widened. Never found a fixpoint. Largest state had 24 variables. [2018-10-24 23:38:19,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:38:19,233 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 23:38:23,107 INFO L232 lantSequenceWeakener]: Weakened 217 states. On average, predicates are now at 77.35% of their original sizes. [2018-10-24 23:38:23,109 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 23:38:23,358 INFO L413 sIntCurrentIteration]: We have 225 unified AI predicates [2018-10-24 23:38:23,358 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 23:38:23,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 23:38:23,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2018-10-24 23:38:23,359 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:38:23,360 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:38:23,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:38:23,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:38:23,361 INFO L87 Difference]: Start difference. First operand 3203 states and 4752 transitions. Second operand 6 states. [2018-10-24 23:38:57,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 23:38:57,163 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:38:57,169 INFO L168 Benchmark]: Toolchain (without parser) took 61007.06 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 4.0 GB in the end (delta: -2.6 GB). Peak memory consumption was 69.8 MB. Max. memory is 7.1 GB. [2018-10-24 23:38:57,170 INFO L168 Benchmark]: CDTParser took 0.22 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:38:57,171 INFO L168 Benchmark]: CACSL2BoogieTranslator took 814.76 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-10-24 23:38:57,172 INFO L168 Benchmark]: Boogie Procedure Inliner took 218.34 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 749.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -837.8 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2018-10-24 23:38:57,173 INFO L168 Benchmark]: Boogie Preprocessor took 103.45 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.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2018-10-24 23:38:57,173 INFO L168 Benchmark]: RCFGBuilder took 3680.44 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: 132.7 MB). Peak memory consumption was 132.7 MB. Max. memory is 7.1 GB. [2018-10-24 23:38:57,174 INFO L168 Benchmark]: TraceAbstraction took 56184.71 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 4.0 GB in the end (delta: -1.9 GB). There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 23:38:57,180 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.22 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 814.76 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 218.34 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 749.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -837.8 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 103.45 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.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3680.44 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: 132.7 MB). Peak memory consumption was 132.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 56184.71 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 4.0 GB in the end (delta: -1.9 GB). There was no memory consumed. 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...