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/Problem12_label29_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 01:38:37,127 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 01:38:37,130 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 01:38:37,141 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 01:38:37,142 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 01:38:37,143 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 01:38:37,144 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 01:38:37,146 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 01:38:37,148 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 01:38:37,149 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 01:38:37,149 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 01:38:37,150 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 01:38:37,151 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 01:38:37,152 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 01:38:37,153 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 01:38:37,154 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 01:38:37,155 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 01:38:37,157 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 01:38:37,159 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 01:38:37,160 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 01:38:37,161 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 01:38:37,163 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 01:38:37,165 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 01:38:37,166 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 01:38:37,166 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 01:38:37,167 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 01:38:37,168 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 01:38:37,169 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 01:38:37,170 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 01:38:37,171 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 01:38:37,171 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 01:38:37,172 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 01:38:37,172 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 01:38:37,172 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 01:38:37,173 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 01:38:37,174 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 01:38:37,175 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:38:37,203 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 01:38:37,203 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 01:38:37,204 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 01:38:37,204 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 01:38:37,204 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 01:38:37,205 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 01:38:37,205 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 01:38:37,205 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 01:38:37,205 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 01:38:37,205 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 01:38:37,206 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 01:38:37,206 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 01:38:37,206 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 01:38:37,206 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 01:38:37,207 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 01:38:37,207 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 01:38:37,207 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 01:38:37,207 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 01:38:37,208 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 01:38:37,210 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 01:38:37,210 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 01:38:37,210 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 01:38:37,211 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 01:38:37,211 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 01:38:37,211 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 01:38:37,211 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 01:38:37,211 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 01:38:37,212 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 01:38:37,212 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 01:38:37,212 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 01:38:37,212 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 01:38:37,212 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 01:38:37,212 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 01:38:37,213 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 01:38:37,214 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 01:38:37,214 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 01:38:37,286 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 01:38:37,305 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 01:38:37,309 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 01:38:37,311 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 01:38:37,311 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 01:38:37,312 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem12_label29_true-unreach-call.c [2018-10-25 01:38:37,375 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/66335238c/8c345f1f51804640bff96d2adf44b09e/FLAGdf93c3107 [2018-10-25 01:38:38,153 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 01:38:38,154 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem12_label29_true-unreach-call.c [2018-10-25 01:38:38,187 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/66335238c/8c345f1f51804640bff96d2adf44b09e/FLAGdf93c3107 [2018-10-25 01:38:38,208 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/66335238c/8c345f1f51804640bff96d2adf44b09e [2018-10-25 01:38:38,221 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 01:38:38,223 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 01:38:38,224 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 01:38:38,224 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 01:38:38,232 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 01:38:38,233 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:38:38" (1/1) ... [2018-10-25 01:38:38,237 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@379aca2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:38:38, skipping insertion in model container [2018-10-25 01:38:38,237 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:38:38" (1/1) ... [2018-10-25 01:38:38,249 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 01:38:38,421 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 01:38:39,698 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:38:39,703 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 01:38:40,351 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:38:40,386 INFO L193 MainTranslator]: Completed translation [2018-10-25 01:38:40,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:38:40 WrapperNode [2018-10-25 01:38:40,387 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 01:38:40,388 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 01:38:40,388 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 01:38:40,388 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 01:38:40,400 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:38:40" (1/1) ... [2018-10-25 01:38:40,463 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:38:40" (1/1) ... [2018-10-25 01:38:40,864 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 01:38:40,865 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 01:38:40,865 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 01:38:40,865 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 01:38:40,875 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:38:40" (1/1) ... [2018-10-25 01:38:40,876 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:38:40" (1/1) ... [2018-10-25 01:38:40,903 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:38:40" (1/1) ... [2018-10-25 01:38:40,904 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:38:40" (1/1) ... [2018-10-25 01:38:41,037 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:38:40" (1/1) ... [2018-10-25 01:38:41,083 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:38:40" (1/1) ... [2018-10-25 01:38:41,140 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:38:40" (1/1) ... [2018-10-25 01:38:41,215 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 01:38:41,215 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 01:38:41,216 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 01:38:41,216 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 01:38:41,217 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:38:40" (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:38:41,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 01:38:41,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 01:38:41,294 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2018-10-25 01:38:41,294 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2018-10-25 01:38:41,295 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-10-25 01:38:41,295 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-10-25 01:38:41,295 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-25 01:38:41,295 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-25 01:38:41,296 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 01:38:41,296 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 01:38:41,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 01:38:41,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 01:38:41,297 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 01:38:41,297 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 01:38:52,637 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 01:38:52,638 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:38:52 BoogieIcfgContainer [2018-10-25 01:38:52,638 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 01:38:52,640 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 01:38:52,640 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 01:38:52,644 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 01:38:52,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 01:38:38" (1/3) ... [2018-10-25 01:38:52,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@133af59c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:38:52, skipping insertion in model container [2018-10-25 01:38:52,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:38:40" (2/3) ... [2018-10-25 01:38:52,646 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@133af59c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:38:52, skipping insertion in model container [2018-10-25 01:38:52,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:38:52" (3/3) ... [2018-10-25 01:38:52,648 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label29_true-unreach-call.c [2018-10-25 01:38:52,658 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 01:38:52,672 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 01:38:52,691 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 01:38:52,752 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 01:38:52,752 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 01:38:52,752 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 01:38:52,753 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 01:38:52,753 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 01:38:52,753 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 01:38:52,753 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 01:38:52,753 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 01:38:52,792 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states. [2018-10-25 01:38:52,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-25 01:38:52,802 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:38:52,803 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:38:52,806 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:38:52,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:38:52,812 INFO L82 PathProgramCache]: Analyzing trace with hash -648066108, now seen corresponding path program 1 times [2018-10-25 01:38:52,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:38:52,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:38:52,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:38:52,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:38:52,873 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:38:52,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:38:53,386 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 3 [2018-10-25 01:38:53,423 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:38:53,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:38:53,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 01:38:53,427 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:38:53,435 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 01:38:53,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 01:38:53,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:38:53,458 INFO L87 Difference]: Start difference. First operand 840 states. Second operand 4 states. [2018-10-25 01:39:06,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:39:06,205 INFO L93 Difference]: Finished difference Result 3234 states and 6255 transitions. [2018-10-25 01:39:06,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 01:39:06,211 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2018-10-25 01:39:06,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:39:06,261 INFO L225 Difference]: With dead ends: 3234 [2018-10-25 01:39:06,262 INFO L226 Difference]: Without dead ends: 2388 [2018-10-25 01:39:06,273 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:39:06,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2388 states. [2018-10-25 01:39:06,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2388 to 2388. [2018-10-25 01:39:06,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2388 states. [2018-10-25 01:39:06,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2388 states to 2388 states and 3845 transitions. [2018-10-25 01:39:06,476 INFO L78 Accepts]: Start accepts. Automaton has 2388 states and 3845 transitions. Word has length 62 [2018-10-25 01:39:06,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:39:06,477 INFO L481 AbstractCegarLoop]: Abstraction has 2388 states and 3845 transitions. [2018-10-25 01:39:06,477 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 01:39:06,478 INFO L276 IsEmpty]: Start isEmpty. Operand 2388 states and 3845 transitions. [2018-10-25 01:39:06,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-25 01:39:06,487 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:39:06,487 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:06,488 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:39:06,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:39:06,488 INFO L82 PathProgramCache]: Analyzing trace with hash -267235377, now seen corresponding path program 1 times [2018-10-25 01:39:06,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:39:06,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:39:06,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:39:06,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:39:06,490 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:39:06,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:39:06,792 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:39:06,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:39:06,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 01:39:06,793 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:39:06,795 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 01:39:06,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 01:39:06,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-25 01:39:06,795 INFO L87 Difference]: Start difference. First operand 2388 states and 3845 transitions. Second operand 5 states. [2018-10-25 01:39:21,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:39:21,808 INFO L93 Difference]: Finished difference Result 7257 states and 11779 transitions. [2018-10-25 01:39:21,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 01:39:21,809 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 143 [2018-10-25 01:39:21,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:39:21,838 INFO L225 Difference]: With dead ends: 7257 [2018-10-25 01:39:21,839 INFO L226 Difference]: Without dead ends: 4875 [2018-10-25 01:39:21,846 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:39:21,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4875 states. [2018-10-25 01:39:21,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4875 to 4829. [2018-10-25 01:39:21,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4829 states. [2018-10-25 01:39:21,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4829 states to 4829 states and 7152 transitions. [2018-10-25 01:39:21,999 INFO L78 Accepts]: Start accepts. Automaton has 4829 states and 7152 transitions. Word has length 143 [2018-10-25 01:39:21,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:39:22,000 INFO L481 AbstractCegarLoop]: Abstraction has 4829 states and 7152 transitions. [2018-10-25 01:39:22,001 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 01:39:22,001 INFO L276 IsEmpty]: Start isEmpty. Operand 4829 states and 7152 transitions. [2018-10-25 01:39:22,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-10-25 01:39:22,012 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:39:22,013 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:22,013 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:39:22,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:39:22,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1673617562, now seen corresponding path program 1 times [2018-10-25 01:39:22,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:39:22,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:39:22,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:39:22,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:39:22,016 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:39:22,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:39:22,362 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:39:22,421 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:39:22,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:39:22,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:39:22,421 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:39:22,422 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:39:22,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:39:22,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:39:22,423 INFO L87 Difference]: Start difference. First operand 4829 states and 7152 transitions. Second operand 6 states. [2018-10-25 01:39:30,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:39:30,585 INFO L93 Difference]: Finished difference Result 14640 states and 22370 transitions. [2018-10-25 01:39:30,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:39:30,588 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 176 [2018-10-25 01:39:30,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:39:30,646 INFO L225 Difference]: With dead ends: 14640 [2018-10-25 01:39:30,647 INFO L226 Difference]: Without dead ends: 9817 [2018-10-25 01:39:30,662 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:39:30,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9817 states. [2018-10-25 01:39:30,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9817 to 9687. [2018-10-25 01:39:30,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9687 states. [2018-10-25 01:39:30,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9687 states to 9687 states and 14172 transitions. [2018-10-25 01:39:30,948 INFO L78 Accepts]: Start accepts. Automaton has 9687 states and 14172 transitions. Word has length 176 [2018-10-25 01:39:30,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:39:30,949 INFO L481 AbstractCegarLoop]: Abstraction has 9687 states and 14172 transitions. [2018-10-25 01:39:30,949 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:39:30,950 INFO L276 IsEmpty]: Start isEmpty. Operand 9687 states and 14172 transitions. [2018-10-25 01:39:30,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-10-25 01:39:30,954 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:39:30,954 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:30,955 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:39:30,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:39:30,955 INFO L82 PathProgramCache]: Analyzing trace with hash 924991159, now seen corresponding path program 1 times [2018-10-25 01:39:30,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:39:30,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:39:30,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:39:30,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:39:30,957 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:39:31,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:39:31,324 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:39:31,395 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:39:31,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:39:31,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:39:31,395 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:39:31,396 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:39:31,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:39:31,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:39:31,397 INFO L87 Difference]: Start difference. First operand 9687 states and 14172 transitions. Second operand 6 states. [2018-10-25 01:39:42,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:39:42,903 INFO L93 Difference]: Finished difference Result 33017 states and 50581 transitions. [2018-10-25 01:39:42,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:39:42,905 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 187 [2018-10-25 01:39:42,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:39:43,023 INFO L225 Difference]: With dead ends: 33017 [2018-10-25 01:39:43,023 INFO L226 Difference]: Without dead ends: 23336 [2018-10-25 01:39:43,075 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:39:43,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23336 states. [2018-10-25 01:39:43,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23336 to 23223. [2018-10-25 01:39:43,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23223 states. [2018-10-25 01:39:43,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23223 states to 23223 states and 32833 transitions. [2018-10-25 01:39:43,584 INFO L78 Accepts]: Start accepts. Automaton has 23223 states and 32833 transitions. Word has length 187 [2018-10-25 01:39:43,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:39:43,585 INFO L481 AbstractCegarLoop]: Abstraction has 23223 states and 32833 transitions. [2018-10-25 01:39:43,585 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:39:43,585 INFO L276 IsEmpty]: Start isEmpty. Operand 23223 states and 32833 transitions. [2018-10-25 01:39:43,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-10-25 01:39:43,590 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:39:43,591 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:43,591 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:39:43,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:39:43,592 INFO L82 PathProgramCache]: Analyzing trace with hash 862970119, now seen corresponding path program 1 times [2018-10-25 01:39:43,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:39:43,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:39:43,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:39:43,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:39:43,593 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:39:43,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:39:43,856 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:39:43,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:39:43,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 01:39:43,857 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:39:43,857 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 01:39:43,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 01:39:43,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:39:43,858 INFO L87 Difference]: Start difference. First operand 23223 states and 32833 transitions. Second operand 4 states. [2018-10-25 01:39:52,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:39:52,844 INFO L93 Difference]: Finished difference Result 55863 states and 80527 transitions. [2018-10-25 01:39:52,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 01:39:52,850 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 211 [2018-10-25 01:39:52,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:39:52,943 INFO L225 Difference]: With dead ends: 55863 [2018-10-25 01:39:52,944 INFO L226 Difference]: Without dead ends: 32646 [2018-10-25 01:39:53,030 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:39:53,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32646 states. [2018-10-25 01:39:53,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32646 to 32644. [2018-10-25 01:39:53,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32644 states. [2018-10-25 01:39:53,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32644 states to 32644 states and 42114 transitions. [2018-10-25 01:39:53,633 INFO L78 Accepts]: Start accepts. Automaton has 32644 states and 42114 transitions. Word has length 211 [2018-10-25 01:39:53,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:39:53,634 INFO L481 AbstractCegarLoop]: Abstraction has 32644 states and 42114 transitions. [2018-10-25 01:39:53,634 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 01:39:53,634 INFO L276 IsEmpty]: Start isEmpty. Operand 32644 states and 42114 transitions. [2018-10-25 01:39:53,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-10-25 01:39:53,639 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:39:53,640 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:53,640 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:39:53,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:39:53,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1084674450, now seen corresponding path program 1 times [2018-10-25 01:39:53,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:39:53,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:39:53,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:39:53,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:39:53,642 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:39:53,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:39:53,959 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:39:54,221 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-25 01:39:54,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:39:54,222 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:39:54,223 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 213 with the following transitions: [2018-10-25 01:39:54,230 INFO L202 CegarAbsIntRunner]: [0], [1], [1868], [1875], [1883], [1891], [1899], [1907], [1915], [1923], [1931], [1939], [1947], [1955], [1963], [1971], [1979], [1987], [1995], [2003], [2011], [2019], [2027], [2035], [2043], [2051], [2059], [2067], [2075], [2083], [2091], [2099], [2107], [2115], [2123], [2131], [2139], [2147], [2155], [2163], [2171], [2179], [2187], [2195], [2203], [2211], [2219], [2227], [2235], [2243], [2251], [2259], [2263], [2265], [2268], [2276], [2284], [2292], [2300], [2308], [2316], [2324], [2332], [2340], [2348], [2356], [2361], [2365], [2369], [2373], [2377], [2381], [2385], [2389], [2393], [2397], [2401], [2405], [2409], [2413], [2417], [2421], [2425], [2429], [2433], [2437], [2441], [2445], [2449], [2453], [2457], [2461], [2465], [2469], [2473], [2477], [2481], [2485], [2489], [2493], [2497], [2501], [2505], [2509], [2513], [2517], [2521], [2525], [2529], [2533], [2537], [2541], [2545], [2549], [2553], [2557], [2561], [2565], [2569], [2573], [2577], [2581], [2585], [2589], [2593], [2597], [2601], [2605], [2609], [2613], [2617], [2621], [2625], [2629], [2633], [2637], [2641], [2645], [2649], [2653], [2657], [2661], [2665], [2669], [2673], [2677], [2680], [3240], [3244], [3248], [3254], [3258], [3260], [3271], [3272], [3273], [3275], [3276] [2018-10-25 01:39:54,316 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:39:54,316 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:39:56,171 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 01:39:56,173 INFO L272 AbstractInterpreter]: Visited 157 different actions 308 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-10-25 01:39:56,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:39:56,221 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 01:39:57,540 INFO L232 lantSequenceWeakener]: Weakened 52 states. On average, predicates are now at 79.05% of their original sizes. [2018-10-25 01:39:57,541 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 01:39:58,533 INFO L413 sIntCurrentIteration]: We have 211 unified AI predicates [2018-10-25 01:39:58,533 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 01:39:58,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 01:39:58,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [4] total 16 [2018-10-25 01:39:58,535 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:39:58,535 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-25 01:39:58,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-25 01:39:58,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-10-25 01:39:58,536 INFO L87 Difference]: Start difference. First operand 32644 states and 42114 transitions. Second operand 14 states. [2018-10-25 01:40:17,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-25 01:40:17,148 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger: modulus not positive at java.math.BigInteger.mod(BigInteger.java:2458) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:154) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:100) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) 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:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:78) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.handleAssumeStatement(NonrelationalStatementProcessor.java:363) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processStatement(NonrelationalStatementProcessor.java:160) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:142) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:128) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:362) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:353) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.applyInternally(CompoundDomainPostOperator.java:306) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:131) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.applyPost(TermConjunctEvaluator.java:305) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$4(TermConjunctEvaluator.java:178) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computeFixpoint(TermConjunctEvaluator.java:198) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$1(TermConjunctEvaluator.java:150) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computePost(TermConjunctEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormanCachedPostOperation.applyPost(PoormanCachedPostOperation.java:308) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.applyPost(PoormansAbstractPostOperator.java:217) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:119) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:537) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalTransitionWithValidState(AbsIntHoareTripleChecker.java:352) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalAbsInt(AbsIntHoareTripleChecker.java:249) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternal(AbsIntHoareTripleChecker.java:181) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:673) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:473) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-10-25 01:40:17,153 INFO L168 Benchmark]: Toolchain (without parser) took 98931.80 ms. Allocated memory was 1.5 GB in the beginning and 3.7 GB in the end (delta: 2.2 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-10-25 01:40:17,155 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 01:40:17,155 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2163.08 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 203.5 MB). Peak memory consumption was 203.5 MB. Max. memory is 7.1 GB. [2018-10-25 01:40:17,156 INFO L168 Benchmark]: Boogie Procedure Inliner took 476.60 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 809.0 MB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 68.8 MB. Max. memory is 7.1 GB. [2018-10-25 01:40:17,157 INFO L168 Benchmark]: Boogie Preprocessor took 350.34 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 42.0 MB). Peak memory consumption was 42.0 MB. Max. memory is 7.1 GB. [2018-10-25 01:40:17,158 INFO L168 Benchmark]: RCFGBuilder took 11422.83 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 162.0 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -152.8 MB). Peak memory consumption was 649.3 MB. Max. memory is 7.1 GB. [2018-10-25 01:40:17,159 INFO L168 Benchmark]: TraceAbstraction took 84512.09 ms. Allocated memory was 2.5 GB in the beginning and 3.7 GB in the end (delta: 1.2 GB). Free memory was 2.4 GB in the beginning and 2.5 GB in the end (delta: -139.4 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2018-10-25 01:40:17,165 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2163.08 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 203.5 MB). Peak memory consumption was 203.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 476.60 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 809.0 MB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 68.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 350.34 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 42.0 MB). Peak memory consumption was 42.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 11422.83 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 162.0 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -152.8 MB). Peak memory consumption was 649.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 84512.09 ms. Allocated memory was 2.5 GB in the beginning and 3.7 GB in the end (delta: 1.2 GB). Free memory was 2.4 GB in the beginning and 2.5 GB in the end (delta: -139.4 MB). Peak memory consumption was 1.0 GB. 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...