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/Problem13_label04_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 23:34:02,730 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 23:34:02,733 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 23:34:02,745 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 23:34:02,746 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 23:34:02,747 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 23:34:02,748 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 23:34:02,750 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 23:34:02,752 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 23:34:02,753 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 23:34:02,753 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 23:34:02,754 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 23:34:02,755 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 23:34:02,756 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 23:34:02,757 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 23:34:02,758 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 23:34:02,758 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 23:34:02,760 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 23:34:02,762 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 23:34:02,764 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 23:34:02,765 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 23:34:02,767 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 23:34:02,772 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 23:34:02,772 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 23:34:02,773 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 23:34:02,776 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 23:34:02,777 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 23:34:02,779 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 23:34:02,781 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 23:34:02,782 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 23:34:02,783 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 23:34:02,785 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 23:34:02,786 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 23:34:02,786 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 23:34:02,789 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 23:34:02,790 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 23:34:02,790 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-24 23:34:02,817 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 23:34:02,817 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 23:34:02,818 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 23:34:02,819 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-24 23:34:02,819 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-24 23:34:02,819 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-24 23:34:02,819 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-24 23:34:02,819 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-24 23:34:02,820 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-24 23:34:02,820 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-24 23:34:02,820 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-24 23:34:02,820 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-24 23:34:02,820 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-24 23:34:02,821 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-24 23:34:02,821 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 23:34:02,822 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 23:34:02,822 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 23:34:02,822 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 23:34:02,822 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 23:34:02,822 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 23:34:02,822 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 23:34:02,823 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 23:34:02,823 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 23:34:02,823 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 23:34:02,823 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 23:34:02,823 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 23:34:02,824 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 23:34:02,824 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 23:34:02,824 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 23:34:02,824 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 23:34:02,824 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-24 23:34:02,825 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 23:34:02,825 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 23:34:02,825 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 23:34:02,825 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 23:34:02,825 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-24 23:34:02,891 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 23:34:02,903 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 23:34:02,907 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 23:34:02,909 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 23:34:02,909 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 23:34:02,910 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label04_false-unreach-call.c [2018-10-24 23:34:02,970 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/4245edbc7/2c7c1e42d4444fc2812783510edf5c82/FLAG9b912f682 [2018-10-24 23:34:03,825 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 23:34:03,826 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label04_false-unreach-call.c [2018-10-24 23:34:03,868 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/4245edbc7/2c7c1e42d4444fc2812783510edf5c82/FLAG9b912f682 [2018-10-24 23:34:03,889 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/4245edbc7/2c7c1e42d4444fc2812783510edf5c82 [2018-10-24 23:34:03,900 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 23:34:03,902 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 23:34:03,903 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 23:34:03,903 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 23:34:03,907 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 23:34:03,908 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:34:03" (1/1) ... [2018-10-24 23:34:03,912 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26998074 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:34:03, skipping insertion in model container [2018-10-24 23:34:03,912 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:34:03" (1/1) ... [2018-10-24 23:34:03,923 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 23:34:04,088 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 23:34:05,575 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 23:34:05,581 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 23:34:06,341 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 23:34:06,378 INFO L193 MainTranslator]: Completed translation [2018-10-24 23:34:06,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:34:06 WrapperNode [2018-10-24 23:34:06,379 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 23:34:06,380 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 23:34:06,380 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 23:34:06,380 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 23:34:06,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:34:06" (1/1) ... [2018-10-24 23:34:06,471 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:34:06" (1/1) ... [2018-10-24 23:34:06,956 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 23:34:06,957 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 23:34:06,957 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 23:34:06,957 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 23:34:06,968 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:34:06" (1/1) ... [2018-10-24 23:34:06,969 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:34:06" (1/1) ... [2018-10-24 23:34:07,024 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:34:06" (1/1) ... [2018-10-24 23:34:07,024 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:34:06" (1/1) ... [2018-10-24 23:34:07,164 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:34:06" (1/1) ... [2018-10-24 23:34:07,207 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:34:06" (1/1) ... [2018-10-24 23:34:07,289 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:34:06" (1/1) ... [2018-10-24 23:34:07,376 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 23:34:07,377 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 23:34:07,377 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 23:34:07,377 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 23:34:07,378 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:34:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 23:34:07,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-24 23:34:07,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-24 23:34:07,451 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2018-10-24 23:34:07,451 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2018-10-24 23:34:07,451 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-10-24 23:34:07,452 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-10-24 23:34:07,453 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-24 23:34:07,453 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-24 23:34:07,453 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-24 23:34:07,453 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-24 23:34:07,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 23:34:07,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 23:34:07,454 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-24 23:34:07,455 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-24 23:34:21,223 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 23:34:21,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:34:21 BoogieIcfgContainer [2018-10-24 23:34:21,224 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 23:34:21,225 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 23:34:21,225 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 23:34:21,229 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 23:34:21,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:34:03" (1/3) ... [2018-10-24 23:34:21,230 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@585d5c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:34:21, skipping insertion in model container [2018-10-24 23:34:21,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:34:06" (2/3) ... [2018-10-24 23:34:21,230 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@585d5c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:34:21, skipping insertion in model container [2018-10-24 23:34:21,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:34:21" (3/3) ... [2018-10-24 23:34:21,232 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label04_false-unreach-call.c [2018-10-24 23:34:21,242 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 23:34:21,252 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 23:34:21,270 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 23:34:21,318 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 23:34:21,318 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 23:34:21,318 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 23:34:21,318 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 23:34:21,319 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 23:34:21,319 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 23:34:21,319 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 23:34:21,319 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 23:34:21,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states. [2018-10-24 23:34:21,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-24 23:34:21,368 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:34:21,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] [2018-10-24 23:34:21,372 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:34:21,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:34:21,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1342939469, now seen corresponding path program 1 times [2018-10-24 23:34:21,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:34:21,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:34:21,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:34:21,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:34:21,444 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:34:21,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:34:21,850 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-24 23:34:21,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:34:21,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:34:21,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 23:34:21,966 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:34:21,972 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 23:34:21,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 23:34:21,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 23:34:21,991 INFO L87 Difference]: Start difference. First operand 1120 states. Second operand 3 states. [2018-10-24 23:34:31,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:34:31,235 INFO L93 Difference]: Finished difference Result 3097 states and 5707 transitions. [2018-10-24 23:34:31,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 23:34:31,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-10-24 23:34:31,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:34:31,277 INFO L225 Difference]: With dead ends: 3097 [2018-10-24 23:34:31,277 INFO L226 Difference]: Without dead ends: 1975 [2018-10-24 23:34:31,288 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 23:34:31,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1975 states. [2018-10-24 23:34:31,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1975 to 1974. [2018-10-24 23:34:31,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1974 states. [2018-10-24 23:34:31,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1974 states to 1974 states and 3284 transitions. [2018-10-24 23:34:31,460 INFO L78 Accepts]: Start accepts. Automaton has 1974 states and 3284 transitions. Word has length 23 [2018-10-24 23:34:31,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:34:31,462 INFO L481 AbstractCegarLoop]: Abstraction has 1974 states and 3284 transitions. [2018-10-24 23:34:31,462 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 23:34:31,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1974 states and 3284 transitions. [2018-10-24 23:34:31,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-24 23:34:31,469 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:34:31,469 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 23:34:31,469 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:34:31,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:34:31,470 INFO L82 PathProgramCache]: Analyzing trace with hash 555017698, now seen corresponding path program 1 times [2018-10-24 23:34:31,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:34:31,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:34:31,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:34:31,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:34:31,472 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:34:31,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:34:31,740 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:34:31,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:34:31,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 23:34:31,741 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:34:31,742 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 23:34:31,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 23:34:31,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-24 23:34:31,743 INFO L87 Difference]: Start difference. First operand 1974 states and 3284 transitions. Second operand 5 states. [2018-10-24 23:34:54,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:34:54,041 INFO L93 Difference]: Finished difference Result 5736 states and 9691 transitions. [2018-10-24 23:34:54,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-24 23:34:54,044 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2018-10-24 23:34:54,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:34:54,075 INFO L225 Difference]: With dead ends: 5736 [2018-10-24 23:34:54,075 INFO L226 Difference]: Without dead ends: 3768 [2018-10-24 23:34:54,084 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-24 23:34:54,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3768 states. [2018-10-24 23:34:54,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3768 to 3686. [2018-10-24 23:34:54,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3686 states. [2018-10-24 23:34:54,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3686 states to 3686 states and 5660 transitions. [2018-10-24 23:34:54,214 INFO L78 Accepts]: Start accepts. Automaton has 3686 states and 5660 transitions. Word has length 99 [2018-10-24 23:34:54,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:34:54,214 INFO L481 AbstractCegarLoop]: Abstraction has 3686 states and 5660 transitions. [2018-10-24 23:34:54,215 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 23:34:54,215 INFO L276 IsEmpty]: Start isEmpty. Operand 3686 states and 5660 transitions. [2018-10-24 23:34:54,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-10-24 23:34:54,219 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:34:54,220 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 23:34:54,220 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:34:54,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:34:54,220 INFO L82 PathProgramCache]: Analyzing trace with hash 684637502, now seen corresponding path program 1 times [2018-10-24 23:34:54,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:34:54,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:34:54,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:34:54,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:34:54,222 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:34:54,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:34:54,445 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:34:54,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:34:54,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 23:34:54,446 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:34:54,447 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 23:34:54,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 23:34:54,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-24 23:34:54,447 INFO L87 Difference]: Start difference. First operand 3686 states and 5660 transitions. Second operand 5 states. [2018-10-24 23:35:21,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:35:21,716 INFO L93 Difference]: Finished difference Result 13666 states and 21762 transitions. [2018-10-24 23:35:21,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-24 23:35:21,722 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 113 [2018-10-24 23:35:21,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:35:21,782 INFO L225 Difference]: With dead ends: 13666 [2018-10-24 23:35:21,782 INFO L226 Difference]: Without dead ends: 9986 [2018-10-24 23:35:21,807 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-24 23:35:21,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9986 states. [2018-10-24 23:35:22,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9986 to 9794. [2018-10-24 23:35:22,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9794 states. [2018-10-24 23:35:22,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9794 states to 9794 states and 14501 transitions. [2018-10-24 23:35:22,089 INFO L78 Accepts]: Start accepts. Automaton has 9794 states and 14501 transitions. Word has length 113 [2018-10-24 23:35:22,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:35:22,090 INFO L481 AbstractCegarLoop]: Abstraction has 9794 states and 14501 transitions. [2018-10-24 23:35:22,090 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 23:35:22,090 INFO L276 IsEmpty]: Start isEmpty. Operand 9794 states and 14501 transitions. [2018-10-24 23:35:22,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-10-24 23:35:22,100 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:35:22,102 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 23:35:22,102 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:35:22,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:35:22,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1575492386, now seen corresponding path program 1 times [2018-10-24 23:35:22,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:35:22,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:35:22,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:35:22,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:35:22,104 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:35:22,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:35:22,403 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:35:22,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:35:22,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 23:35:22,404 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:35:22,404 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:35:22,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:35:22,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:35:22,405 INFO L87 Difference]: Start difference. First operand 9794 states and 14501 transitions. Second operand 6 states. [2018-10-24 23:35:35,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:35:35,519 INFO L93 Difference]: Finished difference Result 34188 states and 53807 transitions. [2018-10-24 23:35:35,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 23:35:35,525 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 131 [2018-10-24 23:35:35,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:35:35,676 INFO L225 Difference]: With dead ends: 34188 [2018-10-24 23:35:35,676 INFO L226 Difference]: Without dead ends: 24400 [2018-10-24 23:35:35,748 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-24 23:35:35,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24400 states. [2018-10-24 23:35:36,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24400 to 24166. [2018-10-24 23:35:36,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24166 states. [2018-10-24 23:35:36,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24166 states to 24166 states and 34072 transitions. [2018-10-24 23:35:36,363 INFO L78 Accepts]: Start accepts. Automaton has 24166 states and 34072 transitions. Word has length 131 [2018-10-24 23:35:36,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:35:36,364 INFO L481 AbstractCegarLoop]: Abstraction has 24166 states and 34072 transitions. [2018-10-24 23:35:36,364 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 23:35:36,364 INFO L276 IsEmpty]: Start isEmpty. Operand 24166 states and 34072 transitions. [2018-10-24 23:35:36,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-24 23:35:36,367 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:35:36,367 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 23:35:36,367 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:35:36,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:35:36,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1082707378, now seen corresponding path program 1 times [2018-10-24 23:35:36,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:35:36,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:35:36,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:35:36,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:35:36,369 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:35:36,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:35:36,625 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:35:36,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:35:36,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 23:35:36,626 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:35:36,626 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 23:35:36,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 23:35:36,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 23:35:36,630 INFO L87 Difference]: Start difference. First operand 24166 states and 34072 transitions. Second operand 4 states. [2018-10-24 23:35:50,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:35:50,835 INFO L93 Difference]: Finished difference Result 66685 states and 100121 transitions. [2018-10-24 23:35:50,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 23:35:50,839 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2018-10-24 23:35:50,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:35:51,010 INFO L225 Difference]: With dead ends: 66685 [2018-10-24 23:35:51,011 INFO L226 Difference]: Without dead ends: 42525 [2018-10-24 23:35:51,077 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-24 23:35:51,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42525 states. [2018-10-24 23:35:51,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42525 to 42463. [2018-10-24 23:35:51,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42463 states. [2018-10-24 23:35:52,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42463 states to 42463 states and 59980 transitions. [2018-10-24 23:35:52,029 INFO L78 Accepts]: Start accepts. Automaton has 42463 states and 59980 transitions. Word has length 139 [2018-10-24 23:35:52,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:35:52,030 INFO L481 AbstractCegarLoop]: Abstraction has 42463 states and 59980 transitions. [2018-10-24 23:35:52,030 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 23:35:52,030 INFO L276 IsEmpty]: Start isEmpty. Operand 42463 states and 59980 transitions. [2018-10-24 23:35:52,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-10-24 23:35:52,054 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:35:52,055 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:35:52,055 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:35:52,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:35:52,055 INFO L82 PathProgramCache]: Analyzing trace with hash 859998952, now seen corresponding path program 1 times [2018-10-24 23:35:52,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:35:52,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:35:52,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:35:52,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:35:52,057 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:35:52,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:35:52,706 WARN L179 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 10 [2018-10-24 23:35:52,950 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 48 proven. 144 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-10-24 23:35:52,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 23:35:52,950 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 23:35:52,951 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 272 with the following transitions: [2018-10-24 23:35:52,953 INFO L202 CegarAbsIntRunner]: [0], [1], [2628], [2635], [2643], [2651], [2659], [2667], [2675], [2683], [2691], [2699], [2707], [2711], [2713], [2716], [2724], [2732], [2740], [2748], [2756], [2764], [2772], [2780], [2788], [2796], [2804], [2812], [2820], [2828], [2836], [2844], [2852], [2860], [2868], [2876], [2884], [2892], [2900], [2908], [2916], [2924], [2932], [2940], [2948], [2956], [2964], [2972], [2980], [2988], [2996], [3004], [3012], [3020], [3028], [3036], [3044], [3052], [3060], [3068], [3076], [3084], [3092], [3100], [3108], [3116], [3121], [3125], [3129], [3133], [3137], [3148], [3151], [3152], [3156], [3159], [3160], [3164], [3168], [3179], [3183], [3187], [3191], [3195], [3199], [3203], [3207], [3218], [3222], [3226], [3230], [3234], [3237], [4238], [4242], [4246], [4252], [4256], [4258], [4269], [4270], [4271], [4273], [4274] [2018-10-24 23:35:53,018 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 23:35:53,018 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 23:35:59,362 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 23:35:59,364 INFO L272 AbstractInterpreter]: Visited 100 different actions 100 times. Never merged. Never widened. Never found a fixpoint. Largest state had 26 variables. [2018-10-24 23:35:59,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:35:59,407 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 23:36:03,070 INFO L232 lantSequenceWeakener]: Weakened 259 states. On average, predicates are now at 70.85% of their original sizes. [2018-10-24 23:36:03,071 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 23:36:03,336 INFO L413 sIntCurrentIteration]: We have 270 unified AI predicates [2018-10-24 23:36:03,336 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 23:36:03,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 23:36:03,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-10-24 23:36:03,339 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:36:03,339 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:36:03,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:36:03,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:36:03,340 INFO L87 Difference]: Start difference. First operand 42463 states and 59980 transitions. Second operand 6 states. [2018-10-24 23:36:07,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 23:36:07,309 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger: modulus not positive at java.math.BigInteger.mod(BigInteger.java:2458) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:154) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:100) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java: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.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: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.NonrelationalStatementProcessor.handleAssumeStatement(NonrelationalStatementProcessor.java:363) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processStatement(NonrelationalStatementProcessor.java:160) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:142) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:128) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:362) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:353) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.applyInternally(CompoundDomainPostOperator.java:306) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:131) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.applyPost(TermConjunctEvaluator.java:305) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$4(TermConjunctEvaluator.java:178) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computeFixpoint(TermConjunctEvaluator.java:198) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$1(TermConjunctEvaluator.java:150) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computePost(TermConjunctEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormanCachedPostOperation.applyPost(PoormanCachedPostOperation.java:308) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.applyPost(PoormansAbstractPostOperator.java:217) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:119) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:537) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalTransitionWithValidState(AbsIntHoareTripleChecker.java:352) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalAbsInt(AbsIntHoareTripleChecker.java:249) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternal(AbsIntHoareTripleChecker.java:181) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.chooseFalseSuccessor2(BasicAbstractInterpolantAutomaton.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:72) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:673) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:473) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-10-24 23:36:07,314 INFO L168 Benchmark]: Toolchain (without parser) took 123412.54 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 3.7 GB in the end (delta: -2.4 GB). Peak memory consumption was 214.0 MB. Max. memory is 7.1 GB. [2018-10-24 23:36:07,315 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 23:36:07,316 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2475.97 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. [2018-10-24 23:36:07,316 INFO L168 Benchmark]: Boogie Procedure Inliner took 576.80 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 796.9 MB). Free memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 83.7 MB. Max. memory is 7.1 GB. [2018-10-24 23:36:07,317 INFO L168 Benchmark]: Boogie Preprocessor took 419.67 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: 37.7 MB). Peak memory consumption was 37.7 MB. Max. memory is 7.1 GB. [2018-10-24 23:36:07,318 INFO L168 Benchmark]: RCFGBuilder took 13847.52 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 185.1 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 14.3 MB). Peak memory consumption was 668.9 MB. Max. memory is 7.1 GB. [2018-10-24 23:36:07,319 INFO L168 Benchmark]: TraceAbstraction took 106087.69 ms. Allocated memory was 2.5 GB in the beginning and 4.1 GB in the end (delta: 1.6 GB). Free memory was 2.2 GB in the beginning and 3.7 GB in the end (delta: -1.6 GB). There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 23:36:07,325 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2475.97 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 576.80 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 796.9 MB). Free memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 83.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 419.67 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: 37.7 MB). Peak memory consumption was 37.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 13847.52 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 185.1 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 14.3 MB). Peak memory consumption was 668.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 106087.69 ms. Allocated memory was 2.5 GB in the beginning and 4.1 GB in the end (delta: 1.6 GB). Free memory was 2.2 GB in the beginning and 3.7 GB in the end (delta: -1.6 GB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger: modulus not positive de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger: modulus not positive: java.math.BigInteger.mod(BigInteger.java:2458) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...