./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-lit/ddlm2013.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-lit/ddlm2013.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 17744505b3a424a40a1b2449004fea58677c1b94 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 17:06:39,156 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 17:06:39,159 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 17:06:39,177 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 17:06:39,177 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 17:06:39,179 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 17:06:39,181 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 17:06:39,190 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 17:06:39,195 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 17:06:39,199 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 17:06:39,201 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 17:06:39,202 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 17:06:39,203 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 17:06:39,204 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 17:06:39,205 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 17:06:39,207 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 17:06:39,208 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 17:06:39,210 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 17:06:39,212 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 17:06:39,216 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 17:06:39,219 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 17:06:39,220 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 17:06:39,222 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 17:06:39,223 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 17:06:39,225 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 17:06:39,226 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 17:06:39,226 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 17:06:39,228 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 17:06:39,228 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 17:06:39,229 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 17:06:39,229 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 17:06:39,230 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 17:06:39,231 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 17:06:39,232 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 17:06:39,233 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 17:06:39,234 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 17:06:39,235 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 17:06:39,235 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 17:06:39,235 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 17:06:39,237 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 17:06:39,238 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 17:06:39,239 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 17:06:39,263 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 17:06:39,264 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 17:06:39,265 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 17:06:39,265 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 17:06:39,265 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 17:06:39,265 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 17:06:39,266 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 17:06:39,266 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 17:06:39,266 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 17:06:39,266 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 17:06:39,266 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 17:06:39,267 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 17:06:39,267 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 17:06:39,267 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 17:06:39,267 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 17:06:39,267 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 17:06:39,268 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 17:06:39,268 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 17:06:39,268 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 17:06:39,268 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 17:06:39,269 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 17:06:39,269 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 17:06:39,269 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 17:06:39,269 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 17:06:39,269 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 17:06:39,270 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 17:06:39,270 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 17:06:39,270 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 17:06:39,270 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 17:06:39,270 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 17744505b3a424a40a1b2449004fea58677c1b94 [2019-11-28 17:06:39,549 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 17:06:39,562 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 17:06:39,566 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 17:06:39,567 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 17:06:39,569 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 17:06:39,570 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-lit/ddlm2013.i [2019-11-28 17:06:39,644 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1572163ca/27fa60d76fa042e8bb3e23bf48b5737e/FLAGdce1c65fc [2019-11-28 17:06:40,099 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 17:06:40,100 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/ddlm2013.i [2019-11-28 17:06:40,106 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1572163ca/27fa60d76fa042e8bb3e23bf48b5737e/FLAGdce1c65fc [2019-11-28 17:06:40,518 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1572163ca/27fa60d76fa042e8bb3e23bf48b5737e [2019-11-28 17:06:40,521 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 17:06:40,523 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 17:06:40,524 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 17:06:40,524 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 17:06:40,527 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 17:06:40,528 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:06:40" (1/1) ... [2019-11-28 17:06:40,531 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a770ba3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:40, skipping insertion in model container [2019-11-28 17:06:40,531 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:06:40" (1/1) ... [2019-11-28 17:06:40,539 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 17:06:40,558 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 17:06:40,730 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:06:40,735 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 17:06:40,755 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:06:40,769 INFO L208 MainTranslator]: Completed translation [2019-11-28 17:06:40,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:40 WrapperNode [2019-11-28 17:06:40,769 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 17:06:40,770 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 17:06:40,770 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 17:06:40,770 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 17:06:40,778 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:40" (1/1) ... [2019-11-28 17:06:40,782 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:40" (1/1) ... [2019-11-28 17:06:40,859 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 17:06:40,859 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 17:06:40,860 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 17:06:40,860 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 17:06:40,867 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:40" (1/1) ... [2019-11-28 17:06:40,867 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:40" (1/1) ... [2019-11-28 17:06:40,868 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:40" (1/1) ... [2019-11-28 17:06:40,868 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:40" (1/1) ... [2019-11-28 17:06:40,871 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:40" (1/1) ... [2019-11-28 17:06:40,877 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:40" (1/1) ... [2019-11-28 17:06:40,878 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:40" (1/1) ... [2019-11-28 17:06:40,880 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 17:06:40,880 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 17:06:40,880 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 17:06:40,880 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 17:06:40,881 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:40" (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-11-28 17:06:40,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 17:06:40,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 17:06:41,132 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 17:06:41,132 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-28 17:06:41,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:06:41 BoogieIcfgContainer [2019-11-28 17:06:41,133 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 17:06:41,135 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 17:06:41,142 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 17:06:41,144 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 17:06:41,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:06:40" (1/3) ... [2019-11-28 17:06:41,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@394675f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:06:41, skipping insertion in model container [2019-11-28 17:06:41,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:40" (2/3) ... [2019-11-28 17:06:41,146 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@394675f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:06:41, skipping insertion in model container [2019-11-28 17:06:41,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:06:41" (3/3) ... [2019-11-28 17:06:41,147 INFO L109 eAbstractionObserver]: Analyzing ICFG ddlm2013.i [2019-11-28 17:06:41,155 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 17:06:41,160 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 17:06:41,169 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 17:06:41,192 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 17:06:41,192 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 17:06:41,192 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 17:06:41,192 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 17:06:41,192 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 17:06:41,193 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 17:06:41,193 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 17:06:41,193 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 17:06:41,206 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2019-11-28 17:06:41,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-28 17:06:41,211 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:41,212 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-28 17:06:41,212 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:06:41,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:41,218 INFO L82 PathProgramCache]: Analyzing trace with hash 920569802, now seen corresponding path program 1 times [2019-11-28 17:06:41,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:41,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102840616] [2019-11-28 17:06:41,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:41,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:41,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:06:41,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102840616] [2019-11-28 17:06:41,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:06:41,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:06:41,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427585601] [2019-11-28 17:06:41,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 17:06:41,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:41,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 17:06:41,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 17:06:41,343 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 2 states. [2019-11-28 17:06:41,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:41,356 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2019-11-28 17:06:41,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 17:06:41,358 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2019-11-28 17:06:41,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:41,367 INFO L225 Difference]: With dead ends: 21 [2019-11-28 17:06:41,367 INFO L226 Difference]: Without dead ends: 9 [2019-11-28 17:06:41,369 INFO L630 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-11-28 17:06:41,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-11-28 17:06:41,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-11-28 17:06:41,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-28 17:06:41,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2019-11-28 17:06:41,396 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 6 [2019-11-28 17:06:41,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:41,396 INFO L462 AbstractCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-11-28 17:06:41,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 17:06:41,397 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2019-11-28 17:06:41,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-28 17:06:41,397 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:41,397 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:06:41,398 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:06:41,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:41,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1539532969, now seen corresponding path program 1 times [2019-11-28 17:06:41,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:41,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256477424] [2019-11-28 17:06:41,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:41,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:41,652 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 16 [2019-11-28 17:06:41,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:06:41,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256477424] [2019-11-28 17:06:41,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:06:41,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:06:41,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100590043] [2019-11-28 17:06:41,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 17:06:41,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:41,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 17:06:41,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 17:06:41,695 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand 4 states. [2019-11-28 17:06:41,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:41,737 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2019-11-28 17:06:41,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 17:06:41,738 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-28 17:06:41,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:41,738 INFO L225 Difference]: With dead ends: 15 [2019-11-28 17:06:41,739 INFO L226 Difference]: Without dead ends: 11 [2019-11-28 17:06:41,740 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:06:41,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-11-28 17:06:41,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-11-28 17:06:41,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-28 17:06:41,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2019-11-28 17:06:41,747 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 7 [2019-11-28 17:06:41,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:41,748 INFO L462 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-11-28 17:06:41,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 17:06:41,748 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2019-11-28 17:06:41,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 17:06:41,748 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:41,749 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:06:41,749 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:06:41,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:41,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1067556335, now seen corresponding path program 1 times [2019-11-28 17:06:41,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:41,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135057969] [2019-11-28 17:06:41,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:41,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:44,021 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (div c_ULTIMATE.start_main_~b~0 4294967296)) (.cse3 (div c_ULTIMATE.start_main_~a~0 4294967296))) (let ((.cse6 (* 4294967296 .cse3)) (.cse16 (* 4294967296 .cse5))) (let ((.cse2 (+ c_ULTIMATE.start_main_~a~0 .cse16)) (.cse1 (+ .cse6 c_ULTIMATE.start_main_~b~0))) (let ((.cse0 (= .cse2 .cse1))) (or .cse0 (let ((.cse4 (not .cse0))) (and (or (<= .cse1 .cse2) (and (or (and (or (<= .cse3 0) (<= c_ULTIMATE.start_main_~a~0 1)) (or (and .cse4 (<= 1 c_ULTIMATE.start_main_~b~0)) (and .cse0 (<= 0 c_ULTIMATE.start_main_~b~0)) (< 0 .cse3))) (<= .cse3 .cse5)) (or (and .cse0 (<= (+ c_ULTIMATE.start_main_~b~0 1) c_ULTIMATE.start_main_~a~0)) (and .cse4 (<= c_ULTIMATE.start_main_~b~0 c_ULTIMATE.start_main_~a~0)) (< .cse5 .cse3)))) .cse4 (let ((.cse20 (div c_ULTIMATE.start_main_~i~0 2))) (let ((.cse9 (* 2 .cse20))) (let ((.cse19 (* .cse20 (- 2))) (.cse18 (= .cse9 c_ULTIMATE.start_main_~i~0)) (.cse17 (* 4294967296 (div c_ULTIMATE.start_main_~i~0 4294967296)))) (let ((.cse7 (+ c_ULTIMATE.start_main_~a~0 .cse16 c_ULTIMATE.start_main_~i~0)) (.cse11 (< c_ULTIMATE.start_main_~i~0 .cse17)) (.cse12 (not .cse18)) (.cse13 (* 4294967296 (div (+ c_ULTIMATE.start_main_~i~0 .cse19 (- 2)) 4294967296))) (.cse8 (* 4294967296 (div (+ c_ULTIMATE.start_main_~i~0 .cse19) 4294967296))) (.cse10 (or (<= .cse17 c_ULTIMATE.start_main_~i~0) .cse18))) (or (< .cse2 .cse1) (< .cse2 (+ .cse6 c_ULTIMATE.start_main_~b~0 1)) (and (<= .cse7 (+ .cse6 c_ULTIMATE.start_main_~b~0 .cse8 .cse9)) .cse10) (and .cse11 .cse12 (<= .cse7 (+ .cse6 .cse13 c_ULTIMATE.start_main_~b~0 .cse9))) (let ((.cse14 (+ .cse3 1))) (and (let ((.cse15 (+ .cse16 c_ULTIMATE.start_main_~i~0))) (or (<= .cse14 0) (and .cse11 .cse12 (<= (+ .cse6 .cse13 c_ULTIMATE.start_main_~b~0 .cse9 1) .cse15)) (and (<= (+ .cse6 c_ULTIMATE.start_main_~b~0 .cse8 .cse9 1) .cse15) .cse10))) (or (< 0 .cse14) (<= 1 c_ULTIMATE.start_main_~a~0)))))))))))))))) is different from false [2019-11-28 17:06:44,075 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:06:44,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135057969] [2019-11-28 17:06:44,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605207670] [2019-11-28 17:06:44,077 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-11-28 17:06:44,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:44,126 INFO L264 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-28 17:06:44,132 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:06:44,216 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:06:44,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:06:44,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2019-11-28 17:06:44,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955003552] [2019-11-28 17:06:44,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 17:06:44,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:44,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 17:06:44,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=65, Unknown=1, NotChecked=16, Total=110 [2019-11-28 17:06:44,219 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 11 states. [2019-11-28 17:06:44,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:44,288 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2019-11-28 17:06:44,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 17:06:44,289 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2019-11-28 17:06:44,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:44,290 INFO L225 Difference]: With dead ends: 20 [2019-11-28 17:06:44,290 INFO L226 Difference]: Without dead ends: 16 [2019-11-28 17:06:44,291 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=34, Invalid=79, Unknown=1, NotChecked=18, Total=132 [2019-11-28 17:06:44,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-11-28 17:06:44,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2019-11-28 17:06:44,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-28 17:06:44,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2019-11-28 17:06:44,295 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 10 [2019-11-28 17:06:44,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:44,295 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-11-28 17:06:44,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 17:06:44,296 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2019-11-28 17:06:44,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 17:06:44,297 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:44,297 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:06:44,498 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:06:44,498 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:06:44,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:44,499 INFO L82 PathProgramCache]: Analyzing trace with hash -387497965, now seen corresponding path program 1 times [2019-11-28 17:06:44,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:44,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109589175] [2019-11-28 17:06:44,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:44,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:44,545 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 17:06:44,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109589175] [2019-11-28 17:06:44,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:06:44,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:06:44,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666436715] [2019-11-28 17:06:44,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:06:44,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:44,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:06:44,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:06:44,548 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. Second operand 3 states. [2019-11-28 17:06:44,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:44,562 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2019-11-28 17:06:44,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:06:44,563 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-28 17:06:44,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:44,564 INFO L225 Difference]: With dead ends: 23 [2019-11-28 17:06:44,564 INFO L226 Difference]: Without dead ends: 14 [2019-11-28 17:06:44,564 INFO L630 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-11-28 17:06:44,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-11-28 17:06:44,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-11-28 17:06:44,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-28 17:06:44,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-11-28 17:06:44,571 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 10 [2019-11-28 17:06:44,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:44,571 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-11-28 17:06:44,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:06:44,572 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2019-11-28 17:06:44,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-28 17:06:44,572 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:44,573 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 17:06:44,573 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:06:44,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:44,574 INFO L82 PathProgramCache]: Analyzing trace with hash -2134579945, now seen corresponding path program 2 times [2019-11-28 17:06:44,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:44,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176810105] [2019-11-28 17:06:44,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:44,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:47,067 WARN L192 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 79 DAG size of output: 25 [2019-11-28 17:06:47,156 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:06:47,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176810105] [2019-11-28 17:06:47,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215100851] [2019-11-28 17:06:47,157 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-11-28 17:06:47,190 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 17:06:47,191 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:06:47,192 INFO L264 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-28 17:06:47,193 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:06:47,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:06:47,358 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:06:47,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:06:47,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2019-11-28 17:06:47,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931084577] [2019-11-28 17:06:47,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 17:06:47,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:47,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 17:06:47,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-28 17:06:47,364 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 11 states. [2019-11-28 17:06:47,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:47,497 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2019-11-28 17:06:47,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 17:06:47,498 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 13 [2019-11-28 17:06:47,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:47,498 INFO L225 Difference]: With dead ends: 28 [2019-11-28 17:06:47,499 INFO L226 Difference]: Without dead ends: 17 [2019-11-28 17:06:47,499 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-11-28 17:06:47,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-11-28 17:06:47,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-28 17:06:47,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 17:06:47,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-11-28 17:06:47,503 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2019-11-28 17:06:47,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:47,503 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-11-28 17:06:47,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 17:06:47,503 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-11-28 17:06:47,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 17:06:47,504 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:47,504 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1] [2019-11-28 17:06:47,711 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:06:47,711 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:06:47,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:47,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1512979537, now seen corresponding path program 3 times [2019-11-28 17:06:47,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:47,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504056511] [2019-11-28 17:06:47,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:47,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:50,957 WARN L192 SmtUtils]: Spent 2.89 s on a formula simplification. DAG size of input: 30 DAG size of output: 29 [2019-11-28 17:06:53,395 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:06:53,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504056511] [2019-11-28 17:06:53,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290902614] [2019-11-28 17:06:53,397 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:06:53,450 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-28 17:06:53,450 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:06:53,452 WARN L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-28 17:06:53,454 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:06:53,725 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:06:53,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:06:53,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2019-11-28 17:06:53,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434859250] [2019-11-28 17:06:53,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-28 17:06:53,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:53,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-28 17:06:53,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=252, Unknown=1, NotChecked=0, Total=306 [2019-11-28 17:06:53,729 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 18 states. [2019-11-28 17:06:56,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:56,396 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2019-11-28 17:06:56,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-28 17:06:56,397 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 16 [2019-11-28 17:06:56,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:56,398 INFO L225 Difference]: With dead ends: 45 [2019-11-28 17:06:56,398 INFO L226 Difference]: Without dead ends: 28 [2019-11-28 17:06:56,399 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=110, Invalid=539, Unknown=1, NotChecked=0, Total=650 [2019-11-28 17:06:56,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-28 17:06:56,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2019-11-28 17:06:56,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-28 17:06:56,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-11-28 17:06:56,403 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 16 [2019-11-28 17:06:56,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:56,403 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-11-28 17:06:56,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-28 17:06:56,404 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-11-28 17:06:56,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 17:06:56,405 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:56,405 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:06:56,608 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:06:56,609 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:06:56,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:56,610 INFO L82 PathProgramCache]: Analyzing trace with hash -329989927, now seen corresponding path program 1 times [2019-11-28 17:06:56,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:56,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746932119] [2019-11-28 17:06:56,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:56,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:56,845 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:06:56,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746932119] [2019-11-28 17:06:56,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546141843] [2019-11-28 17:06:56,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:06:56,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:56,884 INFO L264 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 17:06:56,885 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:06:56,926 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 17:06:56,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:06:56,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2019-11-28 17:06:56,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754160567] [2019-11-28 17:06:56,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 17:06:56,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:56,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 17:06:56,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-28 17:06:56,928 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 9 states. [2019-11-28 17:06:57,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:57,034 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2019-11-28 17:06:57,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 17:06:57,034 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2019-11-28 17:06:57,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:57,035 INFO L225 Difference]: With dead ends: 35 [2019-11-28 17:06:57,036 INFO L226 Difference]: Without dead ends: 26 [2019-11-28 17:06:57,036 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-28 17:06:57,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-28 17:06:57,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-11-28 17:06:57,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-28 17:06:57,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-11-28 17:06:57,042 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 19 [2019-11-28 17:06:57,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:57,045 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-11-28 17:06:57,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 17:06:57,046 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-11-28 17:06:57,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 17:06:57,047 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:57,047 INFO L410 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1] [2019-11-28 17:06:57,247 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:06:57,248 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:06:57,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:57,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1603113111, now seen corresponding path program 4 times [2019-11-28 17:06:57,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:57,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043588741] [2019-11-28 17:06:57,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:57,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:57,699 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 40 [2019-11-28 17:06:58,180 WARN L192 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 26 [2019-11-28 17:07:00,229 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:07:00,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043588741] [2019-11-28 17:07:00,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672630659] [2019-11-28 17:07:00,230 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:07:00,270 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 17:07:00,270 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:07:00,271 WARN L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 58 conjunts are in the unsatisfiable core [2019-11-28 17:07:00,273 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:07:00,845 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:07:00,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:07:00,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2019-11-28 17:07:00,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298251346] [2019-11-28 17:07:00,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-28 17:07:00,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:07:00,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-28 17:07:00,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=735, Unknown=0, NotChecked=0, Total=870 [2019-11-28 17:07:00,848 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 30 states. [2019-11-28 17:07:04,930 WARN L192 SmtUtils]: Spent 3.80 s on a formula simplification. DAG size of input: 64 DAG size of output: 40 [2019-11-28 17:07:09,065 WARN L192 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 85 DAG size of output: 34 [2019-11-28 17:07:11,679 WARN L192 SmtUtils]: Spent 2.52 s on a formula simplification. DAG size of input: 68 DAG size of output: 38 [2019-11-28 17:07:13,862 WARN L192 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 89 DAG size of output: 32 [2019-11-28 17:07:16,065 WARN L192 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 87 DAG size of output: 36 [2019-11-28 17:07:16,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:07:16,169 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2019-11-28 17:07:16,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-28 17:07:16,169 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 25 [2019-11-28 17:07:16,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:07:16,169 INFO L225 Difference]: With dead ends: 31 [2019-11-28 17:07:16,169 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 17:07:16,170 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=206, Invalid=1054, Unknown=0, NotChecked=0, Total=1260 [2019-11-28 17:07:16,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 17:07:16,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 17:07:16,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 17:07:16,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 17:07:16,171 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2019-11-28 17:07:16,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:07:16,172 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 17:07:16,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-28 17:07:16,172 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 17:07:16,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 17:07:16,372 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:07:16,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 17:07:16,385 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 17:07:16,386 INFO L249 CegarLoopResult]: At program point L31(lines 31 33) the Hoare annotation is: true [2019-11-28 17:07:16,386 INFO L246 CegarLoopResult]: For program point L25(lines 25 29) no Hoare annotation was computed. [2019-11-28 17:07:16,386 INFO L246 CegarLoopResult]: For program point L25-2(lines 10 35) no Hoare annotation was computed. [2019-11-28 17:07:16,386 INFO L246 CegarLoopResult]: For program point L21(lines 21 30) no Hoare annotation was computed. [2019-11-28 17:07:16,386 INFO L246 CegarLoopResult]: For program point L21-2(lines 10 35) no Hoare annotation was computed. [2019-11-28 17:07:16,386 INFO L246 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed. [2019-11-28 17:07:16,387 INFO L249 CegarLoopResult]: At program point L34(lines 10 35) the Hoare annotation is: true [2019-11-28 17:07:16,387 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 17:07:16,387 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 17:07:16,387 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-28 17:07:16,388 INFO L246 CegarLoopResult]: For program point L16(lines 16 20) no Hoare annotation was computed. [2019-11-28 17:07:16,388 INFO L246 CegarLoopResult]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-11-28 17:07:16,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 05:07:16 BoogieIcfgContainer [2019-11-28 17:07:16,398 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 17:07:16,399 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 17:07:16,399 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 17:07:16,399 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 17:07:16,400 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:06:41" (3/4) ... [2019-11-28 17:07:16,404 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 17:07:16,414 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-28 17:07:16,414 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 17:07:16,464 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 17:07:16,464 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 17:07:16,466 INFO L168 Benchmark]: Toolchain (without parser) took 35943.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 204.5 MB). Free memory was 961.7 MB in the beginning and 899.6 MB in the end (delta: 62.1 MB). Peak memory consumption was 266.6 MB. Max. memory is 11.5 GB. [2019-11-28 17:07:16,467 INFO L168 Benchmark]: CDTParser took 0.75 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:07:16,467 INFO L168 Benchmark]: CACSL2BoogieTranslator took 245.95 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 951.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 17:07:16,468 INFO L168 Benchmark]: Boogie Procedure Inliner took 89.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -195.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-28 17:07:16,468 INFO L168 Benchmark]: Boogie Preprocessor took 20.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 17:07:16,469 INFO L168 Benchmark]: RCFGBuilder took 253.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-28 17:07:16,470 INFO L168 Benchmark]: TraceAbstraction took 35263.85 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 54.5 MB). Free memory was 1.1 GB in the beginning and 906.7 MB in the end (delta: 215.1 MB). Peak memory consumption was 269.6 MB. Max. memory is 11.5 GB. [2019-11-28 17:07:16,470 INFO L168 Benchmark]: Witness Printer took 65.46 ms. Allocated memory is still 1.2 GB. Free memory was 906.7 MB in the beginning and 899.6 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-28 17:07:16,474 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.75 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 245.95 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 951.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 89.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -195.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 253.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 35263.85 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 54.5 MB). Free memory was 1.1 GB in the beginning and 906.7 MB in the end (delta: 215.1 MB). Peak memory consumption was 269.6 MB. Max. memory is 11.5 GB. * Witness Printer took 65.46 ms. Allocated memory is still 1.2 GB. Free memory was 906.7 MB in the beginning and 899.6 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: 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: 31]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 1 error locations. Result: SAFE, OverallTime: 35.1s, OverallIterations: 8, TraceHistogramMax: 7, AutomataDifference: 18.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 89 SDtfs, 74 SDslu, 333 SDs, 0 SdLazy, 474 SolverSat, 33 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 152 GetRequests, 56 SyntacticMatches, 6 SemanticMatches, 90 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 29.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=6, 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, 8 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 4 NumberOfFragments, 2 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 15.0s InterpolantComputationTime, 189 NumberOfCodeBlocks, 189 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 176 ConstructedInterpolants, 4 QuantifiedInterpolants, 50653 SizeOfPredicates, 21 NumberOfNonLiveVariables, 342 ConjunctsInSsa, 145 ConjunctsInUnsatCore, 13 InterpolantComputations, 3 PerfectInterpolantSequences, 25/216 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...