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_label59_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 01:47:12,853 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 01:47:12,855 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 01:47:12,875 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 01:47:12,875 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 01:47:12,877 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 01:47:12,878 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 01:47:12,881 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 01:47:12,885 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 01:47:12,886 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 01:47:12,887 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 01:47:12,887 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 01:47:12,888 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 01:47:12,889 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 01:47:12,890 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 01:47:12,891 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 01:47:12,892 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 01:47:12,894 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 01:47:12,896 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 01:47:12,898 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 01:47:12,899 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 01:47:12,900 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 01:47:12,903 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 01:47:12,903 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 01:47:12,903 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 01:47:12,904 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 01:47:12,906 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 01:47:12,906 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 01:47:12,907 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 01:47:12,908 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 01:47:12,909 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 01:47:12,909 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 01:47:12,910 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 01:47:12,910 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 01:47:12,911 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 01:47:12,912 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 01:47:12,912 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:47:12,928 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 01:47:12,928 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 01:47:12,929 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 01:47:12,929 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 01:47:12,929 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 01:47:12,930 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 01:47:12,930 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 01:47:12,930 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 01:47:12,930 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 01:47:12,930 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 01:47:12,930 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 01:47:12,931 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 01:47:12,931 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 01:47:12,931 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 01:47:12,932 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 01:47:12,932 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 01:47:12,932 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 01:47:12,932 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 01:47:12,933 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 01:47:12,933 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 01:47:12,933 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 01:47:12,933 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 01:47:12,933 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 01:47:12,934 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 01:47:12,934 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 01:47:12,934 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 01:47:12,934 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 01:47:12,934 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 01:47:12,935 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 01:47:12,935 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 01:47:12,935 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 01:47:12,935 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 01:47:12,935 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 01:47:12,935 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 01:47:12,936 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 01:47:12,936 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 01:47:12,998 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 01:47:13,017 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 01:47:13,021 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 01:47:13,022 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 01:47:13,023 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 01:47:13,024 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label59_true-unreach-call_false-termination.c [2018-10-25 01:47:13,085 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/07e20bdec/5c6ae3ea4ffb41ecb610d0ebdb1624b4/FLAG9c77dad09 [2018-10-25 01:47:13,733 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 01:47:13,734 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label59_true-unreach-call_false-termination.c [2018-10-25 01:47:13,749 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/07e20bdec/5c6ae3ea4ffb41ecb610d0ebdb1624b4/FLAG9c77dad09 [2018-10-25 01:47:13,769 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/07e20bdec/5c6ae3ea4ffb41ecb610d0ebdb1624b4 [2018-10-25 01:47:13,783 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 01:47:13,786 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 01:47:13,788 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 01:47:13,788 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 01:47:13,798 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 01:47:13,799 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:47:13" (1/1) ... [2018-10-25 01:47:13,804 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79efdec5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:47:13, skipping insertion in model container [2018-10-25 01:47:13,804 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:47:13" (1/1) ... [2018-10-25 01:47:13,816 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 01:47:13,904 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 01:47:14,479 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:47:14,487 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 01:47:14,635 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:47:14,653 INFO L193 MainTranslator]: Completed translation [2018-10-25 01:47:14,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:47:14 WrapperNode [2018-10-25 01:47:14,654 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 01:47:14,655 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 01:47:14,655 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 01:47:14,656 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 01:47:14,665 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:47:14" (1/1) ... [2018-10-25 01:47:14,694 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:47:14" (1/1) ... [2018-10-25 01:47:14,881 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 01:47:14,881 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 01:47:14,882 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 01:47:14,882 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 01:47:14,891 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:47:14" (1/1) ... [2018-10-25 01:47:14,891 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:47:14" (1/1) ... [2018-10-25 01:47:14,897 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:47:14" (1/1) ... [2018-10-25 01:47:14,897 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:47:14" (1/1) ... [2018-10-25 01:47:14,940 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:47:14" (1/1) ... [2018-10-25 01:47:14,969 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:47:14" (1/1) ... [2018-10-25 01:47:14,985 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:47:14" (1/1) ... [2018-10-25 01:47:15,008 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 01:47:15,008 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 01:47:15,009 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 01:47:15,009 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 01:47:15,010 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:47:14" (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:47:15,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 01:47:15,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 01:47:15,090 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 01:47:15,090 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 01:47:15,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 01:47:15,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 01:47:15,092 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 01:47:15,093 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 01:47:19,240 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 01:47:19,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:47:19 BoogieIcfgContainer [2018-10-25 01:47:19,241 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 01:47:19,242 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 01:47:19,242 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 01:47:19,246 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 01:47:19,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 01:47:13" (1/3) ... [2018-10-25 01:47:19,247 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5197296a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:47:19, skipping insertion in model container [2018-10-25 01:47:19,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:47:14" (2/3) ... [2018-10-25 01:47:19,248 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5197296a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:47:19, skipping insertion in model container [2018-10-25 01:47:19,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:47:19" (3/3) ... [2018-10-25 01:47:19,250 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label59_true-unreach-call_false-termination.c [2018-10-25 01:47:19,261 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 01:47:19,269 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 01:47:19,288 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 01:47:19,328 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 01:47:19,331 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 01:47:19,331 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 01:47:19,331 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 01:47:19,332 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 01:47:19,332 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 01:47:19,332 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 01:47:19,332 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 01:47:19,358 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states. [2018-10-25 01:47:19,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-25 01:47:19,367 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:47:19,369 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] [2018-10-25 01:47:19,372 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:47:19,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:47:19,378 INFO L82 PathProgramCache]: Analyzing trace with hash 403888209, now seen corresponding path program 1 times [2018-10-25 01:47:19,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:47:19,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:47:19,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:47:19,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:47:19,432 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:47:19,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:47:19,843 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:47:19,965 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:47:19,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:47:19,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 01:47:19,969 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:47:19,977 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 01:47:19,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 01:47:19,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 01:47:20,001 INFO L87 Difference]: Start difference. First operand 255 states. Second operand 3 states. [2018-10-25 01:47:22,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:47:22,066 INFO L93 Difference]: Finished difference Result 691 states and 1226 transitions. [2018-10-25 01:47:22,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 01:47:22,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-10-25 01:47:22,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:47:22,096 INFO L225 Difference]: With dead ends: 691 [2018-10-25 01:47:22,097 INFO L226 Difference]: Without dead ends: 434 [2018-10-25 01:47:22,107 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 01:47:22,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-10-25 01:47:22,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2018-10-25 01:47:22,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-10-25 01:47:22,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 772 transitions. [2018-10-25 01:47:22,192 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 772 transitions. Word has length 47 [2018-10-25 01:47:22,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:47:22,193 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 772 transitions. [2018-10-25 01:47:22,193 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 01:47:22,193 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 772 transitions. [2018-10-25 01:47:22,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-10-25 01:47:22,201 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:47:22,201 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:22,202 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:47:22,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:47:22,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1310565324, now seen corresponding path program 1 times [2018-10-25 01:47:22,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:47:22,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:47:22,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:47:22,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:47:22,204 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:47:22,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:47:22,539 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:47:22,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:47:22,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:47:22,539 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:47:22,542 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:47:22,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:47:22,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:47:22,543 INFO L87 Difference]: Start difference. First operand 434 states and 772 transitions. Second operand 6 states. [2018-10-25 01:47:26,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:47:26,314 INFO L93 Difference]: Finished difference Result 1234 states and 2250 transitions. [2018-10-25 01:47:26,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:47:26,318 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 117 [2018-10-25 01:47:26,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:47:26,325 INFO L225 Difference]: With dead ends: 1234 [2018-10-25 01:47:26,325 INFO L226 Difference]: Without dead ends: 806 [2018-10-25 01:47:26,330 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:47:26,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2018-10-25 01:47:26,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 797. [2018-10-25 01:47:26,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2018-10-25 01:47:26,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1300 transitions. [2018-10-25 01:47:26,385 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1300 transitions. Word has length 117 [2018-10-25 01:47:26,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:47:26,385 INFO L481 AbstractCegarLoop]: Abstraction has 797 states and 1300 transitions. [2018-10-25 01:47:26,386 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:47:26,386 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1300 transitions. [2018-10-25 01:47:26,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-25 01:47:26,390 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:47:26,391 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:26,391 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:47:26,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:47:26,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1516534009, now seen corresponding path program 1 times [2018-10-25 01:47:26,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:47:26,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:47:26,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:47:26,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:47:26,394 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:47:26,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:47:26,586 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:47:26,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:47:26,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 01:47:26,587 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:47:26,587 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 01:47:26,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 01:47:26,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-25 01:47:26,588 INFO L87 Difference]: Start difference. First operand 797 states and 1300 transitions. Second operand 5 states. [2018-10-25 01:47:31,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:47:31,741 INFO L93 Difference]: Finished difference Result 2186 states and 3741 transitions. [2018-10-25 01:47:31,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:47:31,747 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 118 [2018-10-25 01:47:31,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:47:31,765 INFO L225 Difference]: With dead ends: 2186 [2018-10-25 01:47:31,766 INFO L226 Difference]: Without dead ends: 1395 [2018-10-25 01:47:31,769 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-25 01:47:31,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2018-10-25 01:47:31,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 1369. [2018-10-25 01:47:31,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1369 states. [2018-10-25 01:47:31,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 2191 transitions. [2018-10-25 01:47:31,853 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 2191 transitions. Word has length 118 [2018-10-25 01:47:31,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:47:31,854 INFO L481 AbstractCegarLoop]: Abstraction has 1369 states and 2191 transitions. [2018-10-25 01:47:31,856 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 01:47:31,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 2191 transitions. [2018-10-25 01:47:31,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-25 01:47:31,858 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:47:31,862 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:31,862 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:47:31,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:47:31,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1750095403, now seen corresponding path program 1 times [2018-10-25 01:47:31,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:47:31,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:47:31,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:47:31,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:47:31,864 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:47:31,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:47:32,139 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:47:32,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:47:32,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 01:47:32,139 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:47:32,141 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 01:47:32,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 01:47:32,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-25 01:47:32,142 INFO L87 Difference]: Start difference. First operand 1369 states and 2191 transitions. Second operand 5 states. [2018-10-25 01:47:35,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:47:35,490 INFO L93 Difference]: Finished difference Result 4059 states and 6474 transitions. [2018-10-25 01:47:35,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-25 01:47:35,493 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2018-10-25 01:47:35,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:47:35,512 INFO L225 Difference]: With dead ends: 4059 [2018-10-25 01:47:35,512 INFO L226 Difference]: Without dead ends: 2696 [2018-10-25 01:47:35,523 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-25 01:47:35,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2696 states. [2018-10-25 01:47:35,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2696 to 2603. [2018-10-25 01:47:35,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2603 states. [2018-10-25 01:47:35,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2603 states to 2603 states and 3729 transitions. [2018-10-25 01:47:35,631 INFO L78 Accepts]: Start accepts. Automaton has 2603 states and 3729 transitions. Word has length 120 [2018-10-25 01:47:35,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:47:35,632 INFO L481 AbstractCegarLoop]: Abstraction has 2603 states and 3729 transitions. [2018-10-25 01:47:35,632 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 01:47:35,632 INFO L276 IsEmpty]: Start isEmpty. Operand 2603 states and 3729 transitions. [2018-10-25 01:47:35,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-25 01:47:35,634 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:47:35,635 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:35,635 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:47:35,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:47:35,636 INFO L82 PathProgramCache]: Analyzing trace with hash 289947284, now seen corresponding path program 1 times [2018-10-25 01:47:35,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:47:35,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:47:35,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:47:35,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:47:35,638 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:47:35,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:47:35,934 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:47:35,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:47:35,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 01:47:35,935 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:47:35,935 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 01:47:35,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 01:47:35,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 01:47:35,936 INFO L87 Difference]: Start difference. First operand 2603 states and 3729 transitions. Second operand 5 states. [2018-10-25 01:47:39,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:47:39,087 INFO L93 Difference]: Finished difference Result 6795 states and 10054 transitions. [2018-10-25 01:47:39,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-25 01:47:39,087 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2018-10-25 01:47:39,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:47:39,105 INFO L225 Difference]: With dead ends: 6795 [2018-10-25 01:47:39,105 INFO L226 Difference]: Without dead ends: 3293 [2018-10-25 01:47:39,127 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:47:39,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3293 states. [2018-10-25 01:47:39,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3293 to 3278. [2018-10-25 01:47:39,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3278 states. [2018-10-25 01:47:39,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3278 states to 3278 states and 4140 transitions. [2018-10-25 01:47:39,211 INFO L78 Accepts]: Start accepts. Automaton has 3278 states and 4140 transitions. Word has length 121 [2018-10-25 01:47:39,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:47:39,211 INFO L481 AbstractCegarLoop]: Abstraction has 3278 states and 4140 transitions. [2018-10-25 01:47:39,212 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 01:47:39,212 INFO L276 IsEmpty]: Start isEmpty. Operand 3278 states and 4140 transitions. [2018-10-25 01:47:39,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-10-25 01:47:39,218 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:47:39,219 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:39,219 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:47:39,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:47:39,220 INFO L82 PathProgramCache]: Analyzing trace with hash 2133746483, now seen corresponding path program 1 times [2018-10-25 01:47:39,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:47:39,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:47:39,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:47:39,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:47:39,221 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:47:39,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:47:39,465 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:47:39,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:47:39,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 01:47:39,466 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:47:39,467 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 01:47:39,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 01:47:39,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:47:39,467 INFO L87 Difference]: Start difference. First operand 3278 states and 4140 transitions. Second operand 4 states. [2018-10-25 01:47:40,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:47:40,952 INFO L93 Difference]: Finished difference Result 6733 states and 8492 transitions. [2018-10-25 01:47:40,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 01:47:40,953 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 220 [2018-10-25 01:47:40,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:47:40,970 INFO L225 Difference]: With dead ends: 6733 [2018-10-25 01:47:40,970 INFO L226 Difference]: Without dead ends: 3461 [2018-10-25 01:47:40,983 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:47:40,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3461 states. [2018-10-25 01:47:41,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3461 to 3461. [2018-10-25 01:47:41,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3461 states. [2018-10-25 01:47:41,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3461 states to 3461 states and 4335 transitions. [2018-10-25 01:47:41,065 INFO L78 Accepts]: Start accepts. Automaton has 3461 states and 4335 transitions. Word has length 220 [2018-10-25 01:47:41,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:47:41,066 INFO L481 AbstractCegarLoop]: Abstraction has 3461 states and 4335 transitions. [2018-10-25 01:47:41,066 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 01:47:41,066 INFO L276 IsEmpty]: Start isEmpty. Operand 3461 states and 4335 transitions. [2018-10-25 01:47:41,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-10-25 01:47:41,077 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:47:41,077 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:47:41,077 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:47:41,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:47:41,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1526294730, now seen corresponding path program 1 times [2018-10-25 01:47:41,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:47:41,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:47:41,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:47:41,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:47:41,079 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:47:41,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:47:41,380 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-25 01:47:41,603 WARN L179 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 10 [2018-10-25 01:47:41,980 WARN L179 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2018-10-25 01:47:42,132 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 31 [2018-10-25 01:47:42,258 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 31 [2018-10-25 01:47:42,751 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 180 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:47:42,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:47:42,751 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:47:42,752 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 263 with the following transitions: [2018-10-25 01:47:42,754 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], [277], [279], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [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:47:42,803 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:47:42,804 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:47:43,425 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:47:43,434 INFO L168 Benchmark]: Toolchain (without parser) took 29650.43 ms. Allocated memory was 1.5 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.8 GB in the end (delta: -358.4 MB). Peak memory consumption was 733.2 MB. Max. memory is 7.1 GB. [2018-10-25 01:47:43,436 INFO L168 Benchmark]: CDTParser took 0.24 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-25 01:47:43,438 INFO L168 Benchmark]: CACSL2BoogieTranslator took 866.74 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-10-25 01:47:43,439 INFO L168 Benchmark]: Boogie Procedure Inliner took 226.06 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -832.1 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. [2018-10-25 01:47:43,440 INFO L168 Benchmark]: Boogie Preprocessor took 126.58 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.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. [2018-10-25 01:47:43,441 INFO L168 Benchmark]: RCFGBuilder took 4232.92 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: 131.0 MB). Peak memory consumption was 131.0 MB. Max. memory is 7.1 GB. [2018-10-25 01:47:43,441 INFO L168 Benchmark]: TraceAbstraction took 24191.25 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 348.7 MB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 287.0 MB). Peak memory consumption was 635.6 MB. Max. memory is 7.1 GB. [2018-10-25 01:47:43,450 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.24 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 866.74 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 226.06 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -832.1 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 126.58 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.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 4232.92 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: 131.0 MB). Peak memory consumption was 131.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 24191.25 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 348.7 MB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 287.0 MB). Peak memory consumption was 635.6 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...