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/Problem16_label04_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 23:42:47,169 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 23:42:47,172 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 23:42:47,194 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 23:42:47,194 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 23:42:47,195 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 23:42:47,199 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 23:42:47,201 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 23:42:47,204 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 23:42:47,206 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 23:42:47,207 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 23:42:47,207 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 23:42:47,208 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 23:42:47,209 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 23:42:47,214 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 23:42:47,214 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 23:42:47,216 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 23:42:47,225 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 23:42:47,229 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 23:42:47,233 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 23:42:47,234 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 23:42:47,236 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 23:42:47,238 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 23:42:47,238 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 23:42:47,238 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 23:42:47,239 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 23:42:47,240 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 23:42:47,241 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 23:42:47,241 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 23:42:47,243 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 23:42:47,243 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 23:42:47,243 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 23:42:47,244 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 23:42:47,244 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 23:42:47,245 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 23:42:47,245 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 23:42:47,246 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-24 23:42:47,260 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 23:42:47,261 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 23:42:47,261 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 23:42:47,262 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-24 23:42:47,262 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-24 23:42:47,262 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-24 23:42:47,262 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-24 23:42:47,262 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-24 23:42:47,263 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-24 23:42:47,263 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-24 23:42:47,263 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-24 23:42:47,263 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-24 23:42:47,263 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-24 23:42:47,264 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-24 23:42:47,264 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 23:42:47,264 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 23:42:47,265 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 23:42:47,265 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 23:42:47,265 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 23:42:47,265 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 23:42:47,265 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 23:42:47,266 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 23:42:47,266 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 23:42:47,266 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 23:42:47,266 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 23:42:47,266 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 23:42:47,269 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 23:42:47,269 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 23:42:47,269 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 23:42:47,269 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 23:42:47,270 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-24 23:42:47,270 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 23:42:47,270 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 23:42:47,270 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 23:42:47,270 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 23:42:47,270 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-24 23:42:47,312 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 23:42:47,329 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 23:42:47,335 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 23:42:47,336 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 23:42:47,337 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 23:42:47,337 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem16_label04_false-unreach-call.c [2018-10-24 23:42:47,405 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/3ded2b1b4/b8952982be804417b76f17506f0744ae/FLAG3fa3b1d25 [2018-10-24 23:42:48,106 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 23:42:48,106 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem16_label04_false-unreach-call.c [2018-10-24 23:42:48,122 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/3ded2b1b4/b8952982be804417b76f17506f0744ae/FLAG3fa3b1d25 [2018-10-24 23:42:48,137 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/3ded2b1b4/b8952982be804417b76f17506f0744ae [2018-10-24 23:42:48,148 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 23:42:48,149 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 23:42:48,150 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 23:42:48,151 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 23:42:48,154 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 23:42:48,155 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:42:48" (1/1) ... [2018-10-24 23:42:48,158 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14b692d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:48, skipping insertion in model container [2018-10-24 23:42:48,158 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:42:48" (1/1) ... [2018-10-24 23:42:48,168 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 23:42:48,261 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 23:42:49,115 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 23:42:49,120 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 23:42:49,389 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 23:42:49,411 INFO L193 MainTranslator]: Completed translation [2018-10-24 23:42:49,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:49 WrapperNode [2018-10-24 23:42:49,412 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 23:42:49,413 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 23:42:49,413 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 23:42:49,413 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 23:42:49,423 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:49" (1/1) ... [2018-10-24 23:42:49,481 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:49" (1/1) ... [2018-10-24 23:42:49,740 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 23:42:49,740 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 23:42:49,740 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 23:42:49,740 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 23:42:49,752 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:49" (1/1) ... [2018-10-24 23:42:49,752 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:49" (1/1) ... [2018-10-24 23:42:49,772 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:49" (1/1) ... [2018-10-24 23:42:49,773 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:49" (1/1) ... [2018-10-24 23:42:49,831 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:49" (1/1) ... [2018-10-24 23:42:49,864 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:49" (1/1) ... [2018-10-24 23:42:49,880 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:49" (1/1) ... [2018-10-24 23:42:49,896 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 23:42:49,896 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 23:42:49,897 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 23:42:49,897 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 23:42:49,898 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 23:42:49,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-24 23:42:49,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-24 23:42:49,964 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-24 23:42:49,964 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-24 23:42:49,964 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-24 23:42:49,964 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-24 23:42:49,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 23:42:49,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 23:42:49,965 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-24 23:42:49,965 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-24 23:42:56,392 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 23:42:56,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:42:56 BoogieIcfgContainer [2018-10-24 23:42:56,393 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 23:42:56,394 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 23:42:56,395 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 23:42:56,398 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 23:42:56,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:42:48" (1/3) ... [2018-10-24 23:42:56,399 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@433d0341 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:42:56, skipping insertion in model container [2018-10-24 23:42:56,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:49" (2/3) ... [2018-10-24 23:42:56,400 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@433d0341 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:42:56, skipping insertion in model container [2018-10-24 23:42:56,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:42:56" (3/3) ... [2018-10-24 23:42:56,402 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem16_label04_false-unreach-call.c [2018-10-24 23:42:56,412 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 23:42:56,421 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 23:42:56,438 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 23:42:56,479 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 23:42:56,480 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 23:42:56,480 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 23:42:56,480 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 23:42:56,480 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 23:42:56,480 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 23:42:56,480 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 23:42:56,481 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 23:42:56,512 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states. [2018-10-24 23:42:56,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-24 23:42:56,523 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:42:56,524 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] [2018-10-24 23:42:56,526 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:42:56,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:42:56,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1727147373, now seen corresponding path program 1 times [2018-10-24 23:42:56,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:42:56,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:42:56,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:42:56,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:42:56,587 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:42:56,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:42:56,970 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-24 23:42:57,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:42:57,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:42:57,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 23:42:57,078 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:42:57,084 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 23:42:57,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 23:42:57,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 23:42:57,105 INFO L87 Difference]: Start difference. First operand 410 states. Second operand 3 states. [2018-10-24 23:43:02,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:43:02,559 INFO L93 Difference]: Finished difference Result 1156 states and 2144 transitions. [2018-10-24 23:43:02,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 23:43:02,562 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-10-24 23:43:02,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:43:02,587 INFO L225 Difference]: With dead ends: 1156 [2018-10-24 23:43:02,587 INFO L226 Difference]: Without dead ends: 744 [2018-10-24 23:43:02,597 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 23:43:02,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2018-10-24 23:43:02,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 744. [2018-10-24 23:43:02,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2018-10-24 23:43:02,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1317 transitions. [2018-10-24 23:43:02,749 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1317 transitions. Word has length 35 [2018-10-24 23:43:02,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:43:02,750 INFO L481 AbstractCegarLoop]: Abstraction has 744 states and 1317 transitions. [2018-10-24 23:43:02,750 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 23:43:02,750 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1317 transitions. [2018-10-24 23:43:02,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-10-24 23:43:02,761 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:43:02,761 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:43:02,761 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:43:02,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:43:02,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1128673264, now seen corresponding path program 1 times [2018-10-24 23:43:02,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:43:02,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:43:02,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:43:02,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:43:02,766 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:43:02,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:43:03,100 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:43:03,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:43:03,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 23:43:03,101 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:43:03,103 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:43:03,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:43:03,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:43:03,104 INFO L87 Difference]: Start difference. First operand 744 states and 1317 transitions. Second operand 6 states. [2018-10-24 23:43:16,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:43:16,936 INFO L93 Difference]: Finished difference Result 2960 states and 5492 transitions. [2018-10-24 23:43:16,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-24 23:43:16,937 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 111 [2018-10-24 23:43:16,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:43:16,969 INFO L225 Difference]: With dead ends: 2960 [2018-10-24 23:43:16,969 INFO L226 Difference]: Without dead ends: 2222 [2018-10-24 23:43:16,984 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-24 23:43:16,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2222 states. [2018-10-24 23:43:17,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2222 to 2169. [2018-10-24 23:43:17,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2169 states. [2018-10-24 23:43:17,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2169 states to 2169 states and 3669 transitions. [2018-10-24 23:43:17,088 INFO L78 Accepts]: Start accepts. Automaton has 2169 states and 3669 transitions. Word has length 111 [2018-10-24 23:43:17,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:43:17,088 INFO L481 AbstractCegarLoop]: Abstraction has 2169 states and 3669 transitions. [2018-10-24 23:43:17,088 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 23:43:17,089 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 3669 transitions. [2018-10-24 23:43:17,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-24 23:43:17,092 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:43:17,092 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:43:17,092 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:43:17,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:43:17,093 INFO L82 PathProgramCache]: Analyzing trace with hash -950142376, now seen corresponding path program 1 times [2018-10-24 23:43:17,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:43:17,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:43:17,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:43:17,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:43:17,094 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:43:17,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:43:17,291 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:43:17,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:43:17,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 23:43:17,292 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:43:17,293 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:43:17,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:43:17,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:43:17,294 INFO L87 Difference]: Start difference. First operand 2169 states and 3669 transitions. Second operand 6 states. [2018-10-24 23:43:23,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:43:23,839 INFO L93 Difference]: Finished difference Result 8029 states and 14212 transitions. [2018-10-24 23:43:23,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 23:43:23,840 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 115 [2018-10-24 23:43:23,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:43:23,880 INFO L225 Difference]: With dead ends: 8029 [2018-10-24 23:43:23,881 INFO L226 Difference]: Without dead ends: 5866 [2018-10-24 23:43:23,915 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-24 23:43:23,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5866 states. [2018-10-24 23:43:24,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5866 to 5815. [2018-10-24 23:43:24,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5815 states. [2018-10-24 23:43:24,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5815 states to 5815 states and 8929 transitions. [2018-10-24 23:43:24,089 INFO L78 Accepts]: Start accepts. Automaton has 5815 states and 8929 transitions. Word has length 115 [2018-10-24 23:43:24,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:43:24,090 INFO L481 AbstractCegarLoop]: Abstraction has 5815 states and 8929 transitions. [2018-10-24 23:43:24,090 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 23:43:24,090 INFO L276 IsEmpty]: Start isEmpty. Operand 5815 states and 8929 transitions. [2018-10-24 23:43:24,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-10-24 23:43:24,093 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:43:24,093 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:43:24,093 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:43:24,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:43:24,094 INFO L82 PathProgramCache]: Analyzing trace with hash -905675908, now seen corresponding path program 1 times [2018-10-24 23:43:24,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:43:24,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:43:24,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:43:24,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:43:24,095 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:43:24,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:43:24,375 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:43:24,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:43:24,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 23:43:24,375 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:43:24,376 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:43:24,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:43:24,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:43:24,376 INFO L87 Difference]: Start difference. First operand 5815 states and 8929 transitions. Second operand 6 states. [2018-10-24 23:43:28,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:43:28,805 INFO L93 Difference]: Finished difference Result 13785 states and 22281 transitions. [2018-10-24 23:43:28,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 23:43:28,815 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 117 [2018-10-24 23:43:28,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:43:28,865 INFO L225 Difference]: With dead ends: 13785 [2018-10-24 23:43:28,865 INFO L226 Difference]: Without dead ends: 7976 [2018-10-24 23:43:28,915 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-24 23:43:28,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7976 states. [2018-10-24 23:43:29,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7976 to 7901. [2018-10-24 23:43:29,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7901 states. [2018-10-24 23:43:29,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7901 states to 7901 states and 11540 transitions. [2018-10-24 23:43:29,151 INFO L78 Accepts]: Start accepts. Automaton has 7901 states and 11540 transitions. Word has length 117 [2018-10-24 23:43:29,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:43:29,152 INFO L481 AbstractCegarLoop]: Abstraction has 7901 states and 11540 transitions. [2018-10-24 23:43:29,152 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 23:43:29,153 INFO L276 IsEmpty]: Start isEmpty. Operand 7901 states and 11540 transitions. [2018-10-24 23:43:29,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-24 23:43:29,157 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:43:29,158 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:43:29,158 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:43:29,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:43:29,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1836053929, now seen corresponding path program 1 times [2018-10-24 23:43:29,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:43:29,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:43:29,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:43:29,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:43:29,160 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:43:29,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:43:29,415 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-24 23:43:29,800 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:43:29,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:43:29,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 23:43:29,801 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:43:29,802 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:43:29,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:43:29,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:43:29,802 INFO L87 Difference]: Start difference. First operand 7901 states and 11540 transitions. Second operand 6 states. [2018-10-24 23:43:33,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:43:33,406 INFO L93 Difference]: Finished difference Result 19229 states and 30071 transitions. [2018-10-24 23:43:33,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 23:43:33,409 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 120 [2018-10-24 23:43:33,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:43:33,468 INFO L225 Difference]: With dead ends: 19229 [2018-10-24 23:43:33,469 INFO L226 Difference]: Without dead ends: 11334 [2018-10-24 23:43:33,495 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-24 23:43:33,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11334 states. [2018-10-24 23:43:33,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11334 to 11298. [2018-10-24 23:43:33,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11298 states. [2018-10-24 23:43:33,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11298 states to 11298 states and 16070 transitions. [2018-10-24 23:43:33,803 INFO L78 Accepts]: Start accepts. Automaton has 11298 states and 16070 transitions. Word has length 120 [2018-10-24 23:43:33,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:43:33,804 INFO L481 AbstractCegarLoop]: Abstraction has 11298 states and 16070 transitions. [2018-10-24 23:43:33,804 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 23:43:33,804 INFO L276 IsEmpty]: Start isEmpty. Operand 11298 states and 16070 transitions. [2018-10-24 23:43:33,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-24 23:43:33,805 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:43:33,806 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:43:33,809 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:43:33,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:43:33,810 INFO L82 PathProgramCache]: Analyzing trace with hash 116215820, now seen corresponding path program 1 times [2018-10-24 23:43:33,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:43:33,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:43:33,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:43:33,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:43:33,814 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:43:33,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:43:34,086 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-24 23:43:34,458 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:43:34,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:43:34,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 23:43:34,459 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:43:34,459 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:43:34,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:43:34,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:43:34,460 INFO L87 Difference]: Start difference. First operand 11298 states and 16070 transitions. Second operand 6 states. [2018-10-24 23:43:39,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:43:39,758 INFO L93 Difference]: Finished difference Result 24717 states and 35949 transitions. [2018-10-24 23:43:39,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 23:43:39,758 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 125 [2018-10-24 23:43:39,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:43:39,814 INFO L225 Difference]: With dead ends: 24717 [2018-10-24 23:43:39,815 INFO L226 Difference]: Without dead ends: 13425 [2018-10-24 23:43:39,848 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-24 23:43:39,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13425 states. [2018-10-24 23:43:40,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13425 to 13399. [2018-10-24 23:43:40,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13399 states. [2018-10-24 23:43:40,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13399 states to 13399 states and 17796 transitions. [2018-10-24 23:43:40,154 INFO L78 Accepts]: Start accepts. Automaton has 13399 states and 17796 transitions. Word has length 125 [2018-10-24 23:43:40,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:43:40,157 INFO L481 AbstractCegarLoop]: Abstraction has 13399 states and 17796 transitions. [2018-10-24 23:43:40,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 23:43:40,157 INFO L276 IsEmpty]: Start isEmpty. Operand 13399 states and 17796 transitions. [2018-10-24 23:43:40,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-24 23:43:40,158 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:43:40,159 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:43:40,161 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:43:40,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:43:40,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1715390160, now seen corresponding path program 1 times [2018-10-24 23:43:40,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:43:40,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:43:40,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:43:40,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:43:40,166 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:43:40,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:43:40,367 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 23:43:40,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 23:43:40,368 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 23:43:40,369 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 128 with the following transitions: [2018-10-24 23:43:40,371 INFO L202 CegarAbsIntRunner]: [0], [1], [180], [187], [195], [203], [211], [219], [227], [235], [243], [251], [259], [267], [275], [283], [291], [299], [307], [315], [323], [331], [339], [347], [355], [359], [361], [364], [372], [380], [388], [396], [404], [412], [420], [428], [436], [444], [452], [460], [468], [476], [484], [492], [500], [508], [516], [524], [532], [540], [548], [556], [564], [572], [580], [588], [596], [604], [612], [620], [628], [636], [644], [652], [660], [668], [673], [677], [681], [685], [689], [693], [697], [701], [705], [709], [713], [717], [721], [725], [729], [733], [737], [741], [745], [749], [753], [757], [760], [1552], [1556], [1560], [1566], [1570], [1572], [1579], [1580], [1581], [1583], [1584] [2018-10-24 23:43:40,426 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 23:43:40,426 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 23:43:41,429 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 23:43:41,431 INFO L272 AbstractInterpreter]: Visited 99 different actions 284 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-10-24 23:43:41,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:43:41,478 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 23:43:42,147 INFO L232 lantSequenceWeakener]: Weakened 25 states. On average, predicates are now at 81.56% of their original sizes. [2018-10-24 23:43:42,148 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 23:43:45,861 INFO L413 sIntCurrentIteration]: We have 126 unified AI predicates [2018-10-24 23:43:45,862 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 23:43:45,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 23:43:45,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [4] total 16 [2018-10-24 23:43:45,863 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:43:45,864 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-24 23:43:45,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-24 23:43:45,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-10-24 23:43:45,864 INFO L87 Difference]: Start difference. First operand 13399 states and 17796 transitions. Second operand 14 states. [2018-10-24 23:44:17,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-24 23:44:17,198 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:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:78) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java: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-24 23:44:17,203 INFO L168 Benchmark]: Toolchain (without parser) took 89055.07 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 3.7 GB in the end (delta: -2.3 GB). Peak memory consumption was 352.0 MB. Max. memory is 7.1 GB. [2018-10-24 23:44:17,205 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-24 23:44:17,205 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1261.51 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. [2018-10-24 23:44:17,206 INFO L168 Benchmark]: Boogie Procedure Inliner took 327.29 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 767.6 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -881.5 MB). Peak memory consumption was 28.8 MB. Max. memory is 7.1 GB. [2018-10-24 23:44:17,207 INFO L168 Benchmark]: Boogie Preprocessor took 155.96 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. [2018-10-24 23:44:17,208 INFO L168 Benchmark]: RCFGBuilder took 6497.07 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: 250.0 MB). Peak memory consumption was 250.0 MB. Max. memory is 7.1 GB. [2018-10-24 23:44:17,209 INFO L168 Benchmark]: TraceAbstraction took 80808.29 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.0 GB in the beginning and 3.7 GB in the end (delta: -1.8 GB). Peak memory consumption was 115.1 MB. Max. memory is 7.1 GB. [2018-10-24 23:44:17,214 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 1261.51 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 327.29 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 767.6 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -881.5 MB). Peak memory consumption was 28.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 155.96 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 6497.07 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: 250.0 MB). Peak memory consumption was 250.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 80808.29 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.0 GB in the beginning and 3.7 GB in the end (delta: -1.8 GB). Peak memory consumption was 115.1 MB. 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...