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/loops/string-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 19:20:21,254 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 19:20:21,256 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 19:20:21,268 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 19:20:21,268 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 19:20:21,269 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 19:20:21,271 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 19:20:21,272 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 19:20:21,274 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 19:20:21,275 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 19:20:21,276 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 19:20:21,277 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 19:20:21,277 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 19:20:21,278 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 19:20:21,279 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 19:20:21,281 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 19:20:21,281 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 19:20:21,282 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 19:20:21,284 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 19:20:21,286 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 19:20:21,287 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 19:20:21,289 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 19:20:21,290 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 19:20:21,290 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 19:20:21,293 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 19:20:21,293 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 19:20:21,293 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 19:20:21,294 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 19:20:21,295 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 19:20:21,295 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 19:20:21,296 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 19:20:21,296 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 19:20:21,297 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 19:20:21,298 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 19:20:21,299 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 19:20:21,299 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 19:20:21,300 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 19:20:21,300 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 19:20:21,301 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 19:20:21,301 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 19:20:21,302 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 19:20:21,303 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-03 19:20:21,321 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 19:20:21,321 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 19:20:21,323 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-03 19:20:21,323 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-03 19:20:21,323 INFO L138 SettingsManager]: * Use SBE=true [2019-09-03 19:20:21,323 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 19:20:21,324 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 19:20:21,324 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-03 19:20:21,324 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 19:20:21,325 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 19:20:21,325 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 19:20:21,325 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 19:20:21,325 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 19:20:21,326 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 19:20:21,326 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 19:20:21,326 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-03 19:20:21,326 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 19:20:21,326 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 19:20:21,327 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 19:20:21,327 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-03 19:20:21,327 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-03 19:20:21,329 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 19:20:21,329 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 19:20:21,329 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 19:20:21,329 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-03 19:20:21,329 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-03 19:20:21,330 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 19:20:21,330 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 19:20:21,330 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-03 19:20:21,361 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 19:20:21,374 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 19:20:21,377 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 19:20:21,379 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 19:20:21,379 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 19:20:21,380 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/string-2.i [2019-09-03 19:20:21,459 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60f1e5847/3429e46b82b84389b6833e905267404c/FLAG0f9cd76c3 [2019-09-03 19:20:21,921 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 19:20:21,922 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/string-2.i [2019-09-03 19:20:21,929 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60f1e5847/3429e46b82b84389b6833e905267404c/FLAG0f9cd76c3 [2019-09-03 19:20:22,291 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60f1e5847/3429e46b82b84389b6833e905267404c [2019-09-03 19:20:22,302 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 19:20:22,305 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 19:20:22,308 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 19:20:22,309 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 19:20:22,312 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 19:20:22,314 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:20:22" (1/1) ... [2019-09-03 19:20:22,317 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e8518d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:20:22, skipping insertion in model container [2019-09-03 19:20:22,317 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:20:22" (1/1) ... [2019-09-03 19:20:22,325 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 19:20:22,352 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 19:20:22,577 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:20:22,581 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 19:20:22,686 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:20:22,709 INFO L192 MainTranslator]: Completed translation [2019-09-03 19:20:22,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:20:22 WrapperNode [2019-09-03 19:20:22,709 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 19:20:22,710 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 19:20:22,710 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 19:20:22,710 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 19:20:22,720 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:20:22" (1/1) ... [2019-09-03 19:20:22,721 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:20:22" (1/1) ... [2019-09-03 19:20:22,728 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:20:22" (1/1) ... [2019-09-03 19:20:22,728 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:20:22" (1/1) ... [2019-09-03 19:20:22,738 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:20:22" (1/1) ... [2019-09-03 19:20:22,747 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:20:22" (1/1) ... [2019-09-03 19:20:22,748 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:20:22" (1/1) ... [2019-09-03 19:20:22,751 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 19:20:22,751 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 19:20:22,752 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 19:20:22,752 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 19:20:22,753 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:20:22" (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-03 19:20:22,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 19:20:22,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 19:20:22,802 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 19:20:22,803 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 19:20:22,803 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 19:20:22,803 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-03 19:20:22,803 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 19:20:22,803 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-03 19:20:22,804 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 19:20:22,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-03 19:20:22,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-03 19:20:22,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-03 19:20:22,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-03 19:20:22,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 19:20:22,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 19:20:23,135 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 19:20:23,135 INFO L283 CfgBuilder]: Removed 5 assume(true) statements. [2019-09-03 19:20:23,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:20:23 BoogieIcfgContainer [2019-09-03 19:20:23,137 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 19:20:23,137 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 19:20:23,138 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 19:20:23,141 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 19:20:23,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 07:20:22" (1/3) ... [2019-09-03 19:20:23,142 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69d16434 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:20:23, skipping insertion in model container [2019-09-03 19:20:23,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:20:22" (2/3) ... [2019-09-03 19:20:23,143 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69d16434 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:20:23, skipping insertion in model container [2019-09-03 19:20:23,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:20:23" (3/3) ... [2019-09-03 19:20:23,145 INFO L109 eAbstractionObserver]: Analyzing ICFG string-2.i [2019-09-03 19:20:23,154 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 19:20:23,162 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 19:20:23,179 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 19:20:23,209 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-03 19:20:23,209 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 19:20:23,210 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-03 19:20:23,210 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 19:20:23,210 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 19:20:23,210 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 19:20:23,210 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 19:20:23,210 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 19:20:23,210 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 19:20:23,229 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2019-09-03 19:20:23,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-03 19:20:23,235 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:20:23,236 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] [2019-09-03 19:20:23,238 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:20:23,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:20:23,244 INFO L82 PathProgramCache]: Analyzing trace with hash -99599224, now seen corresponding path program 1 times [2019-09-03 19:20:23,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:20:23,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:20:23,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:23,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:20:23,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:23,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:20:23,372 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-03 19:20:23,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:20:23,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-03 19:20:23,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-03 19:20:23,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-03 19:20:23,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 19:20:23,392 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 2 states. [2019-09-03 19:20:23,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:20:23,415 INFO L93 Difference]: Finished difference Result 62 states and 89 transitions. [2019-09-03 19:20:23,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-03 19:20:23,416 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2019-09-03 19:20:23,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:20:23,422 INFO L225 Difference]: With dead ends: 62 [2019-09-03 19:20:23,422 INFO L226 Difference]: Without dead ends: 28 [2019-09-03 19:20:23,425 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 19:20:23,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-03 19:20:23,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-09-03 19:20:23,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-03 19:20:23,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2019-09-03 19:20:23,464 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 22 [2019-09-03 19:20:23,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:20:23,465 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-09-03 19:20:23,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-03 19:20:23,466 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2019-09-03 19:20:23,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-03 19:20:23,467 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:20:23,467 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] [2019-09-03 19:20:23,467 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:20:23,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:20:23,468 INFO L82 PathProgramCache]: Analyzing trace with hash 930552028, now seen corresponding path program 1 times [2019-09-03 19:20:23,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:20:23,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:20:23,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:23,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:20:23,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:23,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:20:23,526 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-03 19:20:23,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:20:23,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 19:20:23,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 19:20:23,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 19:20:23,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 19:20:23,530 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 3 states. [2019-09-03 19:20:23,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:20:23,616 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2019-09-03 19:20:23,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 19:20:23,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-03 19:20:23,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:20:23,619 INFO L225 Difference]: With dead ends: 56 [2019-09-03 19:20:23,620 INFO L226 Difference]: Without dead ends: 36 [2019-09-03 19:20:23,621 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 19:20:23,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-03 19:20:23,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2019-09-03 19:20:23,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-03 19:20:23,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2019-09-03 19:20:23,630 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 24 [2019-09-03 19:20:23,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:20:23,631 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2019-09-03 19:20:23,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 19:20:23,631 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2019-09-03 19:20:23,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-03 19:20:23,632 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:20:23,632 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] [2019-09-03 19:20:23,633 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:20:23,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:20:23,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1358146588, now seen corresponding path program 1 times [2019-09-03 19:20:23,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:20:23,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:20:23,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:23,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:20:23,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:23,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:20:23,713 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 19:20:23,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:20:23,713 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) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:20:23,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:20:23,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:20:23,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-03 19:20:23,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:20:23,822 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 19:20:23,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:20:23,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-03 19:20:23,837 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:20:23,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:20:23,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:20:23,840 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 5 states. [2019-09-03 19:20:23,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:20:23,946 INFO L93 Difference]: Finished difference Result 65 states and 80 transitions. [2019-09-03 19:20:23,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 19:20:23,947 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-09-03 19:20:23,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:20:23,948 INFO L225 Difference]: With dead ends: 65 [2019-09-03 19:20:23,948 INFO L226 Difference]: Without dead ends: 44 [2019-09-03 19:20:23,949 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:20:23,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-03 19:20:23,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 34. [2019-09-03 19:20:23,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-03 19:20:23,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2019-09-03 19:20:23,956 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 28 [2019-09-03 19:20:23,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:20:23,957 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2019-09-03 19:20:23,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:20:23,957 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2019-09-03 19:20:23,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-03 19:20:23,958 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:20:23,959 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:20:23,959 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:20:23,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:20:23,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1752396196, now seen corresponding path program 2 times [2019-09-03 19:20:23,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:20:23,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:20:23,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:23,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:20:23,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:23,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:20:24,041 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 19:20:24,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:20:24,042 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-03 19:20:24,069 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:20:24,101 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:20:24,101 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:20:24,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-03 19:20:24,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:20:24,119 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 19:20:24,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:20:24,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-03 19:20:24,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 19:20:24,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 19:20:24,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:20:24,126 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 6 states. [2019-09-03 19:20:24,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:20:24,242 INFO L93 Difference]: Finished difference Result 75 states and 92 transitions. [2019-09-03 19:20:24,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 19:20:24,245 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-09-03 19:20:24,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:20:24,246 INFO L225 Difference]: With dead ends: 75 [2019-09-03 19:20:24,247 INFO L226 Difference]: Without dead ends: 52 [2019-09-03 19:20:24,247 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:20:24,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-03 19:20:24,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 38. [2019-09-03 19:20:24,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-03 19:20:24,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2019-09-03 19:20:24,257 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 32 [2019-09-03 19:20:24,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:20:24,257 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2019-09-03 19:20:24,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 19:20:24,257 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2019-09-03 19:20:24,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-03 19:20:24,259 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:20:24,259 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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-03 19:20:24,259 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:20:24,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:20:24,260 INFO L82 PathProgramCache]: Analyzing trace with hash -800948324, now seen corresponding path program 3 times [2019-09-03 19:20:24,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:20:24,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:20:24,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:24,261 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:20:24,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:24,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:20:24,404 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-03 19:20:24,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:20:24,405 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-03 19:20:24,431 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:20:24,466 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-03 19:20:24,467 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:20:24,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-03 19:20:24,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:20:24,491 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-03 19:20:24,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:20:24,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-03 19:20:24,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 19:20:24,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 19:20:24,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:20:24,497 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 7 states. [2019-09-03 19:20:24,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:20:24,609 INFO L93 Difference]: Finished difference Result 85 states and 104 transitions. [2019-09-03 19:20:24,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 19:20:24,610 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2019-09-03 19:20:24,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:20:24,612 INFO L225 Difference]: With dead ends: 85 [2019-09-03 19:20:24,612 INFO L226 Difference]: Without dead ends: 60 [2019-09-03 19:20:24,612 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:20:24,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-03 19:20:24,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2019-09-03 19:20:24,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-03 19:20:24,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2019-09-03 19:20:24,627 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 36 [2019-09-03 19:20:24,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:20:24,627 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2019-09-03 19:20:24,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 19:20:24,632 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2019-09-03 19:20:24,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-03 19:20:24,633 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:20:24,633 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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-03 19:20:24,633 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:20:24,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:20:24,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1655062492, now seen corresponding path program 4 times [2019-09-03 19:20:24,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:20:24,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:20:24,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:24,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:20:24,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:24,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:20:24,739 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-03 19:20:24,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:20:24,740 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) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:20:24,754 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:20:24,776 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:20:24,777 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:20:24,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-03 19:20:24,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:20:24,793 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-03 19:20:24,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:20:24,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-03 19:20:24,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 19:20:24,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 19:20:24,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-03 19:20:24,801 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 8 states. [2019-09-03 19:20:24,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:20:24,915 INFO L93 Difference]: Finished difference Result 93 states and 114 transitions. [2019-09-03 19:20:24,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 19:20:24,915 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2019-09-03 19:20:24,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:20:24,917 INFO L225 Difference]: With dead ends: 93 [2019-09-03 19:20:24,917 INFO L226 Difference]: Without dead ends: 66 [2019-09-03 19:20:24,918 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-03 19:20:24,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-03 19:20:24,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2019-09-03 19:20:24,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-03 19:20:24,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2019-09-03 19:20:24,924 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 40 [2019-09-03 19:20:24,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:20:24,925 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2019-09-03 19:20:24,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 19:20:24,925 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2019-09-03 19:20:24,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-03 19:20:24,926 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:20:24,927 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 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-03 19:20:24,927 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:20:24,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:20:24,927 INFO L82 PathProgramCache]: Analyzing trace with hash 349736732, now seen corresponding path program 5 times [2019-09-03 19:20:24,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:20:24,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:20:24,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:24,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:20:24,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:24,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-03 19:20:25,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-03 19:20:25,102 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-09-03 19:20:25,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.09 07:20:25 BoogieIcfgContainer [2019-09-03 19:20:25,176 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-03 19:20:25,181 INFO L168 Benchmark]: Toolchain (without parser) took 2873.61 ms. Allocated memory was 131.6 MB in the beginning and 219.7 MB in the end (delta: 88.1 MB). Free memory was 85.8 MB in the beginning and 117.6 MB in the end (delta: -31.9 MB). Peak memory consumption was 56.2 MB. Max. memory is 7.1 GB. [2019-09-03 19:20:25,184 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 131.6 MB. Free memory was 104.5 MB in the beginning and 104.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-03 19:20:25,186 INFO L168 Benchmark]: CACSL2BoogieTranslator took 401.54 ms. Allocated memory was 131.6 MB in the beginning and 198.2 MB in the end (delta: 66.6 MB). Free memory was 85.6 MB in the beginning and 174.5 MB in the end (delta: -88.9 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. [2019-09-03 19:20:25,187 INFO L168 Benchmark]: Boogie Preprocessor took 41.03 ms. Allocated memory is still 198.2 MB. Free memory was 174.5 MB in the beginning and 172.2 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-09-03 19:20:25,188 INFO L168 Benchmark]: RCFGBuilder took 385.25 ms. Allocated memory is still 198.2 MB. Free memory was 172.2 MB in the beginning and 154.2 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 7.1 GB. [2019-09-03 19:20:25,193 INFO L168 Benchmark]: TraceAbstraction took 2038.40 ms. Allocated memory was 198.2 MB in the beginning and 219.7 MB in the end (delta: 21.5 MB). Free memory was 153.6 MB in the beginning and 117.6 MB in the end (delta: 35.9 MB). Peak memory consumption was 57.4 MB. Max. memory is 7.1 GB. [2019-09-03 19:20:25,200 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 131.6 MB. Free memory was 104.5 MB in the beginning and 104.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 401.54 ms. Allocated memory was 131.6 MB in the beginning and 198.2 MB in the end (delta: 66.6 MB). Free memory was 85.6 MB in the beginning and 174.5 MB in the end (delta: -88.9 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.03 ms. Allocated memory is still 198.2 MB. Free memory was 174.5 MB in the beginning and 172.2 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 385.25 ms. Allocated memory is still 198.2 MB. Free memory was 172.2 MB in the beginning and 154.2 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2038.40 ms. Allocated memory was 198.2 MB in the beginning and 219.7 MB in the end (delta: 21.5 MB). Free memory was 153.6 MB in the beginning and 117.6 MB in the end (delta: 35.9 MB). Peak memory consumption was 57.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 6]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of shiftLeft at line 55. Possible FailurePath: [L17] char string_A[5], string_B[5]; [L18] int i, j, nc_A, nc_B, found=0; [L21] i=0 VAL [found=0, i=0, string_A={-1:0}, string_B={1:0}] [L21] COND TRUE i<5 [L22] string_A[i]=__VERIFIER_nondet_char() [L21] i++ VAL [found=0, i=1, string_A={-1:0}, string_B={1:0}] [L21] COND TRUE i<5 [L22] string_A[i]=__VERIFIER_nondet_char() [L21] i++ VAL [found=0, i=2, string_A={-1:0}, string_B={1:0}] [L21] COND TRUE i<5 [L22] string_A[i]=__VERIFIER_nondet_char() [L21] i++ VAL [found=0, i=3, string_A={-1:0}, string_B={1:0}] [L21] COND TRUE i<5 [L22] string_A[i]=__VERIFIER_nondet_char() [L21] i++ VAL [found=0, i=4, string_A={-1:0}, string_B={1:0}] [L21] COND TRUE i<5 [L22] string_A[i]=__VERIFIER_nondet_char() [L21] i++ VAL [found=0, i=5, string_A={-1:0}, string_B={1:0}] [L21] COND FALSE !(i<5) VAL [found=0, i=5, string_A={-1:0}, string_B={1:0}] [L23] EXPR string_A[5 -1] VAL [found=0, i=5, string_A={-1:0}, string_A[5 -1]=0, string_B={1:0}] [L23] COND FALSE !(!(string_A[5 -1]=='\0')) [L25] i=0 VAL [found=0, i=0, string_A={-1:0}, string_B={1:0}] [L25] COND TRUE i<5 [L26] string_B[i]=__VERIFIER_nondet_char() [L25] i++ VAL [found=0, i=1, string_A={-1:0}, string_B={1:0}] [L25] COND TRUE i<5 [L26] string_B[i]=__VERIFIER_nondet_char() [L25] i++ VAL [found=0, i=2, string_A={-1:0}, string_B={1:0}] [L25] COND TRUE i<5 [L26] string_B[i]=__VERIFIER_nondet_char() [L25] i++ VAL [found=0, i=3, string_A={-1:0}, string_B={1:0}] [L25] COND TRUE i<5 [L26] string_B[i]=__VERIFIER_nondet_char() [L25] i++ VAL [found=0, i=4, string_A={-1:0}, string_B={1:0}] [L25] COND TRUE i<5 [L26] string_B[i]=__VERIFIER_nondet_char() [L25] i++ VAL [found=0, i=5, string_A={-1:0}, string_B={1:0}] [L25] COND FALSE !(i<5) VAL [found=0, i=5, string_A={-1:0}, string_B={1:0}] [L27] EXPR string_B[5 -1] VAL [found=0, i=5, string_A={-1:0}, string_B={1:0}, string_B[5 -1]=0] [L27] COND FALSE !(!(string_B[5 -1]=='\0')) [L29] nc_A = 0 VAL [found=0, i=5, nc_A=0, string_A={-1:0}, string_B={1:0}] [L30] EXPR string_A[nc_A] VAL [found=0, i=5, nc_A=0, string_A={-1:0}, string_A[nc_A]=0, string_B={1:0}] [L30] COND FALSE !(string_A[nc_A]!='\0') [L33] nc_B = 0 VAL [found=0, i=5, nc_A=0, nc_B=0, string_A={-1:0}, string_B={1:0}] [L34] EXPR string_B[nc_B] VAL [found=0, i=5, nc_A=0, nc_B=0, string_A={-1:0}, string_B={1:0}, string_B[nc_B]=0] [L34] COND FALSE !(string_B[nc_B]!='\0') [L37] COND FALSE !(!(nc_B >= nc_A)) [L40] EXPR j=0 [L40] i=j=0 VAL [found=0, i=0, j=0, nc_A=0, nc_B=0, string_A={-1:0}, string_B={1:0}] [L41] COND FALSE !((inc_B-1)<