java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label49.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-09 07:04:35,492 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-09 07:04:35,494 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-09 07:04:35,506 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-09 07:04:35,507 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-09 07:04:35,508 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-09 07:04:35,509 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-09 07:04:35,511 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-09 07:04:35,513 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-09 07:04:35,514 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-09 07:04:35,515 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-09 07:04:35,516 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-09 07:04:35,516 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-09 07:04:35,517 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-09 07:04:35,518 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-09 07:04:35,519 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-09 07:04:35,520 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-09 07:04:35,521 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-09 07:04:35,523 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-09 07:04:35,525 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-09 07:04:35,527 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-09 07:04:35,528 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-09 07:04:35,529 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-09 07:04:35,530 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-09 07:04:35,532 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-09 07:04:35,533 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-09 07:04:35,533 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-09 07:04:35,534 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-09 07:04:35,534 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-09 07:04:35,535 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-09 07:04:35,535 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-09 07:04:35,536 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-09 07:04:35,537 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-09 07:04:35,538 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-09 07:04:35,539 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-09 07:04:35,539 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-09 07:04:35,540 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-09 07:04:35,540 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-09 07:04:35,540 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-09 07:04:35,541 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-09 07:04:35,542 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-09 07:04:35,543 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-09 07:04:35,567 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-09 07:04:35,568 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-09 07:04:35,568 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-09 07:04:35,568 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-09 07:04:35,569 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-09 07:04:35,569 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-09 07:04:35,570 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-09 07:04:35,570 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-09 07:04:35,570 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-09 07:04:35,570 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-09 07:04:35,573 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-09 07:04:35,573 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-09 07:04:35,573 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-09 07:04:35,574 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-09 07:04:35,574 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-09 07:04:35,574 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-09 07:04:35,574 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-09 07:04:35,574 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-09 07:04:35,575 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-09 07:04:35,575 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-09 07:04:35,575 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-09 07:04:35,576 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-09 07:04:35,576 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-09 07:04:35,576 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 07:04:35,576 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-09 07:04:35,576 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-09 07:04:35,577 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-09 07:04:35,577 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-09 07:04:35,577 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-09 07:04:35,577 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-09 07:04:35,632 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-09 07:04:35,643 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-09 07:04:35,647 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-09 07:04:35,648 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-09 07:04:35,649 INFO L275 PluginConnector]: CDTParser initialized [2019-09-09 07:04:35,649 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label49.c [2019-09-09 07:04:35,710 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1f44ce49/236592c09b964cb69a7a1795cd388175/FLAG6237b53f6 [2019-09-09 07:04:36,293 INFO L306 CDTParser]: Found 1 translation units. [2019-09-09 07:04:36,295 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label49.c [2019-09-09 07:04:36,315 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1f44ce49/236592c09b964cb69a7a1795cd388175/FLAG6237b53f6 [2019-09-09 07:04:36,539 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1f44ce49/236592c09b964cb69a7a1795cd388175 [2019-09-09 07:04:36,549 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-09 07:04:36,550 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-09 07:04:36,551 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-09 07:04:36,551 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-09 07:04:36,555 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-09 07:04:36,556 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 07:04:36" (1/1) ... [2019-09-09 07:04:36,559 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@276c47f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 07:04:36, skipping insertion in model container [2019-09-09 07:04:36,560 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 07:04:36" (1/1) ... [2019-09-09 07:04:36,568 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-09 07:04:36,619 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-09 07:04:37,157 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 07:04:37,166 INFO L188 MainTranslator]: Completed pre-run [2019-09-09 07:04:37,263 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 07:04:37,286 INFO L192 MainTranslator]: Completed translation [2019-09-09 07:04:37,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 07:04:37 WrapperNode [2019-09-09 07:04:37,287 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-09 07:04:37,288 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-09 07:04:37,288 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-09 07:04:37,288 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-09 07:04:37,300 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 07:04:37" (1/1) ... [2019-09-09 07:04:37,300 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 07:04:37" (1/1) ... [2019-09-09 07:04:37,319 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 07:04:37" (1/1) ... [2019-09-09 07:04:37,319 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 07:04:37" (1/1) ... [2019-09-09 07:04:37,367 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 07:04:37" (1/1) ... [2019-09-09 07:04:37,384 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 07:04:37" (1/1) ... [2019-09-09 07:04:37,389 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 07:04:37" (1/1) ... [2019-09-09 07:04:37,396 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-09 07:04:37,396 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-09 07:04:37,397 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-09 07:04:37,397 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-09 07:04:37,398 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 07:04:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-09-09 07:04:37,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-09 07:04:37,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-09 07:04:37,452 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-09 07:04:37,452 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-09 07:04:37,452 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-09 07:04:37,452 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-09 07:04:37,452 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-09 07:04:37,452 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-09 07:04:37,452 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-09 07:04:37,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-09 07:04:37,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-09 07:04:38,729 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-09 07:04:38,729 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-09 07:04:38,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 07:04:38 BoogieIcfgContainer [2019-09-09 07:04:38,731 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-09 07:04:38,732 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-09 07:04:38,732 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-09 07:04:38,736 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-09 07:04:38,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.09 07:04:36" (1/3) ... [2019-09-09 07:04:38,737 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5db94537 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 07:04:38, skipping insertion in model container [2019-09-09 07:04:38,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 07:04:37" (2/3) ... [2019-09-09 07:04:38,738 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5db94537 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 07:04:38, skipping insertion in model container [2019-09-09 07:04:38,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 07:04:38" (3/3) ... [2019-09-09 07:04:38,740 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label49.c [2019-09-09 07:04:38,750 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-09 07:04:38,760 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-09 07:04:38,779 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-09 07:04:38,805 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-09 07:04:38,806 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-09 07:04:38,806 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-09 07:04:38,806 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-09 07:04:38,807 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-09 07:04:38,807 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-09 07:04:38,807 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-09 07:04:38,807 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-09 07:04:38,831 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states. [2019-09-09 07:04:38,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-09 07:04:38,851 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 07:04:38,852 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 07:04:38,854 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 07:04:38,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 07:04:38,861 INFO L82 PathProgramCache]: Analyzing trace with hash 2010725689, now seen corresponding path program 1 times [2019-09-09 07:04:38,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 07:04:38,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 07:04:38,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 07:04:38,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 07:04:38,905 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 07:04:39,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 07:04:39,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 07:04:39,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 07:04:39,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 07:04:39,334 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 07:04:39,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 07:04:39,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 07:04:39,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 07:04:39,362 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 3 states. [2019-09-09 07:04:40,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 07:04:40,359 INFO L93 Difference]: Finished difference Result 388 states and 554 transitions. [2019-09-09 07:04:40,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 07:04:40,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2019-09-09 07:04:40,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 07:04:40,393 INFO L225 Difference]: With dead ends: 388 [2019-09-09 07:04:40,394 INFO L226 Difference]: Without dead ends: 320 [2019-09-09 07:04:40,398 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 07:04:40,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-09-09 07:04:40,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-09-09 07:04:40,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-09-09 07:04:40,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 465 transitions. [2019-09-09 07:04:40,515 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 465 transitions. Word has length 131 [2019-09-09 07:04:40,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 07:04:40,518 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 465 transitions. [2019-09-09 07:04:40,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 07:04:40,518 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 465 transitions. [2019-09-09 07:04:40,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-09 07:04:40,531 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 07:04:40,531 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 07:04:40,532 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 07:04:40,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 07:04:40,534 INFO L82 PathProgramCache]: Analyzing trace with hash -2056186306, now seen corresponding path program 1 times [2019-09-09 07:04:40,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 07:04:40,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 07:04:40,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 07:04:40,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 07:04:40,536 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 07:04:40,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 07:04:40,978 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 07:04:40,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 07:04:40,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 07:04:40,978 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 07:04:40,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 07:04:40,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 07:04:40,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 07:04:40,983 INFO L87 Difference]: Start difference. First operand 320 states and 465 transitions. Second operand 5 states. [2019-09-09 07:04:41,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 07:04:41,679 INFO L93 Difference]: Finished difference Result 407 states and 552 transitions. [2019-09-09 07:04:41,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 07:04:41,680 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 139 [2019-09-09 07:04:41,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 07:04:41,683 INFO L225 Difference]: With dead ends: 407 [2019-09-09 07:04:41,683 INFO L226 Difference]: Without dead ends: 320 [2019-09-09 07:04:41,684 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 07:04:41,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-09-09 07:04:41,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-09-09 07:04:41,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-09-09 07:04:41,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 461 transitions. [2019-09-09 07:04:41,697 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 461 transitions. Word has length 139 [2019-09-09 07:04:41,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 07:04:41,698 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 461 transitions. [2019-09-09 07:04:41,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 07:04:41,698 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 461 transitions. [2019-09-09 07:04:41,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-09 07:04:41,701 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 07:04:41,701 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 07:04:41,701 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 07:04:41,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 07:04:41,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1041677834, now seen corresponding path program 1 times [2019-09-09 07:04:41,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 07:04:41,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 07:04:41,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 07:04:41,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 07:04:41,704 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 07:04:41,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 07:04:41,996 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 07:04:41,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 07:04:41,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 07:04:41,997 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 07:04:41,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 07:04:41,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 07:04:41,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 07:04:41,999 INFO L87 Difference]: Start difference. First operand 320 states and 461 transitions. Second operand 5 states. [2019-09-09 07:04:42,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 07:04:42,771 INFO L93 Difference]: Finished difference Result 403 states and 544 transitions. [2019-09-09 07:04:42,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 07:04:42,772 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 145 [2019-09-09 07:04:42,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 07:04:42,776 INFO L225 Difference]: With dead ends: 403 [2019-09-09 07:04:42,776 INFO L226 Difference]: Without dead ends: 320 [2019-09-09 07:04:42,777 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 07:04:42,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-09-09 07:04:42,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-09-09 07:04:42,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-09-09 07:04:42,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 455 transitions. [2019-09-09 07:04:42,787 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 455 transitions. Word has length 145 [2019-09-09 07:04:42,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 07:04:42,788 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 455 transitions. [2019-09-09 07:04:42,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 07:04:42,788 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 455 transitions. [2019-09-09 07:04:42,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-09 07:04:42,790 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 07:04:42,791 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 07:04:42,791 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 07:04:42,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 07:04:42,792 INFO L82 PathProgramCache]: Analyzing trace with hash -33342687, now seen corresponding path program 1 times [2019-09-09 07:04:42,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 07:04:42,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 07:04:42,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 07:04:42,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 07:04:42,794 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 07:04:42,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 07:04:42,910 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 07:04:42,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 07:04:42,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-09 07:04:42,911 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 07:04:42,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 07:04:42,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 07:04:42,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-09 07:04:42,912 INFO L87 Difference]: Start difference. First operand 320 states and 455 transitions. Second operand 6 states. [2019-09-09 07:04:43,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 07:04:43,761 INFO L93 Difference]: Finished difference Result 637 states and 893 transitions. [2019-09-09 07:04:43,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-09 07:04:43,764 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 153 [2019-09-09 07:04:43,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 07:04:43,769 INFO L225 Difference]: With dead ends: 637 [2019-09-09 07:04:43,769 INFO L226 Difference]: Without dead ends: 637 [2019-09-09 07:04:43,769 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-09 07:04:43,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2019-09-09 07:04:43,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 626. [2019-09-09 07:04:43,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-09-09 07:04:43,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 870 transitions. [2019-09-09 07:04:43,794 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 870 transitions. Word has length 153 [2019-09-09 07:04:43,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 07:04:43,794 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 870 transitions. [2019-09-09 07:04:43,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 07:04:43,795 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 870 transitions. [2019-09-09 07:04:43,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-09 07:04:43,798 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 07:04:43,798 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 07:04:43,798 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 07:04:43,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 07:04:43,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1756128357, now seen corresponding path program 1 times [2019-09-09 07:04:43,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 07:04:43,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 07:04:43,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 07:04:43,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 07:04:43,800 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 07:04:43,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 07:04:44,009 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 07:04:44,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 07:04:44,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 07:04:44,010 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 07:04:44,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 07:04:44,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 07:04:44,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 07:04:44,011 INFO L87 Difference]: Start difference. First operand 626 states and 870 transitions. Second operand 5 states. [2019-09-09 07:04:44,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 07:04:44,745 INFO L93 Difference]: Finished difference Result 710 states and 956 transitions. [2019-09-09 07:04:44,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 07:04:44,748 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 155 [2019-09-09 07:04:44,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 07:04:44,752 INFO L225 Difference]: With dead ends: 710 [2019-09-09 07:04:44,752 INFO L226 Difference]: Without dead ends: 626 [2019-09-09 07:04:44,755 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 07:04:44,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-09-09 07:04:44,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-09-09 07:04:44,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-09-09 07:04:44,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 858 transitions. [2019-09-09 07:04:44,792 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 858 transitions. Word has length 155 [2019-09-09 07:04:44,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 07:04:44,793 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 858 transitions. [2019-09-09 07:04:44,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 07:04:44,793 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 858 transitions. [2019-09-09 07:04:44,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-09 07:04:44,802 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 07:04:44,803 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 07:04:44,803 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 07:04:44,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 07:04:44,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1935651415, now seen corresponding path program 1 times [2019-09-09 07:04:44,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 07:04:44,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 07:04:44,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 07:04:44,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 07:04:44,808 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 07:04:44,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 07:04:45,054 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 07:04:45,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 07:04:45,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 07:04:45,055 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 07:04:45,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 07:04:45,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 07:04:45,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 07:04:45,057 INFO L87 Difference]: Start difference. First operand 626 states and 858 transitions. Second operand 5 states. [2019-09-09 07:04:45,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 07:04:45,724 INFO L93 Difference]: Finished difference Result 712 states and 946 transitions. [2019-09-09 07:04:45,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 07:04:45,725 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2019-09-09 07:04:45,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 07:04:45,729 INFO L225 Difference]: With dead ends: 712 [2019-09-09 07:04:45,729 INFO L226 Difference]: Without dead ends: 626 [2019-09-09 07:04:45,730 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 07:04:45,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-09-09 07:04:45,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-09-09 07:04:45,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-09-09 07:04:45,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 842 transitions. [2019-09-09 07:04:45,748 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 842 transitions. Word has length 157 [2019-09-09 07:04:45,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 07:04:45,749 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 842 transitions. [2019-09-09 07:04:45,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 07:04:45,749 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 842 transitions. [2019-09-09 07:04:45,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-09 07:04:45,752 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 07:04:45,753 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 07:04:45,753 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 07:04:45,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 07:04:45,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1918345167, now seen corresponding path program 1 times [2019-09-09 07:04:45,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 07:04:45,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 07:04:45,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 07:04:45,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 07:04:45,755 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 07:04:45,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 07:04:45,844 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 07:04:45,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 07:04:45,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-09 07:04:45,853 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 07:04:45,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 07:04:45,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 07:04:45,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-09 07:04:45,854 INFO L87 Difference]: Start difference. First operand 626 states and 842 transitions. Second operand 6 states. [2019-09-09 07:04:46,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 07:04:46,623 INFO L93 Difference]: Finished difference Result 1238 states and 1702 transitions. [2019-09-09 07:04:46,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-09 07:04:46,624 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 161 [2019-09-09 07:04:46,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 07:04:46,631 INFO L225 Difference]: With dead ends: 1238 [2019-09-09 07:04:46,631 INFO L226 Difference]: Without dead ends: 1238 [2019-09-09 07:04:46,632 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-09 07:04:46,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2019-09-09 07:04:46,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1218. [2019-09-09 07:04:46,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1218 states. [2019-09-09 07:04:46,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1635 transitions. [2019-09-09 07:04:46,667 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1635 transitions. Word has length 161 [2019-09-09 07:04:46,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 07:04:46,667 INFO L475 AbstractCegarLoop]: Abstraction has 1218 states and 1635 transitions. [2019-09-09 07:04:46,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 07:04:46,667 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1635 transitions. [2019-09-09 07:04:46,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-09 07:04:46,673 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 07:04:46,673 INFO L399 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 07:04:46,674 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 07:04:46,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 07:04:46,674 INFO L82 PathProgramCache]: Analyzing trace with hash 264500657, now seen corresponding path program 1 times [2019-09-09 07:04:46,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 07:04:46,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 07:04:46,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 07:04:46,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 07:04:46,676 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 07:04:46,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 07:04:46,804 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 86 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 07:04:46,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 07:04:46,804 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 07:04:46,805 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 196 with the following transitions: [2019-09-09 07:04:46,807 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [107], [108], [112], [116], [120], [123], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [727], [729], [863], [867], [876], [880], [882], [887], [888], [889], [891], [892] [2019-09-09 07:04:46,857 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 07:04:46,857 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 07:11:35,964 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-09 07:11:35,967 INFO L272 AbstractInterpreter]: Visited 135 different actions 264 times. Merged at 4 different actions 4 times. Never widened. Performed 538 root evaluator evaluations with a maximum evaluation depth of 18. Performed 538 inverse root evaluator evaluations with a maximum inverse evaluation depth of 18. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2019-09-09 07:11:35,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 07:11:35,972 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-09 07:17:01,835 INFO L227 lantSequenceWeakener]: Weakened 192 states. On average, predicates are now at 81.02% of their original sizes. [2019-09-09 07:17:01,836 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-09 07:17:02,032 INFO L420 sIntCurrentIteration]: We unified 194 AI predicates to 194 [2019-09-09 07:17:02,032 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-09 07:17:02,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-09 07:17:02,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [6] total 20 [2019-09-09 07:17:02,033 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 07:17:02,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-09 07:17:02,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-09 07:17:02,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2019-09-09 07:17:02,035 INFO L87 Difference]: Start difference. First operand 1218 states and 1635 transitions. Second operand 16 states. [2019-09-09 07:17:19,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-09 07:17:19,130 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: There is no value of variable ~a25~0. at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalState.getValue(NonrelationalState.java:147) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.SingletonVariableExpressionEvaluator.lambda$0(SingletonVariableExpressionEvaluator.java:83) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.util.typeutils.TypeUtils.applyVariableFunctionPerType(TypeUtils.java:114) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.util.typeutils.TypeUtils.applyVariableFunction(TypeUtils.java:103) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.SingletonVariableExpressionEvaluator.evaluate(SingletonVariableExpressionEvaluator.java:89) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.SingletonVariableExpressionEvaluator.evaluate(SingletonVariableExpressionEvaluator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:88) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:88) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:90) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:88) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:88) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:90) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:88) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:88) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:88) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:88) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:88) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:88) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:88) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:88) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:88) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalEvaluator.evaluate(NonrelationalEvaluator.java:81) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.handleAssumeStatement(NonrelationalStatementProcessor.java:297) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processStatement(NonrelationalStatementProcessor.java:156) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:138) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:107) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:422) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:413) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:140) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:323) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:519) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:323) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalTransitionWithValidState(AbsIntHoareTripleChecker.java:353) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalAbsInt(AbsIntHoareTripleChecker.java:250) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternal(AbsIntHoareTripleChecker.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.chooseFalseSuccessor2(BasicAbstractInterpolantAutomaton.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:72) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:696) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:625) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:467) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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) [2019-09-09 07:17:19,137 INFO L168 Benchmark]: Toolchain (without parser) took 762585.45 ms. Allocated memory was 134.7 MB in the beginning and 354.4 MB in the end (delta: 219.7 MB). Free memory was 89.8 MB in the beginning and 249.5 MB in the end (delta: -159.7 MB). Peak memory consumption was 60.0 MB. Max. memory is 7.1 GB. [2019-09-09 07:17:19,137 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 134.7 MB. Free memory was 109.2 MB in the beginning and 109.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-09 07:17:19,138 INFO L168 Benchmark]: CACSL2BoogieTranslator took 736.10 ms. Allocated memory was 134.7 MB in the beginning and 205.0 MB in the end (delta: 70.3 MB). Free memory was 89.6 MB in the beginning and 169.8 MB in the end (delta: -80.3 MB). Peak memory consumption was 35.7 MB. Max. memory is 7.1 GB. [2019-09-09 07:17:19,139 INFO L168 Benchmark]: Boogie Preprocessor took 108.45 ms. Allocated memory is still 205.0 MB. Free memory was 169.8 MB in the beginning and 165.3 MB in the end (delta: 4.6 MB). Peak memory consumption was 4.6 MB. Max. memory is 7.1 GB. [2019-09-09 07:17:19,140 INFO L168 Benchmark]: RCFGBuilder took 1334.73 ms. Allocated memory was 205.0 MB in the beginning and 232.3 MB in the end (delta: 27.3 MB). Free memory was 165.3 MB in the beginning and 183.3 MB in the end (delta: -18.0 MB). Peak memory consumption was 87.8 MB. Max. memory is 7.1 GB. [2019-09-09 07:17:19,141 INFO L168 Benchmark]: TraceAbstraction took 760401.94 ms. Allocated memory was 232.3 MB in the beginning and 354.4 MB in the end (delta: 122.2 MB). Free memory was 183.3 MB in the beginning and 249.5 MB in the end (delta: -66.2 MB). Peak memory consumption was 55.9 MB. Max. memory is 7.1 GB. [2019-09-09 07:17:19,146 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 134.7 MB. Free memory was 109.2 MB in the beginning and 109.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 736.10 ms. Allocated memory was 134.7 MB in the beginning and 205.0 MB in the end (delta: 70.3 MB). Free memory was 89.6 MB in the beginning and 169.8 MB in the end (delta: -80.3 MB). Peak memory consumption was 35.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 108.45 ms. Allocated memory is still 205.0 MB. Free memory was 169.8 MB in the beginning and 165.3 MB in the end (delta: 4.6 MB). Peak memory consumption was 4.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1334.73 ms. Allocated memory was 205.0 MB in the beginning and 232.3 MB in the end (delta: 27.3 MB). Free memory was 165.3 MB in the beginning and 183.3 MB in the end (delta: -18.0 MB). Peak memory consumption was 87.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 760401.94 ms. Allocated memory was 232.3 MB in the beginning and 354.4 MB in the end (delta: 122.2 MB). Free memory was 183.3 MB in the beginning and 249.5 MB in the end (delta: -66.2 MB). Peak memory consumption was 55.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: There is no value of variable ~a25~0. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: There is no value of variable ~a25~0.: de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalState.getValue(NonrelationalState.java:147) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...