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/Problem11_label59_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 01:35:15,990 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 01:35:15,992 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 01:35:16,006 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 01:35:16,006 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 01:35:16,007 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 01:35:16,009 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 01:35:16,010 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 01:35:16,012 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 01:35:16,013 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 01:35:16,014 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 01:35:16,014 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 01:35:16,015 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 01:35:16,016 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 01:35:16,017 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 01:35:16,018 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 01:35:16,019 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 01:35:16,021 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 01:35:16,023 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 01:35:16,024 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 01:35:16,025 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 01:35:16,027 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 01:35:16,029 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 01:35:16,029 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 01:35:16,029 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 01:35:16,030 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 01:35:16,031 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 01:35:16,032 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 01:35:16,033 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 01:35:16,034 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 01:35:16,034 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 01:35:16,035 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 01:35:16,035 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 01:35:16,036 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 01:35:16,037 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 01:35:16,037 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 01:35:16,038 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:35:16,053 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 01:35:16,054 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 01:35:16,055 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 01:35:16,055 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 01:35:16,055 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 01:35:16,055 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 01:35:16,056 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 01:35:16,056 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 01:35:16,056 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 01:35:16,056 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 01:35:16,056 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 01:35:16,056 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 01:35:16,057 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 01:35:16,057 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 01:35:16,058 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 01:35:16,058 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 01:35:16,058 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 01:35:16,058 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 01:35:16,058 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 01:35:16,058 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 01:35:16,059 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 01:35:16,059 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 01:35:16,059 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 01:35:16,059 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 01:35:16,059 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 01:35:16,060 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 01:35:16,060 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 01:35:16,060 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 01:35:16,060 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 01:35:16,060 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 01:35:16,061 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 01:35:16,061 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 01:35:16,061 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 01:35:16,061 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 01:35:16,061 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 01:35:16,061 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 01:35:16,115 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 01:35:16,128 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 01:35:16,131 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 01:35:16,133 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 01:35:16,133 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 01:35:16,134 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label59_true-unreach-call.c [2018-10-25 01:35:16,198 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/3c61ce27d/3686094f148a4d8fb56da506330f9aa9/FLAG3b747e899 [2018-10-25 01:35:16,808 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 01:35:16,809 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label59_true-unreach-call.c [2018-10-25 01:35:16,827 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/3c61ce27d/3686094f148a4d8fb56da506330f9aa9/FLAG3b747e899 [2018-10-25 01:35:16,848 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/3c61ce27d/3686094f148a4d8fb56da506330f9aa9 [2018-10-25 01:35:16,863 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 01:35:16,865 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 01:35:16,867 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 01:35:16,867 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 01:35:16,872 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 01:35:16,873 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:35:16" (1/1) ... [2018-10-25 01:35:16,877 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b3e367d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:35:16, skipping insertion in model container [2018-10-25 01:35:16,877 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:35:16" (1/1) ... [2018-10-25 01:35:16,888 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 01:35:16,966 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 01:35:17,571 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:35:17,578 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 01:35:17,782 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:35:17,801 INFO L193 MainTranslator]: Completed translation [2018-10-25 01:35:17,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:35:17 WrapperNode [2018-10-25 01:35:17,802 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 01:35:17,803 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 01:35:17,803 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 01:35:17,803 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 01:35:17,813 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:35:17" (1/1) ... [2018-10-25 01:35:17,842 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:35:17" (1/1) ... [2018-10-25 01:35:18,087 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 01:35:18,088 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 01:35:18,088 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 01:35:18,088 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 01:35:18,099 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:35:17" (1/1) ... [2018-10-25 01:35:18,099 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:35:17" (1/1) ... [2018-10-25 01:35:18,120 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:35:17" (1/1) ... [2018-10-25 01:35:18,120 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:35:17" (1/1) ... [2018-10-25 01:35:18,185 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:35:17" (1/1) ... [2018-10-25 01:35:18,200 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:35:17" (1/1) ... [2018-10-25 01:35:18,223 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:35:17" (1/1) ... [2018-10-25 01:35:18,243 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 01:35:18,244 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 01:35:18,244 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 01:35:18,244 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 01:35:18,245 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:35:17" (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:35:18,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 01:35:18,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 01:35:18,314 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 01:35:18,314 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 01:35:18,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 01:35:18,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 01:35:18,316 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 01:35:18,316 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 01:35:23,291 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 01:35:23,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:35:23 BoogieIcfgContainer [2018-10-25 01:35:23,292 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 01:35:23,293 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 01:35:23,293 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 01:35:23,297 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 01:35:23,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 01:35:16" (1/3) ... [2018-10-25 01:35:23,298 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eb3dcad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:35:23, skipping insertion in model container [2018-10-25 01:35:23,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:35:17" (2/3) ... [2018-10-25 01:35:23,299 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eb3dcad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:35:23, skipping insertion in model container [2018-10-25 01:35:23,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:35:23" (3/3) ... [2018-10-25 01:35:23,301 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label59_true-unreach-call.c [2018-10-25 01:35:23,314 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 01:35:23,328 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 01:35:23,348 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 01:35:23,403 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 01:35:23,403 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 01:35:23,403 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 01:35:23,404 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 01:35:23,404 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 01:35:23,404 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 01:35:23,404 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 01:35:23,404 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 01:35:23,443 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states. [2018-10-25 01:35:23,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-25 01:35:23,455 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:35:23,456 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:35:23,459 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:35:23,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:35:23,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1395021716, now seen corresponding path program 1 times [2018-10-25 01:35:23,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:35:23,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:35:23,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:35:23,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:35:23,536 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:35:23,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:35:23,961 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:35:23,990 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:35:23,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:35:23,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 01:35:23,993 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:35:23,999 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 01:35:24,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 01:35:24,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 01:35:24,019 INFO L87 Difference]: Start difference. First operand 293 states. Second operand 3 states. [2018-10-25 01:35:26,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:35:26,676 INFO L93 Difference]: Finished difference Result 785 states and 1378 transitions. [2018-10-25 01:35:26,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 01:35:26,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-10-25 01:35:26,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:35:26,700 INFO L225 Difference]: With dead ends: 785 [2018-10-25 01:35:26,700 INFO L226 Difference]: Without dead ends: 490 [2018-10-25 01:35:26,708 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 01:35:26,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2018-10-25 01:35:26,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 482. [2018-10-25 01:35:26,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2018-10-25 01:35:26,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 841 transitions. [2018-10-25 01:35:26,815 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 841 transitions. Word has length 66 [2018-10-25 01:35:26,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:35:26,816 INFO L481 AbstractCegarLoop]: Abstraction has 482 states and 841 transitions. [2018-10-25 01:35:26,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 01:35:26,817 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 841 transitions. [2018-10-25 01:35:26,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-25 01:35:26,826 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:35:26,827 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:35:26,827 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:35:26,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:35:26,828 INFO L82 PathProgramCache]: Analyzing trace with hash -994011168, now seen corresponding path program 1 times [2018-10-25 01:35:26,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:35:26,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:35:26,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:35:26,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:35:26,830 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:35:26,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:35:27,254 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:35:27,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:35:27,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:35:27,255 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:35:27,257 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:35:27,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:35:27,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:35:27,259 INFO L87 Difference]: Start difference. First operand 482 states and 841 transitions. Second operand 6 states. [2018-10-25 01:35:33,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:35:33,156 INFO L93 Difference]: Finished difference Result 1762 states and 3209 transitions. [2018-10-25 01:35:33,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-25 01:35:33,157 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 136 [2018-10-25 01:35:33,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:35:33,172 INFO L225 Difference]: With dead ends: 1762 [2018-10-25 01:35:33,172 INFO L226 Difference]: Without dead ends: 1286 [2018-10-25 01:35:33,178 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-10-25 01:35:33,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2018-10-25 01:35:33,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 1252. [2018-10-25 01:35:33,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1252 states. [2018-10-25 01:35:33,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 1988 transitions. [2018-10-25 01:35:33,269 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 1988 transitions. Word has length 136 [2018-10-25 01:35:33,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:35:33,270 INFO L481 AbstractCegarLoop]: Abstraction has 1252 states and 1988 transitions. [2018-10-25 01:35:33,270 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:35:33,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1988 transitions. [2018-10-25 01:35:33,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-25 01:35:33,281 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:35:33,281 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:35:33,282 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:35:33,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:35:33,282 INFO L82 PathProgramCache]: Analyzing trace with hash -2016062845, now seen corresponding path program 1 times [2018-10-25 01:35:33,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:35:33,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:35:33,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:35:33,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:35:33,284 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:35:33,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:35:33,523 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:35:33,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:35:33,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:35:33,524 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:35:33,525 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:35:33,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:35:33,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:35:33,528 INFO L87 Difference]: Start difference. First operand 1252 states and 1988 transitions. Second operand 6 states. [2018-10-25 01:35:36,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:35:36,704 INFO L93 Difference]: Finished difference Result 3466 states and 5570 transitions. [2018-10-25 01:35:36,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:35:36,706 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 139 [2018-10-25 01:35:36,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:35:36,725 INFO L225 Difference]: With dead ends: 3466 [2018-10-25 01:35:36,725 INFO L226 Difference]: Without dead ends: 2220 [2018-10-25 01:35:36,733 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-25 01:35:36,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2220 states. [2018-10-25 01:35:36,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2220 to 2195. [2018-10-25 01:35:36,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2195 states. [2018-10-25 01:35:36,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2195 states to 2195 states and 3227 transitions. [2018-10-25 01:35:36,807 INFO L78 Accepts]: Start accepts. Automaton has 2195 states and 3227 transitions. Word has length 139 [2018-10-25 01:35:36,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:35:36,808 INFO L481 AbstractCegarLoop]: Abstraction has 2195 states and 3227 transitions. [2018-10-25 01:35:36,808 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:35:36,808 INFO L276 IsEmpty]: Start isEmpty. Operand 2195 states and 3227 transitions. [2018-10-25 01:35:36,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-10-25 01:35:36,813 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:35:36,813 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:35:36,814 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:35:36,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:35:36,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1284370280, now seen corresponding path program 1 times [2018-10-25 01:35:36,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:35:36,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:35:36,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:35:36,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:35:36,816 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:35:36,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:35:37,511 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:35:37,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:35:37,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-25 01:35:37,512 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:35:37,513 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-25 01:35:37,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-25 01:35:37,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-10-25 01:35:37,514 INFO L87 Difference]: Start difference. First operand 2195 states and 3227 transitions. Second operand 7 states. [2018-10-25 01:35:43,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:35:43,190 INFO L93 Difference]: Finished difference Result 5926 states and 8993 transitions. [2018-10-25 01:35:43,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-25 01:35:43,191 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 140 [2018-10-25 01:35:43,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:35:43,217 INFO L225 Difference]: With dead ends: 5926 [2018-10-25 01:35:43,217 INFO L226 Difference]: Without dead ends: 3737 [2018-10-25 01:35:43,233 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-10-25 01:35:43,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3737 states. [2018-10-25 01:35:43,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3737 to 3563. [2018-10-25 01:35:43,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3563 states. [2018-10-25 01:35:43,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3563 states to 3563 states and 4993 transitions. [2018-10-25 01:35:43,341 INFO L78 Accepts]: Start accepts. Automaton has 3563 states and 4993 transitions. Word has length 140 [2018-10-25 01:35:43,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:35:43,342 INFO L481 AbstractCegarLoop]: Abstraction has 3563 states and 4993 transitions. [2018-10-25 01:35:43,342 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-25 01:35:43,342 INFO L276 IsEmpty]: Start isEmpty. Operand 3563 states and 4993 transitions. [2018-10-25 01:35:43,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-10-25 01:35:43,346 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:35:43,346 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:43,346 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:35:43,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:35:43,347 INFO L82 PathProgramCache]: Analyzing trace with hash -2129360111, now seen corresponding path program 1 times [2018-10-25 01:35:43,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:35:43,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:35:43,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:35:43,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:35:43,348 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:35:43,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:35:43,518 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:35:43,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:35:43,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 01:35:43,518 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:35:43,519 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 01:35:43,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 01:35:43,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 01:35:43,520 INFO L87 Difference]: Start difference. First operand 3563 states and 4993 transitions. Second operand 3 states. [2018-10-25 01:35:46,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:35:46,333 INFO L93 Difference]: Finished difference Result 8043 states and 11700 transitions. [2018-10-25 01:35:46,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 01:35:46,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2018-10-25 01:35:46,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:35:46,364 INFO L225 Difference]: With dead ends: 8043 [2018-10-25 01:35:46,365 INFO L226 Difference]: Without dead ends: 4486 [2018-10-25 01:35:46,379 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 01:35:46,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2018-10-25 01:35:46,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 4425. [2018-10-25 01:35:46,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4425 states. [2018-10-25 01:35:46,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4425 states to 4425 states and 5873 transitions. [2018-10-25 01:35:46,486 INFO L78 Accepts]: Start accepts. Automaton has 4425 states and 5873 transitions. Word has length 198 [2018-10-25 01:35:46,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:35:46,487 INFO L481 AbstractCegarLoop]: Abstraction has 4425 states and 5873 transitions. [2018-10-25 01:35:46,487 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 01:35:46,487 INFO L276 IsEmpty]: Start isEmpty. Operand 4425 states and 5873 transitions. [2018-10-25 01:35:46,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-10-25 01:35:46,492 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:35:46,492 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:46,492 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:35:46,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:35:46,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1377359462, now seen corresponding path program 1 times [2018-10-25 01:35:46,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:35:46,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:35:46,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:35:46,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:35:46,495 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:35:46,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:35:46,792 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:35:46,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:35:46,793 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:35:46,794 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 215 with the following transitions: [2018-10-25 01:35:46,796 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [429], [431], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [762], [766], [777], [781], [785], [789], [793], [797], [808], [812], [816], [820], [824], [828], [832], [843], [847], [851], [862], [866], [869], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-10-25 01:35:46,868 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:35:46,868 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:35:47,813 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 01:35:47,815 INFO L272 AbstractInterpreter]: Visited 156 different actions 305 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-10-25 01:35:47,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:35:47,849 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 01:35:47,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:35:47,850 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 01:35:47,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:35:47,866 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 01:35:47,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:35:47,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 01:35:50,410 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:35:50,411 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 01:35:50,664 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:35:50,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-10-25 01:35:50,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7, 6] total 9 [2018-10-25 01:35:50,696 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:35:50,696 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 01:35:50,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 01:35:50,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=48, Unknown=1, NotChecked=0, Total=72 [2018-10-25 01:35:50,698 INFO L87 Difference]: Start difference. First operand 4425 states and 5873 transitions. Second operand 3 states. [2018-10-25 01:35:53,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:35:53,949 INFO L93 Difference]: Finished difference Result 10062 states and 13958 transitions. [2018-10-25 01:35:53,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 01:35:53,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 214 [2018-10-25 01:35:53,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:35:53,978 INFO L225 Difference]: With dead ends: 10062 [2018-10-25 01:35:53,979 INFO L226 Difference]: Without dead ends: 5643 [2018-10-25 01:35:54,003 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 426 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=23, Invalid=48, Unknown=1, NotChecked=0, Total=72 [2018-10-25 01:35:54,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5643 states. [2018-10-25 01:35:54,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5643 to 5601. [2018-10-25 01:35:54,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5601 states. [2018-10-25 01:35:54,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5601 states to 5601 states and 7759 transitions. [2018-10-25 01:35:54,141 INFO L78 Accepts]: Start accepts. Automaton has 5601 states and 7759 transitions. Word has length 214 [2018-10-25 01:35:54,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:35:54,142 INFO L481 AbstractCegarLoop]: Abstraction has 5601 states and 7759 transitions. [2018-10-25 01:35:54,142 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 01:35:54,142 INFO L276 IsEmpty]: Start isEmpty. Operand 5601 states and 7759 transitions. [2018-10-25 01:35:54,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2018-10-25 01:35:54,153 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:35:54,153 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-25 01:35:54,154 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:35:54,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:35:54,154 INFO L82 PathProgramCache]: Analyzing trace with hash -2132579400, now seen corresponding path program 1 times [2018-10-25 01:35:54,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:35:54,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:35:54,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:35:54,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:35:54,156 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:35:54,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:35:54,764 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 213 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:35:54,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:35:54,764 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:35:54,765 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 296 with the following transitions: [2018-10-25 01:35:54,765 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [429], [431], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [602], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [762], [766], [769], [772], [776], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-10-25 01:35:54,776 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:35:54,777 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:35:54,932 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.ArithmeticException: BigInteger: modulus not positive at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:391) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.handleInfeasibleCase(BaseRefinementStrategy.java:296) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:206) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:435) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.ArithmeticException: BigInteger: modulus not positive at java.math.BigInteger.mod(BigInteger.java:2458) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:154) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:100) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:78) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.handleAssumeStatement(NonrelationalStatementProcessor.java:363) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processStatement(NonrelationalStatementProcessor.java:160) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:142) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:128) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:362) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:353) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.applyInternally(CompoundDomainPostOperator.java:306) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:131) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.applyPost(TermConjunctEvaluator.java:305) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$4(TermConjunctEvaluator.java:178) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computeFixpoint(TermConjunctEvaluator.java:198) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$1(TermConjunctEvaluator.java:150) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computePost(TermConjunctEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormanCachedPostOperation.applyPost(PoormanCachedPostOperation.java:308) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.applyPost(PoormansAbstractPostOperator.java:217) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:119) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:537) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateAbstractPost(FixpointEngine.java:249) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateFixpoint(FixpointEngine.java:134) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.run(FixpointEngine.java:105) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.tool.AbstractInterpreter.runWithoutTimeoutAndResults(AbstractInterpreter.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner.generateFixpoints(CegarAbsIntRunner.java:217) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.constructInterpolantGenerator(BaseTaipanRefinementStrategy.java:385) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getInterpolantGenerator(BaseTaipanRefinementStrategy.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:380) ... 20 more [2018-10-25 01:35:54,942 INFO L168 Benchmark]: Toolchain (without parser) took 38078.00 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -758.5 MB). Peak memory consumption was 346.7 MB. Max. memory is 7.1 GB. [2018-10-25 01:35:54,943 INFO L168 Benchmark]: CDTParser took 0.18 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:35:54,944 INFO L168 Benchmark]: CACSL2BoogieTranslator took 935.76 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 63.4 MB). Peak memory consumption was 63.4 MB. Max. memory is 7.1 GB. [2018-10-25 01:35:54,945 INFO L168 Benchmark]: Boogie Procedure Inliner took 284.33 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 748.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -842.5 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. [2018-10-25 01:35:54,946 INFO L168 Benchmark]: Boogie Preprocessor took 155.84 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 01:35:54,948 INFO L168 Benchmark]: RCFGBuilder took 5048.25 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 186.9 MB). Peak memory consumption was 186.9 MB. Max. memory is 7.1 GB. [2018-10-25 01:35:54,949 INFO L168 Benchmark]: TraceAbstraction took 31647.66 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 356.5 MB). Free memory was 2.0 GB in the beginning and 2.2 GB in the end (delta: -166.4 MB). Peak memory consumption was 190.1 MB. Max. memory is 7.1 GB. [2018-10-25 01:35:54,957 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.18 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 935.76 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 63.4 MB). Peak memory consumption was 63.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 284.33 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 748.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -842.5 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 155.84 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 5048.25 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 186.9 MB). Peak memory consumption was 186.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 31647.66 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 356.5 MB). Free memory was 2.0 GB in the beginning and 2.2 GB in the end (delta: -166.4 MB). Peak memory consumption was 190.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.ArithmeticException: BigInteger: modulus not positive de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.ArithmeticException: BigInteger: modulus not positive: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:391) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...