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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem15_label41.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 20:43:55,473 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 20:43:55,475 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 20:43:55,493 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 20:43:55,494 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 20:43:55,495 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 20:43:55,497 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 20:43:55,510 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 20:43:55,512 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 20:43:55,512 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 20:43:55,516 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 20:43:55,518 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 20:43:55,519 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 20:43:55,520 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 20:43:55,524 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 20:43:55,526 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 20:43:55,528 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 20:43:55,531 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 20:43:55,535 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 20:43:55,538 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 20:43:55,541 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 20:43:55,543 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 20:43:55,546 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 20:43:55,547 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 20:43:55,550 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 20:43:55,550 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 20:43:55,550 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 20:43:55,553 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 20:43:55,554 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 20:43:55,555 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 20:43:55,556 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 20:43:55,558 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 20:43:55,558 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 20:43:55,559 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 20:43:55,561 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 20:43:55,562 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 20:43:55,562 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 20:43:55,563 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 20:43:55,563 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 20:43:55,564 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 20:43:55,564 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 20:43:55,566 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-07 20:43:55,589 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 20:43:55,589 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 20:43:55,591 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 20:43:55,592 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 20:43:55,592 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 20:43:55,592 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 20:43:55,592 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 20:43:55,593 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 20:43:55,593 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 20:43:55,593 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 20:43:55,594 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 20:43:55,595 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 20:43:55,595 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 20:43:55,595 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 20:43:55,595 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 20:43:55,596 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 20:43:55,596 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 20:43:55,596 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 20:43:55,596 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 20:43:55,597 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 20:43:55,597 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 20:43:55,597 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 20:43:55,597 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 20:43:55,597 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 20:43:55,598 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 20:43:55,598 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 20:43:55,598 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 20:43:55,598 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 20:43:55,599 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 20:43:55,651 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 20:43:55,670 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 20:43:55,674 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 20:43:55,675 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 20:43:55,676 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 20:43:55,676 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem15_label41.c [2019-09-07 20:43:55,742 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08ffefda8/0113f9f5b0f24b7ba88af7a5fc91f5e4/FLAG0e85a9a16 [2019-09-07 20:43:56,349 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 20:43:56,350 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem15_label41.c [2019-09-07 20:43:56,371 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08ffefda8/0113f9f5b0f24b7ba88af7a5fc91f5e4/FLAG0e85a9a16 [2019-09-07 20:43:56,563 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08ffefda8/0113f9f5b0f24b7ba88af7a5fc91f5e4 [2019-09-07 20:43:56,577 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 20:43:56,579 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 20:43:56,580 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 20:43:56,580 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 20:43:56,583 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 20:43:56,584 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 08:43:56" (1/1) ... [2019-09-07 20:43:56,587 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fe21a7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:43:56, skipping insertion in model container [2019-09-07 20:43:56,588 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 08:43:56" (1/1) ... [2019-09-07 20:43:56,595 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 20:43:56,667 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 20:43:57,511 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 20:43:57,526 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 20:43:57,939 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 20:43:57,965 INFO L192 MainTranslator]: Completed translation [2019-09-07 20:43:57,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:43:57 WrapperNode [2019-09-07 20:43:57,967 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 20:43:57,968 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 20:43:57,968 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 20:43:57,968 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 20:43:57,984 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:43:57" (1/1) ... [2019-09-07 20:43:57,985 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:43:57" (1/1) ... [2019-09-07 20:43:58,016 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:43:57" (1/1) ... [2019-09-07 20:43:58,017 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:43:57" (1/1) ... [2019-09-07 20:43:58,086 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:43:57" (1/1) ... [2019-09-07 20:43:58,112 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:43:57" (1/1) ... [2019-09-07 20:43:58,135 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:43:57" (1/1) ... [2019-09-07 20:43:58,158 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 20:43:58,159 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 20:43:58,159 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 20:43:58,159 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 20:43:58,160 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:43:57" (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-07 20:43:58,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 20:43:58,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 20:43:58,218 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 20:43:58,218 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 20:43:58,219 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 20:43:58,220 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 20:43:58,221 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 20:43:58,221 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 20:43:58,221 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 20:43:58,222 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 20:43:58,222 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 20:43:58,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 20:43:58,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 20:44:01,499 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 20:44:01,500 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 20:44:01,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 08:44:01 BoogieIcfgContainer [2019-09-07 20:44:01,505 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 20:44:01,512 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 20:44:01,512 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 20:44:01,517 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 20:44:01,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 08:43:56" (1/3) ... [2019-09-07 20:44:01,519 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39f9d392 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 08:44:01, skipping insertion in model container [2019-09-07 20:44:01,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:43:57" (2/3) ... [2019-09-07 20:44:01,521 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39f9d392 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 08:44:01, skipping insertion in model container [2019-09-07 20:44:01,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 08:44:01" (3/3) ... [2019-09-07 20:44:01,528 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem15_label41.c [2019-09-07 20:44:01,544 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 20:44:01,559 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 20:44:01,586 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 20:44:01,659 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 20:44:01,660 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 20:44:01,660 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 20:44:01,661 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 20:44:01,661 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 20:44:01,661 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 20:44:01,662 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 20:44:01,662 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 20:44:01,662 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 20:44:01,726 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states. [2019-09-07 20:44:01,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-07 20:44:01,736 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:44:01,738 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] [2019-09-07 20:44:01,740 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:44:01,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:44:01,750 INFO L82 PathProgramCache]: Analyzing trace with hash 2039792165, now seen corresponding path program 1 times [2019-09-07 20:44:01,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:44:01,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:44:01,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:44:01,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:44:01,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:44:02,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:44:02,264 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-07 20:44:02,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:44:02,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 20:44:02,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 20:44:02,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 20:44:02,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:44:02,290 INFO L87 Difference]: Start difference. First operand 437 states. Second operand 4 states. [2019-09-07 20:44:06,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:44:06,271 INFO L93 Difference]: Finished difference Result 1546 states and 2831 transitions. [2019-09-07 20:44:06,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 20:44:06,273 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-09-07 20:44:06,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:44:06,300 INFO L225 Difference]: With dead ends: 1546 [2019-09-07 20:44:06,301 INFO L226 Difference]: Without dead ends: 1028 [2019-09-07 20:44:06,315 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:44:06,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2019-09-07 20:44:06,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 700. [2019-09-07 20:44:06,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2019-09-07 20:44:06,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 1110 transitions. [2019-09-07 20:44:06,457 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 1110 transitions. Word has length 31 [2019-09-07 20:44:06,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:44:06,458 INFO L475 AbstractCegarLoop]: Abstraction has 700 states and 1110 transitions. [2019-09-07 20:44:06,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 20:44:06,459 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 1110 transitions. [2019-09-07 20:44:06,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-07 20:44:06,469 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:44:06,469 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 20:44:06,471 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:44:06,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:44:06,473 INFO L82 PathProgramCache]: Analyzing trace with hash -2131209815, now seen corresponding path program 1 times [2019-09-07 20:44:06,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:44:06,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:44:06,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:44:06,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:44:06,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:44:06,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:44:06,720 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:44:06,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:44:06,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 20:44:06,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 20:44:06,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 20:44:06,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 20:44:06,724 INFO L87 Difference]: Start difference. First operand 700 states and 1110 transitions. Second operand 5 states. [2019-09-07 20:44:10,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:44:10,096 INFO L93 Difference]: Finished difference Result 2057 states and 3297 transitions. [2019-09-07 20:44:10,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 20:44:10,101 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-09-07 20:44:10,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:44:10,115 INFO L225 Difference]: With dead ends: 2057 [2019-09-07 20:44:10,115 INFO L226 Difference]: Without dead ends: 1363 [2019-09-07 20:44:10,118 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-07 20:44:10,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2019-09-07 20:44:10,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 1333. [2019-09-07 20:44:10,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1333 states. [2019-09-07 20:44:10,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 1846 transitions. [2019-09-07 20:44:10,202 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 1846 transitions. Word has length 103 [2019-09-07 20:44:10,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:44:10,204 INFO L475 AbstractCegarLoop]: Abstraction has 1333 states and 1846 transitions. [2019-09-07 20:44:10,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 20:44:10,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 1846 transitions. [2019-09-07 20:44:10,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-07 20:44:10,216 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:44:10,217 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 20:44:10,217 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:44:10,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:44:10,223 INFO L82 PathProgramCache]: Analyzing trace with hash -356827719, now seen corresponding path program 1 times [2019-09-07 20:44:10,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:44:10,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:44:10,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:44:10,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:44:10,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:44:10,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:44:10,422 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:44:10,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:44:10,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 20:44:10,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 20:44:10,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 20:44:10,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:44:10,425 INFO L87 Difference]: Start difference. First operand 1333 states and 1846 transitions. Second operand 4 states. [2019-09-07 20:44:14,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:44:14,081 INFO L93 Difference]: Finished difference Result 5136 states and 7266 transitions. [2019-09-07 20:44:14,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 20:44:14,082 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-09-07 20:44:14,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:44:14,105 INFO L225 Difference]: With dead ends: 5136 [2019-09-07 20:44:14,106 INFO L226 Difference]: Without dead ends: 3809 [2019-09-07 20:44:14,110 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:44:14,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3809 states. [2019-09-07 20:44:14,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3809 to 3807. [2019-09-07 20:44:14,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3807 states. [2019-09-07 20:44:14,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3807 states to 3807 states and 4928 transitions. [2019-09-07 20:44:14,232 INFO L78 Accepts]: Start accepts. Automaton has 3807 states and 4928 transitions. Word has length 111 [2019-09-07 20:44:14,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:44:14,233 INFO L475 AbstractCegarLoop]: Abstraction has 3807 states and 4928 transitions. [2019-09-07 20:44:14,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 20:44:14,233 INFO L276 IsEmpty]: Start isEmpty. Operand 3807 states and 4928 transitions. [2019-09-07 20:44:14,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-07 20:44:14,237 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:44:14,237 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 20:44:14,237 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:44:14,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:44:14,238 INFO L82 PathProgramCache]: Analyzing trace with hash 350757028, now seen corresponding path program 1 times [2019-09-07 20:44:14,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:44:14,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:44:14,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:44:14,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:44:14,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:44:14,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:44:14,451 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 48 proven. 65 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 20:44:14,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:44:14,451 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 20:44:14,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:44:14,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:44:14,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 20:44:14,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:44:14,752 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 20:44:14,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:44:14,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 20:44:14,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:44:14,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:44:14,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:44:14,764 INFO L87 Difference]: Start difference. First operand 3807 states and 4928 transitions. Second operand 9 states. [2019-09-07 20:44:20,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:44:20,195 INFO L93 Difference]: Finished difference Result 7757 states and 10088 transitions. [2019-09-07 20:44:20,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-07 20:44:20,195 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 186 [2019-09-07 20:44:20,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:44:20,215 INFO L225 Difference]: With dead ends: 7757 [2019-09-07 20:44:20,215 INFO L226 Difference]: Without dead ends: 3956 [2019-09-07 20:44:20,225 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 196 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2019-09-07 20:44:20,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3956 states. [2019-09-07 20:44:20,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3956 to 3912. [2019-09-07 20:44:20,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3912 states. [2019-09-07 20:44:20,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3912 states to 3912 states and 4592 transitions. [2019-09-07 20:44:20,328 INFO L78 Accepts]: Start accepts. Automaton has 3912 states and 4592 transitions. Word has length 186 [2019-09-07 20:44:20,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:44:20,330 INFO L475 AbstractCegarLoop]: Abstraction has 3912 states and 4592 transitions. [2019-09-07 20:44:20,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:44:20,330 INFO L276 IsEmpty]: Start isEmpty. Operand 3912 states and 4592 transitions. [2019-09-07 20:44:20,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-09-07 20:44:20,337 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:44:20,338 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 20:44:20,338 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:44:20,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:44:20,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1553025313, now seen corresponding path program 1 times [2019-09-07 20:44:20,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:44:20,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:44:20,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:44:20,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:44:20,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:44:20,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:44:20,705 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-07 20:44:20,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:44:20,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 20:44:20,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 20:44:20,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 20:44:20,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:44:20,709 INFO L87 Difference]: Start difference. First operand 3912 states and 4592 transitions. Second operand 4 states. [2019-09-07 20:44:24,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:44:24,417 INFO L93 Difference]: Finished difference Result 14669 states and 17666 transitions. [2019-09-07 20:44:24,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 20:44:24,417 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 300 [2019-09-07 20:44:24,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:44:24,450 INFO L225 Difference]: With dead ends: 14669 [2019-09-07 20:44:24,450 INFO L226 Difference]: Without dead ends: 7301 [2019-09-07 20:44:24,464 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:44:24,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7301 states. [2019-09-07 20:44:24,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7301 to 7290. [2019-09-07 20:44:24,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7290 states. [2019-09-07 20:44:24,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7290 states to 7290 states and 8157 transitions. [2019-09-07 20:44:24,616 INFO L78 Accepts]: Start accepts. Automaton has 7290 states and 8157 transitions. Word has length 300 [2019-09-07 20:44:24,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:44:24,616 INFO L475 AbstractCegarLoop]: Abstraction has 7290 states and 8157 transitions. [2019-09-07 20:44:24,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 20:44:24,617 INFO L276 IsEmpty]: Start isEmpty. Operand 7290 states and 8157 transitions. [2019-09-07 20:44:24,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2019-09-07 20:44:24,624 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:44:24,624 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-07 20:44:24,625 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:44:24,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:44:24,625 INFO L82 PathProgramCache]: Analyzing trace with hash 202575052, now seen corresponding path program 1 times [2019-09-07 20:44:24,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:44:24,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:44:24,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:44:24,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:44:24,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:44:24,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:44:25,183 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 72 proven. 150 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-07 20:44:25,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:44:25,183 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:44:25,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:44:25,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:44:25,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 20:44:25,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:44:25,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:44:25,717 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-09-07 20:44:25,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:44:25,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 20:44:25,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:44:25,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:44:25,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:44:25,727 INFO L87 Difference]: Start difference. First operand 7290 states and 8157 transitions. Second operand 9 states. [2019-09-07 20:44:30,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:44:30,025 INFO L93 Difference]: Finished difference Result 15054 states and 16907 transitions. [2019-09-07 20:44:30,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 20:44:30,028 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 389 [2019-09-07 20:44:30,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:44:30,057 INFO L225 Difference]: With dead ends: 15054 [2019-09-07 20:44:30,058 INFO L226 Difference]: Without dead ends: 7770 [2019-09-07 20:44:30,074 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 393 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2019-09-07 20:44:30,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7770 states. [2019-09-07 20:44:30,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7770 to 7693. [2019-09-07 20:44:30,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7693 states. [2019-09-07 20:44:30,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7693 states to 7693 states and 8600 transitions. [2019-09-07 20:44:30,255 INFO L78 Accepts]: Start accepts. Automaton has 7693 states and 8600 transitions. Word has length 389 [2019-09-07 20:44:30,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:44:30,256 INFO L475 AbstractCegarLoop]: Abstraction has 7693 states and 8600 transitions. [2019-09-07 20:44:30,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:44:30,257 INFO L276 IsEmpty]: Start isEmpty. Operand 7693 states and 8600 transitions. [2019-09-07 20:44:30,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2019-09-07 20:44:30,274 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:44:30,284 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 20:44:30,284 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:44:30,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:44:30,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1676569803, now seen corresponding path program 1 times [2019-09-07 20:44:30,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:44:30,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:44:30,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:44:30,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:44:30,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:44:30,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:44:31,374 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 79 proven. 225 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 20:44:31,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:44:31,375 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:44:31,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:44:31,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:44:31,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:44:31,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:44:31,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:44:31,788 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 281 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-07 20:44:31,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:44:31,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5] total 16 [2019-09-07 20:44:31,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 20:44:31,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 20:44:31,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2019-09-07 20:44:31,793 INFO L87 Difference]: Start difference. First operand 7693 states and 8600 transitions. Second operand 16 states. [2019-09-07 20:44:43,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:44:43,585 INFO L93 Difference]: Finished difference Result 23336 states and 27090 transitions. [2019-09-07 20:44:43,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-07 20:44:43,590 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 463 [2019-09-07 20:44:43,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:44:43,643 INFO L225 Difference]: With dead ends: 23336 [2019-09-07 20:44:43,643 INFO L226 Difference]: Without dead ends: 15956 [2019-09-07 20:44:43,664 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 574 GetRequests, 509 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1314 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=778, Invalid=3512, Unknown=0, NotChecked=0, Total=4290 [2019-09-07 20:44:43,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15956 states. [2019-09-07 20:44:43,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15956 to 15540. [2019-09-07 20:44:43,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15540 states. [2019-09-07 20:44:43,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15540 states to 15540 states and 17490 transitions. [2019-09-07 20:44:43,984 INFO L78 Accepts]: Start accepts. Automaton has 15540 states and 17490 transitions. Word has length 463 [2019-09-07 20:44:43,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:44:43,985 INFO L475 AbstractCegarLoop]: Abstraction has 15540 states and 17490 transitions. [2019-09-07 20:44:43,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 20:44:43,985 INFO L276 IsEmpty]: Start isEmpty. Operand 15540 states and 17490 transitions. [2019-09-07 20:44:44,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 617 [2019-09-07 20:44:44,005 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:44:44,006 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-07 20:44:44,006 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:44:44,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:44:44,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1867889067, now seen corresponding path program 1 times [2019-09-07 20:44:44,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:44:44,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:44:44,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:44:44,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:44:44,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:44:44,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:44:44,901 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 372 proven. 2 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-09-07 20:44:44,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:44:44,902 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 20:44:44,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:44:45,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:44:45,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 840 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:44:45,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:44:45,443 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 372 proven. 2 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 20:44:45,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:44:45,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 20:44:45,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:44:45,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:44:45,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:44:45,455 INFO L87 Difference]: Start difference. First operand 15540 states and 17490 transitions. Second operand 9 states. [2019-09-07 20:44:49,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:44:49,696 INFO L93 Difference]: Finished difference Result 33618 states and 38508 transitions. [2019-09-07 20:44:49,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 20:44:49,697 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 616 [2019-09-07 20:44:49,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:44:49,749 INFO L225 Difference]: With dead ends: 33618 [2019-09-07 20:44:49,749 INFO L226 Difference]: Without dead ends: 18391 [2019-09-07 20:44:49,776 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 639 GetRequests, 623 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-09-07 20:44:49,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18391 states. [2019-09-07 20:44:50,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18391 to 18341. [2019-09-07 20:44:50,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18341 states. [2019-09-07 20:44:50,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18341 states to 18341 states and 20510 transitions. [2019-09-07 20:44:50,102 INFO L78 Accepts]: Start accepts. Automaton has 18341 states and 20510 transitions. Word has length 616 [2019-09-07 20:44:50,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:44:50,103 INFO L475 AbstractCegarLoop]: Abstraction has 18341 states and 20510 transitions. [2019-09-07 20:44:50,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:44:50,103 INFO L276 IsEmpty]: Start isEmpty. Operand 18341 states and 20510 transitions. [2019-09-07 20:44:50,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 669 [2019-09-07 20:44:50,127 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:44:50,128 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 20:44:50,128 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:44:50,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:44:50,129 INFO L82 PathProgramCache]: Analyzing trace with hash -466734421, now seen corresponding path program 1 times [2019-09-07 20:44:50,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:44:50,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:44:50,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:44:50,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:44:50,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:44:50,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:44:51,019 INFO L134 CoverageAnalysis]: Checked inductivity of 683 backedges. 112 proven. 232 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2019-09-07 20:44:51,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:44:51,019 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:44:51,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:44:51,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:44:51,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 926 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 20:44:51,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:44:51,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:44:51,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:44:51,978 INFO L134 CoverageAnalysis]: Checked inductivity of 683 backedges. 466 proven. 2 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 20:44:51,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:44:51,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 12 [2019-09-07 20:44:51,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 20:44:51,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 20:44:51,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-09-07 20:44:51,996 INFO L87 Difference]: Start difference. First operand 18341 states and 20510 transitions. Second operand 12 states. [2019-09-07 20:44:52,864 WARN L188 SmtUtils]: Spent 784.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2019-09-07 20:44:55,060 WARN L188 SmtUtils]: Spent 682.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 19 [2019-09-07 20:44:56,950 WARN L188 SmtUtils]: Spent 322.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-09-07 20:44:58,227 WARN L188 SmtUtils]: Spent 686.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 20 [2019-09-07 20:45:02,734 WARN L188 SmtUtils]: Spent 657.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 29 [2019-09-07 20:45:03,475 WARN L188 SmtUtils]: Spent 645.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2019-09-07 20:45:04,175 WARN L188 SmtUtils]: Spent 655.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 32 [2019-09-07 20:45:04,951 WARN L188 SmtUtils]: Spent 641.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 25 [2019-09-07 20:45:11,901 WARN L188 SmtUtils]: Spent 645.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2019-09-07 20:45:13,298 WARN L188 SmtUtils]: Spent 971.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 21 [2019-09-07 20:45:15,936 WARN L188 SmtUtils]: Spent 697.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2019-09-07 20:45:31,249 WARN L188 SmtUtils]: Spent 670.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 34 [2019-09-07 20:45:33,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:45:33,966 INFO L93 Difference]: Finished difference Result 52606 states and 58884 transitions. [2019-09-07 20:45:33,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-07 20:45:33,967 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 668 [2019-09-07 20:45:33,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:45:34,047 INFO L225 Difference]: With dead ends: 52606 [2019-09-07 20:45:34,048 INFO L226 Difference]: Without dead ends: 34578 [2019-09-07 20:45:34,081 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 814 GetRequests, 733 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2468 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=892, Invalid=5914, Unknown=0, NotChecked=0, Total=6806 [2019-09-07 20:45:34,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34578 states. [2019-09-07 20:45:34,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34578 to 32663. [2019-09-07 20:45:34,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32663 states. [2019-09-07 20:45:34,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32663 states to 32663 states and 36129 transitions. [2019-09-07 20:45:34,614 INFO L78 Accepts]: Start accepts. Automaton has 32663 states and 36129 transitions. Word has length 668 [2019-09-07 20:45:34,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:45:34,615 INFO L475 AbstractCegarLoop]: Abstraction has 32663 states and 36129 transitions. [2019-09-07 20:45:34,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 20:45:34,615 INFO L276 IsEmpty]: Start isEmpty. Operand 32663 states and 36129 transitions. [2019-09-07 20:45:34,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 717 [2019-09-07 20:45:34,643 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:45:34,645 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 20:45:34,645 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:45:34,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:45:34,646 INFO L82 PathProgramCache]: Analyzing trace with hash 874290572, now seen corresponding path program 1 times [2019-09-07 20:45:34,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:45:34,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:45:34,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:45:34,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:45:34,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:45:35,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-07 20:45:35,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-07 20:45:35,315 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Int term has non-integral value at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.ModelBuilder.fillInTermValues(ModelBuilder.java:93) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.ModelBuilder.(ModelBuilder.java:66) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.CClosure.fillInModel(CClosure.java:745) at de.uni_freiburg.informatik.ultimate.smtinterpol.model.Model.(Model.java:108) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.buildModel(SMTInterpol.java:1221) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getValue(SMTInterpol.java:1090) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SmtUtils.getValues(SmtUtils.java:1813) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.getValue(TraceCheck.java:396) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.computeRcfgProgramExecution(TraceCheck.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:344) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.(TraceCheck.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.(TraceCheck.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:453) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:429) 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-07 20:45:35,322 INFO L168 Benchmark]: Toolchain (without parser) took 98741.70 ms. Allocated memory was 133.7 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 84.1 MB in the beginning and 946.0 MB in the end (delta: -861.9 MB). Peak memory consumption was 167.8 MB. Max. memory is 7.1 GB. [2019-09-07 20:45:35,322 INFO L168 Benchmark]: CDTParser took 0.44 ms. Allocated memory is still 133.7 MB. Free memory was 108.1 MB in the beginning and 107.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-07 20:45:35,324 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1387.47 ms. Allocated memory was 133.7 MB in the beginning and 203.4 MB in the end (delta: 69.7 MB). Free memory was 83.8 MB in the beginning and 106.7 MB in the end (delta: -22.9 MB). Peak memory consumption was 52.1 MB. Max. memory is 7.1 GB. [2019-09-07 20:45:35,329 INFO L168 Benchmark]: Boogie Preprocessor took 190.97 ms. Allocated memory is still 203.4 MB. Free memory was 106.7 MB in the beginning and 94.1 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 7.1 GB. [2019-09-07 20:45:35,331 INFO L168 Benchmark]: RCFGBuilder took 3346.54 ms. Allocated memory was 203.4 MB in the beginning and 274.7 MB in the end (delta: 71.3 MB). Free memory was 94.1 MB in the beginning and 88.2 MB in the end (delta: 5.9 MB). Peak memory consumption was 77.2 MB. Max. memory is 7.1 GB. [2019-09-07 20:45:35,332 INFO L168 Benchmark]: TraceAbstraction took 93806.96 ms. Allocated memory was 274.7 MB in the beginning and 1.2 GB in the end (delta: 888.7 MB). Free memory was 88.2 MB in the beginning and 946.0 MB in the end (delta: -857.8 MB). Peak memory consumption was 30.9 MB. Max. memory is 7.1 GB. [2019-09-07 20:45:35,344 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.44 ms. Allocated memory is still 133.7 MB. Free memory was 108.1 MB in the beginning and 107.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1387.47 ms. Allocated memory was 133.7 MB in the beginning and 203.4 MB in the end (delta: 69.7 MB). Free memory was 83.8 MB in the beginning and 106.7 MB in the end (delta: -22.9 MB). Peak memory consumption was 52.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 190.97 ms. Allocated memory is still 203.4 MB. Free memory was 106.7 MB in the beginning and 94.1 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3346.54 ms. Allocated memory was 203.4 MB in the beginning and 274.7 MB in the end (delta: 71.3 MB). Free memory was 94.1 MB in the beginning and 88.2 MB in the end (delta: 5.9 MB). Peak memory consumption was 77.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 93806.96 ms. Allocated memory was 274.7 MB in the beginning and 1.2 GB in the end (delta: 888.7 MB). Free memory was 88.2 MB in the beginning and 946.0 MB in the end (delta: -857.8 MB). Peak memory consumption was 30.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Int term has non-integral value de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Int term has non-integral value: de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.ModelBuilder.fillInTermValues(ModelBuilder.java:93) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...