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/array-examples/data_structures_set_multi_proc_trivial_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 21:42:25,045 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 21:42:25,048 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 21:42:25,068 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 21:42:25,068 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 21:42:25,070 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 21:42:25,072 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 21:42:25,076 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 21:42:25,078 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 21:42:25,079 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 21:42:25,080 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 21:42:25,081 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 21:42:25,081 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 21:42:25,082 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 21:42:25,083 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 21:42:25,084 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 21:42:25,087 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 21:42:25,088 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 21:42:25,093 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 21:42:25,097 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 21:42:25,101 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 21:42:25,102 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 21:42:25,105 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 21:42:25,106 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 21:42:25,111 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 21:42:25,112 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 21:42:25,112 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 21:42:25,113 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 21:42:25,114 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 21:42:25,115 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 21:42:25,115 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 21:42:25,117 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 21:42:25,118 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 21:42:25,118 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 21:42:25,122 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 21:42:25,122 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 21:42:25,123 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 21:42:25,123 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 21:42:25,124 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 21:42:25,126 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 21:42:25,128 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 21:42:25,129 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-10-14 21:42:25,149 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 21:42:25,149 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 21:42:25,151 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 21:42:25,151 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 21:42:25,152 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 21:42:25,152 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 21:42:25,152 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 21:42:25,152 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 21:42:25,152 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 21:42:25,153 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 21:42:25,154 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 21:42:25,154 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 21:42:25,154 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 21:42:25,155 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 21:42:25,155 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 21:42:25,155 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 21:42:25,155 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 21:42:25,156 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 21:42:25,156 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 21:42:25,156 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 21:42:25,156 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 21:42:25,157 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 21:42:25,157 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 21:42:25,157 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 21:42:25,157 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 21:42:25,157 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 21:42:25,158 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 21:42:25,158 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 21:42:25,158 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 21:42:25,428 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 21:42:25,446 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 21:42:25,449 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 21:42:25,451 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 21:42:25,451 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 21:42:25,452 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/data_structures_set_multi_proc_trivial_ground.i [2019-10-14 21:42:25,526 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8d706bf2/73d956b2187e4b78841cd25d73df97ee/FLAG7dec0037e [2019-10-14 21:42:25,966 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 21:42:25,966 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/data_structures_set_multi_proc_trivial_ground.i [2019-10-14 21:42:25,973 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8d706bf2/73d956b2187e4b78841cd25d73df97ee/FLAG7dec0037e [2019-10-14 21:42:26,369 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8d706bf2/73d956b2187e4b78841cd25d73df97ee [2019-10-14 21:42:26,379 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 21:42:26,381 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 21:42:26,382 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 21:42:26,382 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 21:42:26,385 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 21:42:26,386 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:42:26" (1/1) ... [2019-10-14 21:42:26,388 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b536ee0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:42:26, skipping insertion in model container [2019-10-14 21:42:26,388 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:42:26" (1/1) ... [2019-10-14 21:42:26,395 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 21:42:26,413 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 21:42:26,600 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 21:42:26,609 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 21:42:26,635 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 21:42:26,651 INFO L192 MainTranslator]: Completed translation [2019-10-14 21:42:26,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:42:26 WrapperNode [2019-10-14 21:42:26,652 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 21:42:26,652 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 21:42:26,652 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 21:42:26,653 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 21:42:26,743 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:42:26" (1/1) ... [2019-10-14 21:42:26,743 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:42:26" (1/1) ... [2019-10-14 21:42:26,751 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:42:26" (1/1) ... [2019-10-14 21:42:26,751 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:42:26" (1/1) ... [2019-10-14 21:42:26,761 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:42:26" (1/1) ... [2019-10-14 21:42:26,770 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:42:26" (1/1) ... [2019-10-14 21:42:26,772 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:42:26" (1/1) ... [2019-10-14 21:42:26,775 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 21:42:26,776 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 21:42:26,776 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 21:42:26,776 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 21:42:26,777 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:42:26" (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-10-14 21:42:26,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 21:42:26,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 21:42:26,825 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-14 21:42:26,825 INFO L138 BoogieDeclarations]: Found implementation of procedure insert [2019-10-14 21:42:26,826 INFO L138 BoogieDeclarations]: Found implementation of procedure elem_exists [2019-10-14 21:42:26,826 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 21:42:26,826 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 21:42:26,826 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-14 21:42:26,827 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 21:42:26,827 INFO L130 BoogieDeclarations]: Found specification of procedure insert [2019-10-14 21:42:26,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-14 21:42:26,827 INFO L130 BoogieDeclarations]: Found specification of procedure elem_exists [2019-10-14 21:42:26,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-14 21:42:26,828 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 21:42:26,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-14 21:42:26,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-14 21:42:26,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 21:42:26,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 21:42:27,254 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 21:42:27,254 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-14 21:42:27,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:42:27 BoogieIcfgContainer [2019-10-14 21:42:27,255 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 21:42:27,257 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 21:42:27,257 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 21:42:27,260 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 21:42:27,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 09:42:26" (1/3) ... [2019-10-14 21:42:27,261 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4360d77c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:42:27, skipping insertion in model container [2019-10-14 21:42:27,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:42:26" (2/3) ... [2019-10-14 21:42:27,261 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4360d77c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:42:27, skipping insertion in model container [2019-10-14 21:42:27,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:42:27" (3/3) ... [2019-10-14 21:42:27,263 INFO L109 eAbstractionObserver]: Analyzing ICFG data_structures_set_multi_proc_trivial_ground.i [2019-10-14 21:42:27,273 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 21:42:27,279 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 21:42:27,288 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 21:42:27,314 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 21:42:27,314 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 21:42:27,314 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 21:42:27,314 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 21:42:27,314 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 21:42:27,315 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 21:42:27,315 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 21:42:27,315 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 21:42:27,335 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2019-10-14 21:42:27,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-14 21:42:27,343 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:42:27,344 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:42:27,348 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:42:27,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:42:27,355 INFO L82 PathProgramCache]: Analyzing trace with hash 528217166, now seen corresponding path program 1 times [2019-10-14 21:42:27,361 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:42:27,362 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322250528] [2019-10-14 21:42:27,362 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:42:27,362 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:42:27,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:42:27,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:42:27,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:42:27,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:42:27,551 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322250528] [2019-10-14 21:42:27,553 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:42:27,554 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 21:42:27,554 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987653178] [2019-10-14 21:42:27,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 21:42:27,560 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:42:27,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 21:42:27,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 21:42:27,577 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 4 states. [2019-10-14 21:42:27,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:42:27,901 INFO L93 Difference]: Finished difference Result 150 states and 228 transitions. [2019-10-14 21:42:27,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 21:42:27,903 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-10-14 21:42:27,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:42:27,914 INFO L225 Difference]: With dead ends: 150 [2019-10-14 21:42:27,915 INFO L226 Difference]: Without dead ends: 89 [2019-10-14 21:42:27,919 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 21:42:27,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-10-14 21:42:27,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 57. [2019-10-14 21:42:27,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-14 21:42:27,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 70 transitions. [2019-10-14 21:42:27,970 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 70 transitions. Word has length 14 [2019-10-14 21:42:27,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:42:27,971 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 70 transitions. [2019-10-14 21:42:27,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 21:42:27,971 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2019-10-14 21:42:27,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-14 21:42:27,974 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:42:27,974 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:42:27,974 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:42:27,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:42:27,975 INFO L82 PathProgramCache]: Analyzing trace with hash 396779504, now seen corresponding path program 1 times [2019-10-14 21:42:27,975 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:42:27,975 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015342320] [2019-10-14 21:42:27,975 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:42:27,975 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:42:27,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:42:28,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:42:28,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:42:28,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:42:28,064 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015342320] [2019-10-14 21:42:28,065 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880479988] [2019-10-14 21:42:28,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:42:28,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:42:28,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 21:42:28,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:42:28,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:42:28,172 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:42:28,172 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2019-10-14 21:42:28,172 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461888100] [2019-10-14 21:42:28,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 21:42:28,174 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:42:28,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 21:42:28,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-14 21:42:28,179 INFO L87 Difference]: Start difference. First operand 57 states and 70 transitions. Second operand 6 states. [2019-10-14 21:42:28,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:42:28,489 INFO L93 Difference]: Finished difference Result 170 states and 222 transitions. [2019-10-14 21:42:28,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 21:42:28,489 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-10-14 21:42:28,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:42:28,491 INFO L225 Difference]: With dead ends: 170 [2019-10-14 21:42:28,492 INFO L226 Difference]: Without dead ends: 122 [2019-10-14 21:42:28,493 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-14 21:42:28,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-10-14 21:42:28,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 59. [2019-10-14 21:42:28,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-14 21:42:28,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2019-10-14 21:42:28,505 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 72 transitions. Word has length 16 [2019-10-14 21:42:28,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:42:28,505 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 72 transitions. [2019-10-14 21:42:28,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 21:42:28,506 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2019-10-14 21:42:28,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-14 21:42:28,506 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:42:28,507 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:42:28,711 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:42:28,712 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:42:28,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:42:28,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1360762094, now seen corresponding path program 2 times [2019-10-14 21:42:28,713 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:42:28,714 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662089415] [2019-10-14 21:42:28,714 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:42:28,714 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:42:28,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:42:28,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:42:28,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:42:28,817 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:42:28,817 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662089415] [2019-10-14 21:42:28,818 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337837499] [2019-10-14 21:42:28,818 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:42:28,876 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-10-14 21:42:28,876 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:42:28,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 21:42:28,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:42:28,901 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-14 21:42:28,902 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 21:42:28,902 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-10-14 21:42:28,902 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628416626] [2019-10-14 21:42:28,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 21:42:28,903 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:42:28,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 21:42:28,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-14 21:42:28,904 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. Second operand 4 states. [2019-10-14 21:42:28,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:42:28,947 INFO L93 Difference]: Finished difference Result 112 states and 140 transitions. [2019-10-14 21:42:28,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 21:42:28,948 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-10-14 21:42:28,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:42:28,949 INFO L225 Difference]: With dead ends: 112 [2019-10-14 21:42:28,949 INFO L226 Difference]: Without dead ends: 63 [2019-10-14 21:42:28,950 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-14 21:42:28,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-14 21:42:28,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2019-10-14 21:42:28,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-14 21:42:28,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions. [2019-10-14 21:42:28,960 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 18 [2019-10-14 21:42:28,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:42:28,960 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 73 transitions. [2019-10-14 21:42:28,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 21:42:28,961 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2019-10-14 21:42:28,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-14 21:42:28,962 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:42:28,962 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-14 21:42:29,166 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:42:29,167 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:42:29,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:42:29,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1841898364, now seen corresponding path program 1 times [2019-10-14 21:42:29,168 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:42:29,168 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030885024] [2019-10-14 21:42:29,169 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:42:29,169 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:42:29,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:42:29,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:42:29,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:42:29,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:42:29,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:42:29,282 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-14 21:42:29,283 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030885024] [2019-10-14 21:42:29,283 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:42:29,283 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 21:42:29,284 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660973327] [2019-10-14 21:42:29,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 21:42:29,285 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:42:29,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 21:42:29,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 21:42:29,286 INFO L87 Difference]: Start difference. First operand 61 states and 73 transitions. Second operand 5 states. [2019-10-14 21:42:29,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:42:29,477 INFO L93 Difference]: Finished difference Result 125 states and 154 transitions. [2019-10-14 21:42:29,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 21:42:29,478 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-10-14 21:42:29,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:42:29,479 INFO L225 Difference]: With dead ends: 125 [2019-10-14 21:42:29,480 INFO L226 Difference]: Without dead ends: 80 [2019-10-14 21:42:29,481 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 21:42:29,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-10-14 21:42:29,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 62. [2019-10-14 21:42:29,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-10-14 21:42:29,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 74 transitions. [2019-10-14 21:42:29,490 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 74 transitions. Word has length 37 [2019-10-14 21:42:29,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:42:29,490 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 74 transitions. [2019-10-14 21:42:29,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 21:42:29,491 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 74 transitions. [2019-10-14 21:42:29,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-14 21:42:29,492 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:42:29,492 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-14 21:42:29,493 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:42:29,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:42:29,493 INFO L82 PathProgramCache]: Analyzing trace with hash 581153498, now seen corresponding path program 1 times [2019-10-14 21:42:29,493 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:42:29,494 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509541262] [2019-10-14 21:42:29,494 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:42:29,494 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:42:29,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:42:29,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:42:29,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:42:29,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:42:29,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:42:29,605 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-14 21:42:29,605 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509541262] [2019-10-14 21:42:29,606 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:42:29,606 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 21:42:29,606 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174096795] [2019-10-14 21:42:29,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 21:42:29,607 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:42:29,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 21:42:29,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-14 21:42:29,608 INFO L87 Difference]: Start difference. First operand 62 states and 74 transitions. Second operand 6 states. [2019-10-14 21:42:29,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:42:29,824 INFO L93 Difference]: Finished difference Result 105 states and 128 transitions. [2019-10-14 21:42:29,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 21:42:29,824 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-10-14 21:42:29,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:42:29,826 INFO L225 Difference]: With dead ends: 105 [2019-10-14 21:42:29,826 INFO L226 Difference]: Without dead ends: 68 [2019-10-14 21:42:29,826 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-14 21:42:29,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-14 21:42:29,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-10-14 21:42:29,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-14 21:42:29,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 81 transitions. [2019-10-14 21:42:29,835 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 81 transitions. Word has length 39 [2019-10-14 21:42:29,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:42:29,835 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 81 transitions. [2019-10-14 21:42:29,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 21:42:29,836 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 81 transitions. [2019-10-14 21:42:29,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-14 21:42:29,837 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:42:29,837 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-14 21:42:29,837 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:42:29,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:42:29,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1998742801, now seen corresponding path program 1 times [2019-10-14 21:42:29,838 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:42:29,838 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593265391] [2019-10-14 21:42:29,839 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:42:29,839 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:42:29,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:42:29,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:42:29,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:42:29,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:42:29,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:42:29,930 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-14 21:42:29,930 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593265391] [2019-10-14 21:42:29,931 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:42:29,931 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-14 21:42:29,931 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716270153] [2019-10-14 21:42:29,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-14 21:42:29,932 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:42:29,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-14 21:42:29,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-14 21:42:29,932 INFO L87 Difference]: Start difference. First operand 68 states and 81 transitions. Second operand 7 states. [2019-10-14 21:42:30,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:42:30,088 INFO L93 Difference]: Finished difference Result 88 states and 104 transitions. [2019-10-14 21:42:30,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-14 21:42:30,089 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2019-10-14 21:42:30,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:42:30,090 INFO L225 Difference]: With dead ends: 88 [2019-10-14 21:42:30,090 INFO L226 Difference]: Without dead ends: 0 [2019-10-14 21:42:30,091 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-10-14 21:42:30,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-14 21:42:30,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-14 21:42:30,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-14 21:42:30,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-14 21:42:30,092 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2019-10-14 21:42:30,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:42:30,092 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-14 21:42:30,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-14 21:42:30,092 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-14 21:42:30,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-14 21:42:30,098 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-14 21:42:30,278 INFO L446 ceAbstractionStarter]: At program point elem_existsENTRY(lines 9 15) the Hoare annotation is: true [2019-10-14 21:42:30,278 INFO L443 ceAbstractionStarter]: For program point elem_existsEXIT(lines 9 15) no Hoare annotation was computed. [2019-10-14 21:42:30,279 INFO L443 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. [2019-10-14 21:42:30,279 INFO L443 ceAbstractionStarter]: For program point L11-2(lines 11 13) no Hoare annotation was computed. [2019-10-14 21:42:30,279 INFO L443 ceAbstractionStarter]: For program point elem_existsFINAL(lines 9 15) no Hoare annotation was computed. [2019-10-14 21:42:30,279 INFO L439 ceAbstractionStarter]: At program point L11-3(lines 11 13) the Hoare annotation is: (and (<= 0 elem_exists_~i~0) (= elem_exists_~size |elem_exists_#in~size|)) [2019-10-14 21:42:30,279 INFO L443 ceAbstractionStarter]: For program point L11-4(lines 11 13) no Hoare annotation was computed. [2019-10-14 21:42:30,279 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-14 21:42:30,280 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-14 21:42:30,280 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-14 21:42:30,280 INFO L446 ceAbstractionStarter]: At program point insertENTRY(lines 5 8) the Hoare annotation is: true [2019-10-14 21:42:30,280 INFO L443 ceAbstractionStarter]: For program point insertFINAL(lines 5 8) no Hoare annotation was computed. [2019-10-14 21:42:30,280 INFO L443 ceAbstractionStarter]: For program point insertEXIT(lines 5 8) no Hoare annotation was computed. [2019-10-14 21:42:30,280 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-14 21:42:30,280 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-14 21:42:30,280 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-14 21:42:30,281 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-14 21:42:30,281 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 16 56) no Hoare annotation was computed. [2019-10-14 21:42:30,281 INFO L439 ceAbstractionStarter]: At program point L52(line 52) the Hoare annotation is: false [2019-10-14 21:42:30,281 INFO L443 ceAbstractionStarter]: For program point L52-1(line 52) no Hoare annotation was computed. [2019-10-14 21:42:30,281 INFO L443 ceAbstractionStarter]: For program point L44-2(lines 44 48) no Hoare annotation was computed. [2019-10-14 21:42:30,281 INFO L439 ceAbstractionStarter]: At program point L44-3(lines 44 48) the Hoare annotation is: (and (= main_~n~0 0) (<= 0 main_~x~0)) [2019-10-14 21:42:30,281 INFO L443 ceAbstractionStarter]: For program point L36-2(lines 36 39) no Hoare annotation was computed. [2019-10-14 21:42:30,282 INFO L439 ceAbstractionStarter]: At program point L36-3(lines 36 39) the Hoare annotation is: (and (= main_~n~0 0) (<= 0 main_~x~0)) [2019-10-14 21:42:30,282 INFO L443 ceAbstractionStarter]: For program point L36-4(lines 36 39) no Hoare annotation was computed. [2019-10-14 21:42:30,282 INFO L443 ceAbstractionStarter]: For program point L28-2(lines 28 32) no Hoare annotation was computed. [2019-10-14 21:42:30,282 INFO L439 ceAbstractionStarter]: At program point L28-3(lines 28 32) the Hoare annotation is: (and (= main_~n~0 0) (<= 0 main_~x~0)) [2019-10-14 21:42:30,282 INFO L443 ceAbstractionStarter]: For program point L28-4(lines 28 32) no Hoare annotation was computed. [2019-10-14 21:42:30,282 INFO L443 ceAbstractionStarter]: For program point L45-2(lines 45 47) no Hoare annotation was computed. [2019-10-14 21:42:30,282 INFO L439 ceAbstractionStarter]: At program point L45-3(lines 45 47) the Hoare annotation is: false [2019-10-14 21:42:30,283 INFO L443 ceAbstractionStarter]: For program point L29-2(lines 29 31) no Hoare annotation was computed. [2019-10-14 21:42:30,283 INFO L439 ceAbstractionStarter]: At program point L29-3(lines 29 31) the Hoare annotation is: false [2019-10-14 21:42:30,283 INFO L439 ceAbstractionStarter]: At program point L46(line 46) the Hoare annotation is: false [2019-10-14 21:42:30,283 INFO L443 ceAbstractionStarter]: For program point L46-1(line 46) no Hoare annotation was computed. [2019-10-14 21:42:30,283 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 16 56) no Hoare annotation was computed. [2019-10-14 21:42:30,283 INFO L439 ceAbstractionStarter]: At program point L30(line 30) the Hoare annotation is: false [2019-10-14 21:42:30,283 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 16 56) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2019-10-14 21:42:30,284 INFO L443 ceAbstractionStarter]: For program point L30-1(line 30) no Hoare annotation was computed. [2019-10-14 21:42:30,284 INFO L443 ceAbstractionStarter]: For program point L22-2(lines 22 25) no Hoare annotation was computed. [2019-10-14 21:42:30,284 INFO L439 ceAbstractionStarter]: At program point L22-3(lines 22 25) the Hoare annotation is: (and (= main_~n~0 0) (<= 0 main_~x~0)) [2019-10-14 21:42:30,284 INFO L443 ceAbstractionStarter]: For program point L22-4(lines 22 25) no Hoare annotation was computed. [2019-10-14 21:42:30,284 INFO L443 ceAbstractionStarter]: For program point L40-2(lines 40 49) no Hoare annotation was computed. [2019-10-14 21:42:30,284 INFO L439 ceAbstractionStarter]: At program point L40-3(lines 40 49) the Hoare annotation is: (and (= main_~n~0 0) (<= 0 main_~x~0)) [2019-10-14 21:42:30,284 INFO L443 ceAbstractionStarter]: For program point L40-4(lines 40 49) no Hoare annotation was computed. [2019-10-14 21:42:30,285 INFO L439 ceAbstractionStarter]: At program point L41(line 41) the Hoare annotation is: (and (= main_~n~0 0) (<= 0 main_~x~0)) [2019-10-14 21:42:30,285 INFO L443 ceAbstractionStarter]: For program point L41-1(line 41) no Hoare annotation was computed. [2019-10-14 21:42:30,285 INFO L443 ceAbstractionStarter]: For program point L41-2(lines 41 43) no Hoare annotation was computed. [2019-10-14 21:42:30,285 INFO L443 ceAbstractionStarter]: For program point L41-4(lines 41 43) no Hoare annotation was computed. [2019-10-14 21:42:30,285 INFO L443 ceAbstractionStarter]: For program point L50-2(lines 50 54) no Hoare annotation was computed. [2019-10-14 21:42:30,285 INFO L439 ceAbstractionStarter]: At program point L50-3(lines 50 54) the Hoare annotation is: (and (<= main_~n~0 0) (<= 0 main_~x~0)) [2019-10-14 21:42:30,285 INFO L443 ceAbstractionStarter]: For program point L50-4(lines 50 54) no Hoare annotation was computed. [2019-10-14 21:42:30,286 INFO L439 ceAbstractionStarter]: At program point L42(line 42) the Hoare annotation is: false [2019-10-14 21:42:30,286 INFO L443 ceAbstractionStarter]: For program point L42-1(line 42) no Hoare annotation was computed. [2019-10-14 21:42:30,286 INFO L443 ceAbstractionStarter]: For program point L51-2(lines 51 53) no Hoare annotation was computed. [2019-10-14 21:42:30,286 INFO L439 ceAbstractionStarter]: At program point L51-3(lines 51 53) the Hoare annotation is: false [2019-10-14 21:42:30,286 INFO L443 ceAbstractionStarter]: For program point L2-1(line 2) no Hoare annotation was computed. [2019-10-14 21:42:30,286 INFO L443 ceAbstractionStarter]: For program point L2-3(line 2) no Hoare annotation was computed. [2019-10-14 21:42:30,286 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(line 2) the Hoare annotation is: true [2019-10-14 21:42:30,287 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(line 2) no Hoare annotation was computed. [2019-10-14 21:42:30,287 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 2) no Hoare annotation was computed. [2019-10-14 21:42:30,287 INFO L443 ceAbstractionStarter]: For program point L2(line 2) no Hoare annotation was computed. [2019-10-14 21:42:30,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 09:42:30 BoogieIcfgContainer [2019-10-14 21:42:30,305 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-14 21:42:30,308 INFO L168 Benchmark]: Toolchain (without parser) took 3926.12 ms. Allocated memory was 138.4 MB in the beginning and 244.8 MB in the end (delta: 106.4 MB). Free memory was 102.9 MB in the beginning and 154.9 MB in the end (delta: -52.1 MB). Peak memory consumption was 54.4 MB. Max. memory is 7.1 GB. [2019-10-14 21:42:30,309 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-10-14 21:42:30,310 INFO L168 Benchmark]: CACSL2BoogieTranslator took 270.34 ms. Allocated memory is still 138.4 MB. Free memory was 102.7 MB in the beginning and 91.7 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. [2019-10-14 21:42:30,311 INFO L168 Benchmark]: Boogie Preprocessor took 123.02 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 91.7 MB in the beginning and 180.3 MB in the end (delta: -88.7 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. [2019-10-14 21:42:30,312 INFO L168 Benchmark]: RCFGBuilder took 479.89 ms. Allocated memory is still 202.9 MB. Free memory was 180.3 MB in the beginning and 157.0 MB in the end (delta: 23.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 7.1 GB. [2019-10-14 21:42:30,313 INFO L168 Benchmark]: TraceAbstraction took 3048.50 ms. Allocated memory was 202.9 MB in the beginning and 244.8 MB in the end (delta: 41.9 MB). Free memory was 156.3 MB in the beginning and 154.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 43.3 MB. Max. memory is 7.1 GB. [2019-10-14 21:42:30,317 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.48 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 270.34 ms. Allocated memory is still 138.4 MB. Free memory was 102.7 MB in the beginning and 91.7 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 123.02 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 91.7 MB in the beginning and 180.3 MB in the end (delta: -88.7 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 479.89 ms. Allocated memory is still 202.9 MB. Free memory was 180.3 MB in the beginning and 157.0 MB in the end (delta: 23.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3048.50 ms. Allocated memory was 202.9 MB in the beginning and 244.8 MB in the end (delta: 41.9 MB). Free memory was 156.3 MB in the beginning and 154.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 43.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 2]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: n == 0 && 0 <= x - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: n == 0 && 0 <= x - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: n == 0 && 0 <= x - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: n == 0 && 0 <= x - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 0 <= i && size == \old(size) - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: n <= 0 && 0 <= x - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: n == 0 && 0 <= x - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 61 locations, 1 error locations. Result: SAFE, OverallTime: 2.9s, OverallIterations: 6, TraceHistogramMax: 2, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 320 SDtfs, 255 SDslu, 396 SDs, 0 SdLazy, 536 SolverSat, 97 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 115 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 57 PreInvPairs, 67 NumberOfFragments, 85 HoareAnnotationTreeSize, 57 FomulaSimplifications, 100 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 22 FomulaSimplificationsInter, 51 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 197 NumberOfCodeBlocks, 193 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 189 ConstructedInterpolants, 0 QuantifiedInterpolants, 9900 SizeOfPredicates, 3 NumberOfNonLiveVariables, 124 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 18/24 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...