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/Problem15_label40_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 23:41:08,107 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 23:41:08,109 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 23:41:08,121 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 23:41:08,121 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 23:41:08,122 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 23:41:08,124 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 23:41:08,126 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 23:41:08,127 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 23:41:08,128 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 23:41:08,129 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 23:41:08,129 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 23:41:08,130 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 23:41:08,131 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 23:41:08,132 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 23:41:08,133 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 23:41:08,134 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 23:41:08,136 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 23:41:08,138 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 23:41:08,139 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 23:41:08,140 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 23:41:08,141 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 23:41:08,144 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 23:41:08,144 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 23:41:08,144 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 23:41:08,145 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 23:41:08,146 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 23:41:08,147 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 23:41:08,148 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 23:41:08,149 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 23:41:08,149 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 23:41:08,150 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 23:41:08,150 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 23:41:08,151 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 23:41:08,152 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 23:41:08,152 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 23:41:08,153 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:41:08,168 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 23:41:08,168 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 23:41:08,169 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 23:41:08,169 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-24 23:41:08,170 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-24 23:41:08,170 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-24 23:41:08,170 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-24 23:41:08,170 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-24 23:41:08,171 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-24 23:41:08,171 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-24 23:41:08,171 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-24 23:41:08,171 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-24 23:41:08,171 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-24 23:41:08,171 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-24 23:41:08,172 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 23:41:08,172 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 23:41:08,172 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 23:41:08,173 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 23:41:08,173 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 23:41:08,173 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 23:41:08,173 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 23:41:08,173 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 23:41:08,174 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 23:41:08,174 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 23:41:08,174 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 23:41:08,174 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 23:41:08,174 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 23:41:08,175 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 23:41:08,175 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 23:41:08,175 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 23:41:08,175 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-24 23:41:08,175 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 23:41:08,176 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 23:41:08,176 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 23:41:08,176 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 23:41:08,176 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-24 23:41:08,219 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 23:41:08,232 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 23:41:08,236 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 23:41:08,238 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 23:41:08,238 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 23:41:08,239 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem15_label40_false-unreach-call.c [2018-10-24 23:41:08,302 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/999651aef/d7984642b9964cecbd0ae206235d72b1/FLAG63dbe6701 [2018-10-24 23:41:08,982 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 23:41:08,983 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem15_label40_false-unreach-call.c [2018-10-24 23:41:09,002 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/999651aef/d7984642b9964cecbd0ae206235d72b1/FLAG63dbe6701 [2018-10-24 23:41:09,017 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/999651aef/d7984642b9964cecbd0ae206235d72b1 [2018-10-24 23:41:09,029 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 23:41:09,030 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 23:41:09,032 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 23:41:09,032 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 23:41:09,036 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 23:41:09,037 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:41:09" (1/1) ... [2018-10-24 23:41:09,040 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e2b640d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:41:09, skipping insertion in model container [2018-10-24 23:41:09,041 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:41:09" (1/1) ... [2018-10-24 23:41:09,050 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 23:41:09,143 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 23:41:09,905 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 23:41:09,910 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 23:41:10,238 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 23:41:10,262 INFO L193 MainTranslator]: Completed translation [2018-10-24 23:41:10,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:41:10 WrapperNode [2018-10-24 23:41:10,263 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 23:41:10,264 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 23:41:10,265 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 23:41:10,265 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 23:41:10,275 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:41:10" (1/1) ... [2018-10-24 23:41:10,330 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:41:10" (1/1) ... [2018-10-24 23:41:10,659 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 23:41:10,660 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 23:41:10,660 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 23:41:10,660 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 23:41:10,672 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:41:10" (1/1) ... [2018-10-24 23:41:10,672 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:41:10" (1/1) ... [2018-10-24 23:41:10,690 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:41:10" (1/1) ... [2018-10-24 23:41:10,691 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:41:10" (1/1) ... [2018-10-24 23:41:10,780 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:41:10" (1/1) ... [2018-10-24 23:41:10,812 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:41:10" (1/1) ... [2018-10-24 23:41:10,848 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:41:10" (1/1) ... [2018-10-24 23:41:10,890 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 23:41:10,890 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 23:41:10,891 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 23:41:10,891 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 23:41:10,892 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:41:10" (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:41:10,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-24 23:41:10,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-24 23:41:10,965 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-24 23:41:10,965 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-24 23:41:10,965 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-24 23:41:10,965 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-24 23:41:10,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 23:41:10,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 23:41:10,967 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-24 23:41:10,967 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-24 23:41:18,068 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 23:41:18,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:41:18 BoogieIcfgContainer [2018-10-24 23:41:18,069 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 23:41:18,070 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 23:41:18,070 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 23:41:18,076 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 23:41:18,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:41:09" (1/3) ... [2018-10-24 23:41:18,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b496964 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:41:18, skipping insertion in model container [2018-10-24 23:41:18,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:41:10" (2/3) ... [2018-10-24 23:41:18,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b496964 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:41:18, skipping insertion in model container [2018-10-24 23:41:18,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:41:18" (3/3) ... [2018-10-24 23:41:18,080 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label40_false-unreach-call.c [2018-10-24 23:41:18,090 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 23:41:18,099 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 23:41:18,117 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 23:41:18,159 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 23:41:18,159 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 23:41:18,159 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 23:41:18,160 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 23:41:18,160 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 23:41:18,160 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 23:41:18,160 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 23:41:18,160 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 23:41:18,192 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states. [2018-10-24 23:41:18,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-24 23:41:18,201 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:41:18,202 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:41:18,204 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:41:18,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:41:18,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1913996417, now seen corresponding path program 1 times [2018-10-24 23:41:18,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:41:18,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:41:18,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:41:18,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:41:18,270 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:41:18,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:41:18,720 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 5 [2018-10-24 23:41:18,731 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:41:18,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:41:18,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 23:41:18,734 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:41:18,741 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 23:41:18,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 23:41:18,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 23:41:18,762 INFO L87 Difference]: Start difference. First operand 438 states. Second operand 4 states. [2018-10-24 23:41:25,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:41:25,183 INFO L93 Difference]: Finished difference Result 1501 states and 2761 transitions. [2018-10-24 23:41:25,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 23:41:25,185 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-10-24 23:41:25,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:41:25,215 INFO L225 Difference]: With dead ends: 1501 [2018-10-24 23:41:25,216 INFO L226 Difference]: Without dead ends: 1057 [2018-10-24 23:41:25,227 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:41:25,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2018-10-24 23:41:25,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 744. [2018-10-24 23:41:25,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2018-10-24 23:41:25,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1125 transitions. [2018-10-24 23:41:25,337 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1125 transitions. Word has length 33 [2018-10-24 23:41:25,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:41:25,337 INFO L481 AbstractCegarLoop]: Abstraction has 744 states and 1125 transitions. [2018-10-24 23:41:25,338 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 23:41:25,338 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1125 transitions. [2018-10-24 23:41:25,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-24 23:41:25,344 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:41:25,344 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:25,345 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:41:25,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:41:25,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1976109109, now seen corresponding path program 1 times [2018-10-24 23:41:25,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:41:25,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:41:25,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:41:25,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:41:25,349 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:41:25,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:41:25,713 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:41:25,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:41:25,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 23:41:25,714 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:41:25,716 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 23:41:25,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 23:41:25,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-24 23:41:25,717 INFO L87 Difference]: Start difference. First operand 744 states and 1125 transitions. Second operand 5 states. [2018-10-24 23:41:42,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:41:42,564 INFO L93 Difference]: Finished difference Result 2390 states and 3583 transitions. [2018-10-24 23:41:42,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 23:41:42,565 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2018-10-24 23:41:42,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:41:42,581 INFO L225 Difference]: With dead ends: 2390 [2018-10-24 23:41:42,583 INFO L226 Difference]: Without dead ends: 1652 [2018-10-24 23:41:42,589 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-24 23:41:42,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1652 states. [2018-10-24 23:41:42,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1652 to 1644. [2018-10-24 23:41:42,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1644 states. [2018-10-24 23:41:42,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1644 states to 1644 states and 2399 transitions. [2018-10-24 23:41:42,690 INFO L78 Accepts]: Start accepts. Automaton has 1644 states and 2399 transitions. Word has length 103 [2018-10-24 23:41:42,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:41:42,691 INFO L481 AbstractCegarLoop]: Abstraction has 1644 states and 2399 transitions. [2018-10-24 23:41:42,691 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 23:41:42,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1644 states and 2399 transitions. [2018-10-24 23:41:42,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-24 23:41:42,697 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:41:42,697 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:42,697 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:41:42,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:41:42,698 INFO L82 PathProgramCache]: Analyzing trace with hash -863823824, now seen corresponding path program 1 times [2018-10-24 23:41:42,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:41:42,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:41:42,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:41:42,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:41:42,700 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:41:42,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:41:43,002 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-24 23:41:43,084 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:41:43,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:41:43,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 23:41:43,085 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:41:43,086 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:41:43,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:41:43,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:41:43,087 INFO L87 Difference]: Start difference. First operand 1644 states and 2399 transitions. Second operand 6 states. [2018-10-24 23:41:49,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:41:49,946 INFO L93 Difference]: Finished difference Result 4245 states and 6731 transitions. [2018-10-24 23:41:49,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 23:41:49,950 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 108 [2018-10-24 23:41:49,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:41:49,971 INFO L225 Difference]: With dead ends: 4245 [2018-10-24 23:41:49,971 INFO L226 Difference]: Without dead ends: 2916 [2018-10-24 23:41:49,981 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-24 23:41:49,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2916 states. [2018-10-24 23:41:50,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2916 to 2869. [2018-10-24 23:41:50,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2869 states. [2018-10-24 23:41:50,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2869 states to 2869 states and 4001 transitions. [2018-10-24 23:41:50,078 INFO L78 Accepts]: Start accepts. Automaton has 2869 states and 4001 transitions. Word has length 108 [2018-10-24 23:41:50,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:41:50,078 INFO L481 AbstractCegarLoop]: Abstraction has 2869 states and 4001 transitions. [2018-10-24 23:41:50,079 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 23:41:50,079 INFO L276 IsEmpty]: Start isEmpty. Operand 2869 states and 4001 transitions. [2018-10-24 23:41:50,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-10-24 23:41:50,081 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:41:50,082 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:50,082 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:41:50,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:41:50,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1225473988, now seen corresponding path program 1 times [2018-10-24 23:41:50,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:41:50,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:41:50,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:41:50,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:41:50,084 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:41:50,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:41:50,214 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:41:50,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:41:50,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 23:41:50,215 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:41:50,216 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 23:41:50,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 23:41:50,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 23:41:50,216 INFO L87 Difference]: Start difference. First operand 2869 states and 4001 transitions. Second operand 4 states. [2018-10-24 23:41:55,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:41:55,996 INFO L93 Difference]: Finished difference Result 7280 states and 10700 transitions. [2018-10-24 23:41:55,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 23:41:55,996 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2018-10-24 23:41:55,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:41:56,022 INFO L225 Difference]: With dead ends: 7280 [2018-10-24 23:41:56,023 INFO L226 Difference]: Without dead ends: 4726 [2018-10-24 23:41:56,036 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:41:56,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4726 states. [2018-10-24 23:41:56,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4726 to 4723. [2018-10-24 23:41:56,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4723 states. [2018-10-24 23:41:56,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4723 states to 4723 states and 6423 transitions. [2018-10-24 23:41:56,164 INFO L78 Accepts]: Start accepts. Automaton has 4723 states and 6423 transitions. Word has length 114 [2018-10-24 23:41:56,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:41:56,165 INFO L481 AbstractCegarLoop]: Abstraction has 4723 states and 6423 transitions. [2018-10-24 23:41:56,165 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 23:41:56,165 INFO L276 IsEmpty]: Start isEmpty. Operand 4723 states and 6423 transitions. [2018-10-24 23:41:56,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-10-24 23:41:56,174 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:41:56,174 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:56,178 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:41:56,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:41:56,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1496606729, now seen corresponding path program 1 times [2018-10-24 23:41:56,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:41:56,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:41:56,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:41:56,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:41:56,180 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:41:56,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:41:56,826 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:41:56,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 23:41:56,826 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 23:41:56,827 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 130 with the following transitions: [2018-10-24 23:41:56,830 INFO L202 CegarAbsIntRunner]: [0], [1], [74], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [237], [239], [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], [498], [506], [514], [522], [530], [538], [546], [554], [562], [567], [571], [582], [586], [590], [594], [598], [602], [606], [610], [614], [618], [622], [626], [630], [641], [645], [649], [653], [657], [668], [672], [676], [680], [684], [688], [691], [1635], [1639], [1643], [1649], [1653], [1655], [1662], [1663], [1664], [1666], [1667] [2018-10-24 23:41:56,892 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 23:41:56,892 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 23:41:57,729 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 23:41:57,731 INFO L272 AbstractInterpreter]: Visited 104 different actions 298 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-10-24 23:41:57,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:41:57,778 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 23:41:57,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 23:41:57,779 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 23:41:57,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:41:57,796 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 23:41:57,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:41:57,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 23:41:58,100 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:41:58,101 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 23:41:58,806 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:41:58,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-10-24 23:41:58,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 11 [2018-10-24 23:41:58,845 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:41:58,846 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:41:58,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:41:58,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-10-24 23:41:58,847 INFO L87 Difference]: Start difference. First operand 4723 states and 6423 transitions. Second operand 6 states. [2018-10-24 23:42:08,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:42:08,419 INFO L93 Difference]: Finished difference Result 15667 states and 22515 transitions. [2018-10-24 23:42:08,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 23:42:08,419 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 129 [2018-10-24 23:42:08,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:42:08,484 INFO L225 Difference]: With dead ends: 15667 [2018-10-24 23:42:08,484 INFO L226 Difference]: Without dead ends: 11259 [2018-10-24 23:42:08,522 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 256 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-10-24 23:42:08,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11259 states. [2018-10-24 23:42:08,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11259 to 11208. [2018-10-24 23:42:08,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11208 states. [2018-10-24 23:42:08,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11208 states to 11208 states and 15424 transitions. [2018-10-24 23:42:08,947 INFO L78 Accepts]: Start accepts. Automaton has 11208 states and 15424 transitions. Word has length 129 [2018-10-24 23:42:08,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:42:08,948 INFO L481 AbstractCegarLoop]: Abstraction has 11208 states and 15424 transitions. [2018-10-24 23:42:08,948 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 23:42:08,948 INFO L276 IsEmpty]: Start isEmpty. Operand 11208 states and 15424 transitions. [2018-10-24 23:42:08,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-24 23:42:08,957 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:42:08,958 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 23:42:08,958 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:42:08,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:42:08,959 INFO L82 PathProgramCache]: Analyzing trace with hash -108935395, now seen corresponding path program 1 times [2018-10-24 23:42:08,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:42:08,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:42:08,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:42:08,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:42:08,960 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:42:08,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:42:09,546 WARN L179 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 12 [2018-10-24 23:42:09,926 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-24 23:42:10,121 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-24 23:42:10,202 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 52 proven. 74 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-24 23:42:10,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 23:42:10,203 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 23:42:10,203 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 194 with the following transitions: [2018-10-24 23:42:10,203 INFO L202 CegarAbsIntRunner]: [0], [1], [74], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [237], [239], [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], [498], [506], [514], [522], [530], [538], [546], [554], [562], [567], [571], [582], [586], [590], [594], [598], [602], [606], [609], [610], [614], [617], [1635], [1639], [1643], [1649], [1653], [1655], [1662], [1663], [1664], [1666], [1667] [2018-10-24 23:42:10,214 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 23:42:10,214 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 23:42:10,334 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 23:42:10,335 INFO L272 AbstractInterpreter]: Visited 86 different actions 86 times. Never merged. Never widened. Never found a fixpoint. Largest state had 24 variables. [2018-10-24 23:42:10,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:42:10,375 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 23:42:10,764 INFO L232 lantSequenceWeakener]: Weakened 184 states. On average, predicates are now at 77.69% of their original sizes. [2018-10-24 23:42:10,764 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 23:42:11,034 INFO L413 sIntCurrentIteration]: We have 192 unified AI predicates [2018-10-24 23:42:11,035 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 23:42:11,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 23:42:11,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-10-24 23:42:11,036 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:42:11,037 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:42:11,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:42:11,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:42:11,037 INFO L87 Difference]: Start difference. First operand 11208 states and 15424 transitions. Second operand 6 states. [2018-10-24 23:42:20,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 23:42:20,656 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.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:42:20,662 INFO L168 Benchmark]: Toolchain (without parser) took 71633.21 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.6 GB). Free memory was 1.4 GB in the beginning and 2.6 GB in the end (delta: -1.2 GB). Peak memory consumption was 413.3 MB. Max. memory is 7.1 GB. [2018-10-24 23:42:20,664 INFO L168 Benchmark]: CDTParser took 0.20 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:42:20,664 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1231.57 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 105.7 MB). Peak memory consumption was 105.7 MB. Max. memory is 7.1 GB. [2018-10-24 23:42:20,665 INFO L168 Benchmark]: Boogie Procedure Inliner took 394.95 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 771.8 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -889.4 MB). Peak memory consumption was 33.3 MB. Max. memory is 7.1 GB. [2018-10-24 23:42:20,666 INFO L168 Benchmark]: Boogie Preprocessor took 230.41 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: 27.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 7.1 GB. [2018-10-24 23:42:20,667 INFO L168 Benchmark]: RCFGBuilder took 7178.58 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 310.7 MB). Peak memory consumption was 310.7 MB. Max. memory is 7.1 GB. [2018-10-24 23:42:20,668 INFO L168 Benchmark]: TraceAbstraction took 62591.64 ms. Allocated memory was 2.3 GB in the beginning and 3.1 GB in the end (delta: 803.7 MB). Free memory was 1.9 GB in the beginning and 2.6 GB in the end (delta: -716.6 MB). Peak memory consumption was 87.2 MB. Max. memory is 7.1 GB. [2018-10-24 23:42:20,674 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.20 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 1231.57 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 105.7 MB). Peak memory consumption was 105.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 394.95 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 771.8 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -889.4 MB). Peak memory consumption was 33.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 230.41 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: 27.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 7178.58 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 310.7 MB). Peak memory consumption was 310.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 62591.64 ms. Allocated memory was 2.3 GB in the beginning and 3.1 GB in the end (delta: 803.7 MB). Free memory was 1.9 GB in the beginning and 2.6 GB in the end (delta: -716.6 MB). Peak memory consumption was 87.2 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...