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_label19_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 01:45:48,123 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 01:45:48,124 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 01:45:48,137 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 01:45:48,137 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 01:45:48,138 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 01:45:48,140 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 01:45:48,142 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 01:45:48,145 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 01:45:48,147 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 01:45:48,148 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 01:45:48,149 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 01:45:48,153 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 01:45:48,156 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 01:45:48,157 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 01:45:48,162 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 01:45:48,163 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 01:45:48,166 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 01:45:48,170 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 01:45:48,174 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 01:45:48,176 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 01:45:48,178 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 01:45:48,182 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 01:45:48,183 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 01:45:48,183 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 01:45:48,184 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 01:45:48,185 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 01:45:48,185 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 01:45:48,186 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 01:45:48,187 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 01:45:48,187 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 01:45:48,188 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 01:45:48,188 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 01:45:48,188 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 01:45:48,189 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 01:45:48,189 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 01:45:48,190 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-25 01:45:48,205 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 01:45:48,205 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 01:45:48,206 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 01:45:48,206 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 01:45:48,206 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 01:45:48,207 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 01:45:48,207 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 01:45:48,207 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 01:45:48,207 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 01:45:48,207 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 01:45:48,207 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 01:45:48,208 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 01:45:48,209 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 01:45:48,209 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 01:45:48,210 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 01:45:48,210 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 01:45:48,210 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 01:45:48,210 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 01:45:48,210 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 01:45:48,212 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 01:45:48,212 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 01:45:48,212 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 01:45:48,212 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 01:45:48,213 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 01:45:48,213 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 01:45:48,213 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 01:45:48,213 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 01:45:48,213 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 01:45:48,214 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 01:45:48,215 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 01:45:48,215 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 01:45:48,215 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 01:45:48,215 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 01:45:48,215 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 01:45:48,216 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 01:45:48,216 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 01:45:48,291 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 01:45:48,306 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 01:45:48,312 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 01:45:48,313 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 01:45:48,314 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 01:45:48,314 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label19_true-unreach-call_false-termination.c [2018-10-25 01:45:48,382 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/cb277f844/2f6042fb0c424e90a168810fbd1fc0f7/FLAG00034f5a0 [2018-10-25 01:45:49,022 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 01:45:49,023 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label19_true-unreach-call_false-termination.c [2018-10-25 01:45:49,040 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/cb277f844/2f6042fb0c424e90a168810fbd1fc0f7/FLAG00034f5a0 [2018-10-25 01:45:49,074 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/cb277f844/2f6042fb0c424e90a168810fbd1fc0f7 [2018-10-25 01:45:49,087 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 01:45:49,089 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 01:45:49,090 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 01:45:49,090 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 01:45:49,094 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 01:45:49,095 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:45:49" (1/1) ... [2018-10-25 01:45:49,097 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11290b0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:45:49, skipping insertion in model container [2018-10-25 01:45:49,098 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:45:49" (1/1) ... [2018-10-25 01:45:49,108 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 01:45:49,184 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 01:45:49,664 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:45:49,669 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 01:45:49,840 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:45:49,860 INFO L193 MainTranslator]: Completed translation [2018-10-25 01:45:49,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:45:49 WrapperNode [2018-10-25 01:45:49,861 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 01:45:49,862 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 01:45:49,862 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 01:45:49,862 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 01:45:49,870 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:45:49" (1/1) ... [2018-10-25 01:45:49,894 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:45:49" (1/1) ... [2018-10-25 01:45:50,082 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 01:45:50,082 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 01:45:50,082 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 01:45:50,083 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 01:45:50,095 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:45:49" (1/1) ... [2018-10-25 01:45:50,096 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:45:49" (1/1) ... [2018-10-25 01:45:50,101 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:45:49" (1/1) ... [2018-10-25 01:45:50,102 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:45:49" (1/1) ... [2018-10-25 01:45:50,149 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:45:49" (1/1) ... [2018-10-25 01:45:50,178 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:45:49" (1/1) ... [2018-10-25 01:45:50,193 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:45:49" (1/1) ... [2018-10-25 01:45:50,208 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 01:45:50,209 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 01:45:50,209 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 01:45:50,209 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 01:45:50,210 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:45:49" (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-25 01:45:50,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 01:45:50,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 01:45:50,285 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 01:45:50,285 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 01:45:50,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 01:45:50,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 01:45:50,286 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 01:45:50,286 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 01:45:54,119 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 01:45:54,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:45:54 BoogieIcfgContainer [2018-10-25 01:45:54,121 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 01:45:54,122 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 01:45:54,122 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 01:45:54,126 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 01:45:54,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 01:45:49" (1/3) ... [2018-10-25 01:45:54,127 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6edb8343 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:45:54, skipping insertion in model container [2018-10-25 01:45:54,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:45:49" (2/3) ... [2018-10-25 01:45:54,128 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6edb8343 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:45:54, skipping insertion in model container [2018-10-25 01:45:54,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:45:54" (3/3) ... [2018-10-25 01:45:54,130 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label19_true-unreach-call_false-termination.c [2018-10-25 01:45:54,139 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 01:45:54,147 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 01:45:54,164 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 01:45:54,203 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 01:45:54,203 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 01:45:54,204 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 01:45:54,204 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 01:45:54,204 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 01:45:54,204 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 01:45:54,204 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 01:45:54,205 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 01:45:54,232 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states. [2018-10-25 01:45:54,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-10-25 01:45:54,244 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:45:54,245 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:45:54,247 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:45:54,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:45:54,253 INFO L82 PathProgramCache]: Analyzing trace with hash -949219895, now seen corresponding path program 1 times [2018-10-25 01:45:54,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:45:54,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:45:54,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:45:54,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:45:54,308 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:45:54,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:45:54,792 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:45:54,819 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-25 01:45:54,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:45:54,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 01:45:54,822 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:45:54,828 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 01:45:54,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 01:45:54,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 01:45:54,847 INFO L87 Difference]: Start difference. First operand 255 states. Second operand 3 states. [2018-10-25 01:45:56,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:45:56,388 INFO L93 Difference]: Finished difference Result 691 states and 1226 transitions. [2018-10-25 01:45:56,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 01:45:56,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-10-25 01:45:56,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:45:56,410 INFO L225 Difference]: With dead ends: 691 [2018-10-25 01:45:56,410 INFO L226 Difference]: Without dead ends: 434 [2018-10-25 01:45:56,421 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 01:45:56,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-10-25 01:45:56,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2018-10-25 01:45:56,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-10-25 01:45:56,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 772 transitions. [2018-10-25 01:45:56,550 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 772 transitions. Word has length 69 [2018-10-25 01:45:56,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:45:56,551 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 772 transitions. [2018-10-25 01:45:56,551 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 01:45:56,551 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 772 transitions. [2018-10-25 01:45:56,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-25 01:45:56,562 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:45:56,562 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:45:56,563 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:45:56,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:45:56,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1252535900, now seen corresponding path program 1 times [2018-10-25 01:45:56,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:45:56,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:45:56,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:45:56,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:45:56,565 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:45:56,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:45:56,883 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:45:56,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:45:56,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:45:56,884 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:45:56,886 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:45:56,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:45:56,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:45:56,887 INFO L87 Difference]: Start difference. First operand 434 states and 772 transitions. Second operand 6 states. [2018-10-25 01:46:00,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:46:00,588 INFO L93 Difference]: Finished difference Result 1234 states and 2250 transitions. [2018-10-25 01:46:00,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:46:00,591 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 139 [2018-10-25 01:46:00,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:46:00,598 INFO L225 Difference]: With dead ends: 1234 [2018-10-25 01:46:00,598 INFO L226 Difference]: Without dead ends: 806 [2018-10-25 01:46:00,602 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:46:00,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2018-10-25 01:46:00,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 797. [2018-10-25 01:46:00,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2018-10-25 01:46:00,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1300 transitions. [2018-10-25 01:46:00,641 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1300 transitions. Word has length 139 [2018-10-25 01:46:00,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:46:00,641 INFO L481 AbstractCegarLoop]: Abstraction has 797 states and 1300 transitions. [2018-10-25 01:46:00,641 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:46:00,642 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1300 transitions. [2018-10-25 01:46:00,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-10-25 01:46:00,646 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:46:00,646 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:46:00,647 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:46:00,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:46:00,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1412263263, now seen corresponding path program 1 times [2018-10-25 01:46:00,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:46:00,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:46:00,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:46:00,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:46:00,649 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:46:00,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:46:00,897 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:46:00,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:46:00,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 01:46:00,898 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:46:00,898 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 01:46:00,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 01:46:00,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-25 01:46:00,899 INFO L87 Difference]: Start difference. First operand 797 states and 1300 transitions. Second operand 5 states. [2018-10-25 01:46:03,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:46:03,298 INFO L93 Difference]: Finished difference Result 2186 states and 3741 transitions. [2018-10-25 01:46:03,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:46:03,306 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 140 [2018-10-25 01:46:03,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:46:03,322 INFO L225 Difference]: With dead ends: 2186 [2018-10-25 01:46:03,323 INFO L226 Difference]: Without dead ends: 1395 [2018-10-25 01:46:03,326 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-25 01:46:03,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2018-10-25 01:46:03,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 1369. [2018-10-25 01:46:03,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1369 states. [2018-10-25 01:46:03,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 2191 transitions. [2018-10-25 01:46:03,401 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 2191 transitions. Word has length 140 [2018-10-25 01:46:03,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:46:03,403 INFO L481 AbstractCegarLoop]: Abstraction has 1369 states and 2191 transitions. [2018-10-25 01:46:03,403 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 01:46:03,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 2191 transitions. [2018-10-25 01:46:03,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-25 01:46:03,406 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:46:03,406 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:46:03,407 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:46:03,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:46:03,408 INFO L82 PathProgramCache]: Analyzing trace with hash 531411331, now seen corresponding path program 1 times [2018-10-25 01:46:03,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:46:03,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:46:03,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:46:03,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:46:03,410 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:46:03,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:46:03,565 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:46:03,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:46:03,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 01:46:03,566 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:46:03,566 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 01:46:03,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 01:46:03,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-25 01:46:03,567 INFO L87 Difference]: Start difference. First operand 1369 states and 2191 transitions. Second operand 5 states. [2018-10-25 01:46:07,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:46:07,136 INFO L93 Difference]: Finished difference Result 4059 states and 6474 transitions. [2018-10-25 01:46:07,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-25 01:46:07,142 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 142 [2018-10-25 01:46:07,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:46:07,159 INFO L225 Difference]: With dead ends: 4059 [2018-10-25 01:46:07,160 INFO L226 Difference]: Without dead ends: 2696 [2018-10-25 01:46:07,170 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-25 01:46:07,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2696 states. [2018-10-25 01:46:07,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2696 to 2603. [2018-10-25 01:46:07,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2603 states. [2018-10-25 01:46:07,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2603 states to 2603 states and 3729 transitions. [2018-10-25 01:46:07,256 INFO L78 Accepts]: Start accepts. Automaton has 2603 states and 3729 transitions. Word has length 142 [2018-10-25 01:46:07,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:46:07,257 INFO L481 AbstractCegarLoop]: Abstraction has 2603 states and 3729 transitions. [2018-10-25 01:46:07,257 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 01:46:07,257 INFO L276 IsEmpty]: Start isEmpty. Operand 2603 states and 3729 transitions. [2018-10-25 01:46:07,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-25 01:46:07,261 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:46:07,261 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:46:07,261 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:46:07,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:46:07,262 INFO L82 PathProgramCache]: Analyzing trace with hash -2121902484, now seen corresponding path program 1 times [2018-10-25 01:46:07,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:46:07,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:46:07,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:46:07,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:46:07,263 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:46:07,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:46:07,688 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-25 01:46:07,831 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:46:07,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:46:07,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 01:46:07,832 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:46:07,833 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 01:46:07,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 01:46:07,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 01:46:07,836 INFO L87 Difference]: Start difference. First operand 2603 states and 3729 transitions. Second operand 5 states. [2018-10-25 01:46:11,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:46:11,252 INFO L93 Difference]: Finished difference Result 6795 states and 10054 transitions. [2018-10-25 01:46:11,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-25 01:46:11,252 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 143 [2018-10-25 01:46:11,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:46:11,274 INFO L225 Difference]: With dead ends: 6795 [2018-10-25 01:46:11,274 INFO L226 Difference]: Without dead ends: 3293 [2018-10-25 01:46:11,297 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:46:11,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3293 states. [2018-10-25 01:46:11,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3293 to 3278. [2018-10-25 01:46:11,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3278 states. [2018-10-25 01:46:11,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3278 states to 3278 states and 4140 transitions. [2018-10-25 01:46:11,390 INFO L78 Accepts]: Start accepts. Automaton has 3278 states and 4140 transitions. Word has length 143 [2018-10-25 01:46:11,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:46:11,390 INFO L481 AbstractCegarLoop]: Abstraction has 3278 states and 4140 transitions. [2018-10-25 01:46:11,391 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 01:46:11,391 INFO L276 IsEmpty]: Start isEmpty. Operand 3278 states and 4140 transitions. [2018-10-25 01:46:11,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-10-25 01:46:11,399 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:46:11,399 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:46:11,399 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:46:11,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:46:11,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1248172171, now seen corresponding path program 1 times [2018-10-25 01:46:11,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:46:11,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:46:11,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:46:11,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:46:11,401 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:46:11,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:46:11,673 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:46:11,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:46:11,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 01:46:11,674 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:46:11,675 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 01:46:11,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 01:46:11,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:46:11,675 INFO L87 Difference]: Start difference. First operand 3278 states and 4140 transitions. Second operand 4 states. [2018-10-25 01:46:12,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:46:12,991 INFO L93 Difference]: Finished difference Result 6733 states and 8492 transitions. [2018-10-25 01:46:12,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 01:46:12,997 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 242 [2018-10-25 01:46:12,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:46:13,016 INFO L225 Difference]: With dead ends: 6733 [2018-10-25 01:46:13,016 INFO L226 Difference]: Without dead ends: 3461 [2018-10-25 01:46:13,029 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:46:13,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3461 states. [2018-10-25 01:46:13,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3461 to 3461. [2018-10-25 01:46:13,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3461 states. [2018-10-25 01:46:13,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3461 states to 3461 states and 4335 transitions. [2018-10-25 01:46:13,121 INFO L78 Accepts]: Start accepts. Automaton has 3461 states and 4335 transitions. Word has length 242 [2018-10-25 01:46:13,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:46:13,122 INFO L481 AbstractCegarLoop]: Abstraction has 3461 states and 4335 transitions. [2018-10-25 01:46:13,122 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 01:46:13,122 INFO L276 IsEmpty]: Start isEmpty. Operand 3461 states and 4335 transitions. [2018-10-25 01:46:13,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-10-25 01:46:13,135 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:46:13,135 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:46:13,136 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:46:13,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:46:13,136 INFO L82 PathProgramCache]: Analyzing trace with hash -2039548178, now seen corresponding path program 1 times [2018-10-25 01:46:13,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:46:13,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:46:13,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:46:13,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:46:13,138 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:46:13,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:46:13,765 WARN L179 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 10 [2018-10-25 01:46:14,106 WARN L179 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2018-10-25 01:46:14,747 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 224 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:46:14,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:46:14,748 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:46:14,749 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 285 with the following transitions: [2018-10-25 01:46:14,751 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [453], [455], [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], [587], [591], [595], [599], [603], [607], [611], [615], [619], [622], [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-25 01:46:14,799 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:46:14,799 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:46:15,421 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.ArithmeticException: BigInteger: modulus not positive at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:391) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.handleInfeasibleCase(BaseRefinementStrategy.java:296) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:206) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:435) 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) Caused by: 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.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateAbstractPost(FixpointEngine.java:249) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateFixpoint(FixpointEngine.java:134) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.run(FixpointEngine.java:105) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.tool.AbstractInterpreter.runWithoutTimeoutAndResults(AbstractInterpreter.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner.generateFixpoints(CegarAbsIntRunner.java:217) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.constructInterpolantGenerator(BaseTaipanRefinementStrategy.java:385) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getInterpolantGenerator(BaseTaipanRefinementStrategy.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:380) ... 20 more [2018-10-25 01:46:15,432 INFO L168 Benchmark]: Toolchain (without parser) took 26344.04 ms. Allocated memory was 1.6 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -248.7 MB). Peak memory consumption was 828.7 MB. Max. memory is 7.1 GB. [2018-10-25 01:46:15,437 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 01:46:15,438 INFO L168 Benchmark]: CACSL2BoogieTranslator took 771.39 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. [2018-10-25 01:46:15,439 INFO L168 Benchmark]: Boogie Procedure Inliner took 220.03 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 756.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -853.3 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2018-10-25 01:46:15,443 INFO L168 Benchmark]: Boogie Preprocessor took 125.98 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. [2018-10-25 01:46:15,444 INFO L168 Benchmark]: RCFGBuilder took 3912.31 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: 127.9 MB). Peak memory consumption was 127.9 MB. Max. memory is 7.1 GB. [2018-10-25 01:46:15,444 INFO L168 Benchmark]: TraceAbstraction took 21309.27 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 320.9 MB). Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 397.4 MB). Peak memory consumption was 718.3 MB. Max. memory is 7.1 GB. [2018-10-25 01:46:15,458 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.21 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 771.39 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 220.03 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 756.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -853.3 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 125.98 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3912.31 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: 127.9 MB). Peak memory consumption was 127.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 21309.27 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 320.9 MB). Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 397.4 MB). Peak memory consumption was 718.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.ArithmeticException: BigInteger: modulus not positive de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.ArithmeticException: BigInteger: modulus not positive: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:391) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...