./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-lopstr16/flag_loopdep.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab 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/array-lopstr16/flag_loopdep.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 ede152d5cd6ec701bb90258310974118410592fd .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-27 22:28:03,120 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 22:28:03,123 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 22:28:03,135 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 22:28:03,136 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 22:28:03,137 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 22:28:03,139 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 22:28:03,141 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 22:28:03,143 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 22:28:03,144 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 22:28:03,146 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 22:28:03,147 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 22:28:03,147 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 22:28:03,149 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 22:28:03,150 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 22:28:03,151 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 22:28:03,152 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 22:28:03,153 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 22:28:03,155 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 22:28:03,158 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 22:28:03,160 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 22:28:03,161 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 22:28:03,162 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 22:28:03,165 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 22:28:03,169 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 22:28:03,170 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 22:28:03,170 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 22:28:03,171 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 22:28:03,173 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 22:28:03,174 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 22:28:03,175 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 22:28:03,176 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 22:28:03,177 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 22:28:03,178 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 22:28:03,182 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 22:28:03,182 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 22:28:03,183 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 22:28:03,184 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 22:28:03,184 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 22:28:03,188 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 22:28:03,191 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 22:28:03,192 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 22:28:03,216 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 22:28:03,216 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 22:28:03,218 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 22:28:03,219 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 22:28:03,219 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 22:28:03,219 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 22:28:03,220 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 22:28:03,220 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 22:28:03,220 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 22:28:03,220 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 22:28:03,222 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 22:28:03,222 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 22:28:03,222 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 22:28:03,223 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 22:28:03,223 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 22:28:03,223 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 22:28:03,224 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 22:28:03,224 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 22:28:03,224 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 22:28:03,225 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 22:28:03,225 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 22:28:03,225 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:28:03,226 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 22:28:03,226 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 22:28:03,226 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 22:28:03,226 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 22:28:03,227 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 22:28:03,227 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 22:28:03,227 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 -> ede152d5cd6ec701bb90258310974118410592fd [2019-11-27 22:28:03,518 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 22:28:03,532 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 22:28:03,536 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 22:28:03,537 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 22:28:03,538 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 22:28:03,538 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-lopstr16/flag_loopdep.i [2019-11-27 22:28:03,602 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ca50fc6c/0d517fb480f9483297829ce5346036c2/FLAGb5381bb23 [2019-11-27 22:28:04,052 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 22:28:04,052 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-lopstr16/flag_loopdep.i [2019-11-27 22:28:04,059 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ca50fc6c/0d517fb480f9483297829ce5346036c2/FLAGb5381bb23 [2019-11-27 22:28:04,444 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ca50fc6c/0d517fb480f9483297829ce5346036c2 [2019-11-27 22:28:04,448 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 22:28:04,450 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 22:28:04,454 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 22:28:04,454 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 22:28:04,458 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 22:28:04,459 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:28:04" (1/1) ... [2019-11-27 22:28:04,462 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10712095 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:28:04, skipping insertion in model container [2019-11-27 22:28:04,463 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:28:04" (1/1) ... [2019-11-27 22:28:04,472 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 22:28:04,493 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 22:28:04,712 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:28:04,720 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 22:28:04,737 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:28:04,755 INFO L208 MainTranslator]: Completed translation [2019-11-27 22:28:04,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:28:04 WrapperNode [2019-11-27 22:28:04,756 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 22:28:04,757 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 22:28:04,757 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 22:28:04,757 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 22:28:04,822 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:28:04" (1/1) ... [2019-11-27 22:28:04,832 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:28:04" (1/1) ... [2019-11-27 22:28:04,861 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 22:28:04,861 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 22:28:04,861 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 22:28:04,862 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 22:28:04,869 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:28:04" (1/1) ... [2019-11-27 22:28:04,869 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:28:04" (1/1) ... [2019-11-27 22:28:04,871 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:28:04" (1/1) ... [2019-11-27 22:28:04,871 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:28:04" (1/1) ... [2019-11-27 22:28:04,876 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:28:04" (1/1) ... [2019-11-27 22:28:04,882 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:28:04" (1/1) ... [2019-11-27 22:28:04,883 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:28:04" (1/1) ... [2019-11-27 22:28:04,888 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 22:28:04,890 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 22:28:04,890 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 22:28:04,890 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 22:28:04,894 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:28:04" (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-27 22:28:04,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-27 22:28:04,967 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-27 22:28:04,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-27 22:28:04,967 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-27 22:28:04,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 22:28:04,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 22:28:04,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-27 22:28:05,250 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 22:28:05,250 INFO L297 CfgBuilder]: Removed 11 assume(true) statements. [2019-11-27 22:28:05,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:28:05 BoogieIcfgContainer [2019-11-27 22:28:05,252 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 22:28:05,254 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 22:28:05,254 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 22:28:05,258 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 22:28:05,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 10:28:04" (1/3) ... [2019-11-27 22:28:05,260 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30d7233c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:28:05, skipping insertion in model container [2019-11-27 22:28:05,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:28:04" (2/3) ... [2019-11-27 22:28:05,260 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30d7233c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:28:05, skipping insertion in model container [2019-11-27 22:28:05,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:28:05" (3/3) ... [2019-11-27 22:28:05,262 INFO L109 eAbstractionObserver]: Analyzing ICFG flag_loopdep.i [2019-11-27 22:28:05,273 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 22:28:05,281 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 22:28:05,294 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 22:28:05,319 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 22:28:05,320 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 22:28:05,320 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 22:28:05,320 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 22:28:05,320 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 22:28:05,321 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 22:28:05,321 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 22:28:05,321 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 22:28:05,337 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2019-11-27 22:28:05,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-27 22:28:05,344 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:28:05,345 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:28:05,346 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:28:05,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:28:05,351 INFO L82 PathProgramCache]: Analyzing trace with hash -2060710478, now seen corresponding path program 1 times [2019-11-27 22:28:05,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:28:05,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812847593] [2019-11-27 22:28:05,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:28:05,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:28:05,485 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-27 22:28:05,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812847593] [2019-11-27 22:28:05,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:28:05,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:28:05,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249500749] [2019-11-27 22:28:05,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-27 22:28:05,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:28:05,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-27 22:28:05,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-27 22:28:05,514 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2019-11-27 22:28:05,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:28:05,543 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2019-11-27 22:28:05,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-27 22:28:05,546 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-11-27 22:28:05,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:28:05,563 INFO L225 Difference]: With dead ends: 36 [2019-11-27 22:28:05,564 INFO L226 Difference]: Without dead ends: 16 [2019-11-27 22:28:05,573 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-27 22:28:05,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-11-27 22:28:05,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-11-27 22:28:05,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-27 22:28:05,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2019-11-27 22:28:05,627 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 10 [2019-11-27 22:28:05,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:28:05,629 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-11-27 22:28:05,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-27 22:28:05,630 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2019-11-27 22:28:05,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-27 22:28:05,631 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:28:05,632 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:28:05,633 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:28:05,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:28:05,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1919336157, now seen corresponding path program 1 times [2019-11-27 22:28:05,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:28:05,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814740676] [2019-11-27 22:28:05,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:28:05,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:28:05,741 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-27 22:28:05,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814740676] [2019-11-27 22:28:05,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:28:05,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:28:05,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273057922] [2019-11-27 22:28:05,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:28:05,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:28:05,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:28:05,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:28:05,744 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand 3 states. [2019-11-27 22:28:05,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:28:05,780 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2019-11-27 22:28:05,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:28:05,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-27 22:28:05,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:28:05,782 INFO L225 Difference]: With dead ends: 34 [2019-11-27 22:28:05,782 INFO L226 Difference]: Without dead ends: 26 [2019-11-27 22:28:05,783 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-27 22:28:05,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-27 22:28:05,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 17. [2019-11-27 22:28:05,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-27 22:28:05,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-11-27 22:28:05,789 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2019-11-27 22:28:05,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:28:05,789 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-11-27 22:28:05,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:28:05,790 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2019-11-27 22:28:05,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-27 22:28:05,790 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:28:05,791 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:28:05,791 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:28:05,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:28:05,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1200955363, now seen corresponding path program 1 times [2019-11-27 22:28:05,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:28:05,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098964774] [2019-11-27 22:28:05,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:28:05,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:28:05,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:28:05,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098964774] [2019-11-27 22:28:05,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:28:05,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:28:05,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520351807] [2019-11-27 22:28:05,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:28:05,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:28:05,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:28:05,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:28:05,894 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 3 states. [2019-11-27 22:28:05,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:28:05,920 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2019-11-27 22:28:05,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:28:05,922 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-27 22:28:05,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:28:05,923 INFO L225 Difference]: With dead ends: 31 [2019-11-27 22:28:05,923 INFO L226 Difference]: Without dead ends: 17 [2019-11-27 22:28:05,924 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-27 22:28:05,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-11-27 22:28:05,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-27 22:28:05,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-27 22:28:05,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-11-27 22:28:05,931 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 13 [2019-11-27 22:28:05,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:28:05,931 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-11-27 22:28:05,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:28:05,931 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2019-11-27 22:28:05,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-27 22:28:05,932 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:28:05,932 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:28:05,933 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:28:05,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:28:05,934 INFO L82 PathProgramCache]: Analyzing trace with hash 391608737, now seen corresponding path program 1 times [2019-11-27 22:28:05,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:28:05,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375564092] [2019-11-27 22:28:05,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:28:05,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:28:06,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-27 22:28:06,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375564092] [2019-11-27 22:28:06,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:28:06,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:28:06,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576521152] [2019-11-27 22:28:06,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:28:06,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:28:06,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:28:06,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:28:06,020 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand 3 states. [2019-11-27 22:28:06,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:28:06,037 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2019-11-27 22:28:06,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:28:06,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-27 22:28:06,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:28:06,040 INFO L225 Difference]: With dead ends: 32 [2019-11-27 22:28:06,041 INFO L226 Difference]: Without dead ends: 19 [2019-11-27 22:28:06,041 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-27 22:28:06,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-11-27 22:28:06,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-11-27 22:28:06,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-27 22:28:06,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2019-11-27 22:28:06,050 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 13 [2019-11-27 22:28:06,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:28:06,051 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-11-27 22:28:06,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:28:06,053 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2019-11-27 22:28:06,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-27 22:28:06,054 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:28:06,054 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:28:06,055 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:28:06,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:28:06,056 INFO L82 PathProgramCache]: Analyzing trace with hash 2027280351, now seen corresponding path program 1 times [2019-11-27 22:28:06,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:28:06,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272740035] [2019-11-27 22:28:06,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:28:06,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:28:06,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-27 22:28:06,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272740035] [2019-11-27 22:28:06,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672306527] [2019-11-27 22:28:06,125 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-27 22:28:06,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:28:06,186 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-27 22:28:06,192 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:28:06,240 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-27 22:28:06,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:28:06,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-11-27 22:28:06,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865144212] [2019-11-27 22:28:06,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-27 22:28:06,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:28:06,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-27 22:28:06,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-27 22:28:06,243 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand 6 states. [2019-11-27 22:28:06,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:28:06,268 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2019-11-27 22:28:06,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:28:06,270 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-27 22:28:06,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:28:06,270 INFO L225 Difference]: With dead ends: 34 [2019-11-27 22:28:06,271 INFO L226 Difference]: Without dead ends: 21 [2019-11-27 22:28:06,271 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-27 22:28:06,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-11-27 22:28:06,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-11-27 22:28:06,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-27 22:28:06,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-11-27 22:28:06,276 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 15 [2019-11-27 22:28:06,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:28:06,277 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-11-27 22:28:06,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-27 22:28:06,277 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2019-11-27 22:28:06,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-27 22:28:06,278 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:28:06,279 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:28:06,482 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:28:06,483 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:28:06,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:28:06,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1949671069, now seen corresponding path program 2 times [2019-11-27 22:28:06,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:28:06,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607371469] [2019-11-27 22:28:06,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:28:06,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:28:06,601 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-27 22:28:06,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607371469] [2019-11-27 22:28:06,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552942890] [2019-11-27 22:28:06,602 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-27 22:28:06,673 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-27 22:28:06,673 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 22:28:06,675 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-27 22:28:06,679 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:28:06,734 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-27 22:28:06,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:28:06,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-11-27 22:28:06,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362838411] [2019-11-27 22:28:06,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-27 22:28:06,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:28:06,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-27 22:28:06,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-11-27 22:28:06,738 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 8 states. [2019-11-27 22:28:06,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:28:06,768 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2019-11-27 22:28:06,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 22:28:06,769 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-11-27 22:28:06,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:28:06,770 INFO L225 Difference]: With dead ends: 36 [2019-11-27 22:28:06,770 INFO L226 Difference]: Without dead ends: 23 [2019-11-27 22:28:06,771 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-11-27 22:28:06,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-11-27 22:28:06,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-11-27 22:28:06,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-27 22:28:06,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2019-11-27 22:28:06,776 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 17 [2019-11-27 22:28:06,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:28:06,777 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-11-27 22:28:06,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-27 22:28:06,777 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2019-11-27 22:28:06,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-27 22:28:06,778 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:28:06,778 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:28:06,987 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:28:06,987 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:28:06,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:28:06,988 INFO L82 PathProgramCache]: Analyzing trace with hash 381595099, now seen corresponding path program 3 times [2019-11-27 22:28:06,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:28:06,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115349890] [2019-11-27 22:28:06,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:28:07,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:28:07,074 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-27 22:28:07,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115349890] [2019-11-27 22:28:07,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239063734] [2019-11-27 22:28:07,076 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-27 22:28:07,126 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-27 22:28:07,126 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 22:28:07,127 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 22:28:07,129 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:28:07,153 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-27 22:28:07,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:28:07,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-11-27 22:28:07,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573399367] [2019-11-27 22:28:07,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-27 22:28:07,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:28:07,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-27 22:28:07,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-27 22:28:07,159 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 8 states. [2019-11-27 22:28:07,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:28:07,264 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2019-11-27 22:28:07,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-27 22:28:07,266 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-11-27 22:28:07,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:28:07,267 INFO L225 Difference]: With dead ends: 57 [2019-11-27 22:28:07,268 INFO L226 Difference]: Without dead ends: 44 [2019-11-27 22:28:07,270 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-27 22:28:07,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-27 22:28:07,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 27. [2019-11-27 22:28:07,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-27 22:28:07,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2019-11-27 22:28:07,280 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 19 [2019-11-27 22:28:07,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:28:07,280 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-11-27 22:28:07,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-27 22:28:07,281 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2019-11-27 22:28:07,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-27 22:28:07,282 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:28:07,282 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:28:07,494 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:28:07,495 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:28:07,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:28:07,496 INFO L82 PathProgramCache]: Analyzing trace with hash 2044266853, now seen corresponding path program 4 times [2019-11-27 22:28:07,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:28:07,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437358236] [2019-11-27 22:28:07,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:28:07,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:28:07,606 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-27 22:28:07,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437358236] [2019-11-27 22:28:07,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310585981] [2019-11-27 22:28:07,607 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 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-27 22:28:07,663 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-27 22:28:07,663 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 22:28:07,664 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-27 22:28:07,666 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:28:07,698 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-27 22:28:07,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:28:07,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-11-27 22:28:07,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603103728] [2019-11-27 22:28:07,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-27 22:28:07,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:28:07,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-27 22:28:07,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-27 22:28:07,701 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 10 states. [2019-11-27 22:28:07,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:28:07,802 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2019-11-27 22:28:07,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-27 22:28:07,803 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-11-27 22:28:07,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:28:07,804 INFO L225 Difference]: With dead ends: 72 [2019-11-27 22:28:07,804 INFO L226 Difference]: Without dead ends: 56 [2019-11-27 22:28:07,805 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-27 22:28:07,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-27 22:28:07,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 32. [2019-11-27 22:28:07,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-27 22:28:07,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2019-11-27 22:28:07,810 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 24 [2019-11-27 22:28:07,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:28:07,811 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2019-11-27 22:28:07,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-27 22:28:07,811 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2019-11-27 22:28:07,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-27 22:28:07,812 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:28:07,812 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:28:08,016 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:28:08,020 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:28:08,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:28:08,021 INFO L82 PathProgramCache]: Analyzing trace with hash -441689129, now seen corresponding path program 5 times [2019-11-27 22:28:08,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:28:08,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145140128] [2019-11-27 22:28:08,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:28:08,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:28:08,148 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-27 22:28:08,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145140128] [2019-11-27 22:28:08,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679621282] [2019-11-27 22:28:08,149 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 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-27 22:28:08,243 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-27 22:28:08,244 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 22:28:08,245 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-27 22:28:08,247 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:28:08,303 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-27 22:28:08,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:28:08,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2019-11-27 22:28:08,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744606378] [2019-11-27 22:28:08,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-27 22:28:08,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:28:08,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-27 22:28:08,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-27 22:28:08,307 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 12 states. [2019-11-27 22:28:08,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:28:08,426 INFO L93 Difference]: Finished difference Result 87 states and 98 transitions. [2019-11-27 22:28:08,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-27 22:28:08,427 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2019-11-27 22:28:08,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:28:08,428 INFO L225 Difference]: With dead ends: 87 [2019-11-27 22:28:08,428 INFO L226 Difference]: Without dead ends: 68 [2019-11-27 22:28:08,429 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-27 22:28:08,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-27 22:28:08,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 37. [2019-11-27 22:28:08,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-27 22:28:08,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2019-11-27 22:28:08,439 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 29 [2019-11-27 22:28:08,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:28:08,440 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2019-11-27 22:28:08,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-27 22:28:08,445 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2019-11-27 22:28:08,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-27 22:28:08,445 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:28:08,446 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:28:08,646 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:28:08,647 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:28:08,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:28:08,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1895354217, now seen corresponding path program 6 times [2019-11-27 22:28:08,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:28:08,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460764335] [2019-11-27 22:28:08,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:28:08,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:28:08,790 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-27 22:28:08,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460764335] [2019-11-27 22:28:08,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130136864] [2019-11-27 22:28:08,791 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:28:08,854 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-11-27 22:28:08,854 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 22:28:08,856 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-27 22:28:08,858 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:28:08,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 22:28:08,987 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-11-27 22:28:08,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:28:08,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2019-11-27 22:28:08,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297858351] [2019-11-27 22:28:08,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-27 22:28:08,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:28:08,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-27 22:28:08,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-11-27 22:28:08,995 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 15 states. [2019-11-27 22:28:09,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:28:09,357 INFO L93 Difference]: Finished difference Result 71 states and 80 transitions. [2019-11-27 22:28:09,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-27 22:28:09,358 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2019-11-27 22:28:09,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:28:09,358 INFO L225 Difference]: With dead ends: 71 [2019-11-27 22:28:09,359 INFO L226 Difference]: Without dead ends: 49 [2019-11-27 22:28:09,359 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2019-11-27 22:28:09,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-27 22:28:09,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 42. [2019-11-27 22:28:09,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-27 22:28:09,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-11-27 22:28:09,365 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 34 [2019-11-27 22:28:09,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:28:09,365 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-11-27 22:28:09,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-27 22:28:09,365 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-11-27 22:28:09,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-27 22:28:09,366 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:28:09,367 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:28:09,571 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:28:09,571 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:28:09,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:28:09,572 INFO L82 PathProgramCache]: Analyzing trace with hash -958805492, now seen corresponding path program 1 times [2019-11-27 22:28:09,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:28:09,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006682871] [2019-11-27 22:28:09,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:28:09,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:28:09,643 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-11-27 22:28:09,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006682871] [2019-11-27 22:28:09,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:28:09,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:28:09,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634042021] [2019-11-27 22:28:09,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:28:09,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:28:09,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:28:09,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:28:09,644 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 3 states. [2019-11-27 22:28:09,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:28:09,648 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2019-11-27 22:28:09,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:28:09,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-27 22:28:09,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:28:09,649 INFO L225 Difference]: With dead ends: 49 [2019-11-27 22:28:09,649 INFO L226 Difference]: Without dead ends: 42 [2019-11-27 22:28:09,650 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-27 22:28:09,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-27 22:28:09,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-11-27 22:28:09,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-27 22:28:09,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2019-11-27 22:28:09,655 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 39 [2019-11-27 22:28:09,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:28:09,655 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2019-11-27 22:28:09,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:28:09,656 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2019-11-27 22:28:09,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-27 22:28:09,656 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:28:09,659 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:28:09,659 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:28:09,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:28:09,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1921874774, now seen corresponding path program 1 times [2019-11-27 22:28:09,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:28:09,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962509255] [2019-11-27 22:28:09,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:28:09,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:28:09,846 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-27 22:28:09,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962509255] [2019-11-27 22:28:09,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255285361] [2019-11-27 22:28:09,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:28:09,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:28:09,909 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-27 22:28:09,912 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:28:10,055 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-27 22:28:10,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:28:10,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-11-27 22:28:10,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165926879] [2019-11-27 22:28:10,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-27 22:28:10,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:28:10,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-27 22:28:10,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2019-11-27 22:28:10,057 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 18 states. [2019-11-27 22:28:10,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:28:10,103 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2019-11-27 22:28:10,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-27 22:28:10,105 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 41 [2019-11-27 22:28:10,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:28:10,106 INFO L225 Difference]: With dead ends: 70 [2019-11-27 22:28:10,106 INFO L226 Difference]: Without dead ends: 45 [2019-11-27 22:28:10,107 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2019-11-27 22:28:10,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-27 22:28:10,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-11-27 22:28:10,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-27 22:28:10,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2019-11-27 22:28:10,117 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 41 [2019-11-27 22:28:10,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:28:10,118 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2019-11-27 22:28:10,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-27 22:28:10,118 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2019-11-27 22:28:10,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-27 22:28:10,119 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:28:10,119 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:28:10,326 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:28:10,327 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:28:10,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:28:10,327 INFO L82 PathProgramCache]: Analyzing trace with hash 575418516, now seen corresponding path program 2 times [2019-11-27 22:28:10,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:28:10,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520166036] [2019-11-27 22:28:10,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:28:10,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:28:10,455 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-27 22:28:10,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520166036] [2019-11-27 22:28:10,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430938128] [2019-11-27 22:28:10,456 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:28:10,524 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-27 22:28:10,525 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 22:28:10,526 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-27 22:28:10,529 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:28:10,759 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-27 22:28:10,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:28:10,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2019-11-27 22:28:10,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925715807] [2019-11-27 22:28:10,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-27 22:28:10,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:28:10,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-27 22:28:10,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2019-11-27 22:28:10,763 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 20 states. [2019-11-27 22:28:10,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:28:10,814 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2019-11-27 22:28:10,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-27 22:28:10,815 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 43 [2019-11-27 22:28:10,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:28:10,816 INFO L225 Difference]: With dead ends: 72 [2019-11-27 22:28:10,816 INFO L226 Difference]: Without dead ends: 47 [2019-11-27 22:28:10,817 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2019-11-27 22:28:10,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-27 22:28:10,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-11-27 22:28:10,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-27 22:28:10,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2019-11-27 22:28:10,828 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 43 [2019-11-27 22:28:10,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:28:10,828 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2019-11-27 22:28:10,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-27 22:28:10,829 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2019-11-27 22:28:10,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-27 22:28:10,831 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:28:10,831 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:28:11,032 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:28:11,032 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:28:11,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:28:11,033 INFO L82 PathProgramCache]: Analyzing trace with hash -583889326, now seen corresponding path program 3 times [2019-11-27 22:28:11,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:28:11,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350374521] [2019-11-27 22:28:11,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:28:11,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:28:11,165 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-27 22:28:11,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350374521] [2019-11-27 22:28:11,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893500093] [2019-11-27 22:28:11,166 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:28:11,219 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-27 22:28:11,220 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 22:28:11,221 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-27 22:28:11,224 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:28:11,285 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-11-27 22:28:11,286 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 22:28:11,301 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 22:28:11,302 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 22:28:11,303 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-27 22:28:11,408 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 22:28:11,408 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 24 [2019-11-27 22:28:11,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 22:28:11,410 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-27 22:28:11,419 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 22:28:11,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 22:28:11,422 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 22:28:11,423 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:15 [2019-11-27 22:28:11,500 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-11-27 22:28:11,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:28:11,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2019-11-27 22:28:11,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624563737] [2019-11-27 22:28:11,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-27 22:28:11,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:28:11,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-27 22:28:11,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-11-27 22:28:11,503 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 19 states. [2019-11-27 22:28:13,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:28:13,090 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2019-11-27 22:28:13,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-27 22:28:13,092 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 45 [2019-11-27 22:28:13,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:28:13,093 INFO L225 Difference]: With dead ends: 63 [2019-11-27 22:28:13,093 INFO L226 Difference]: Without dead ends: 0 [2019-11-27 22:28:13,096 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=494, Invalid=1486, Unknown=0, NotChecked=0, Total=1980 [2019-11-27 22:28:13,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-27 22:28:13,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-27 22:28:13,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-27 22:28:13,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-27 22:28:13,097 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2019-11-27 22:28:13,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:28:13,099 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-27 22:28:13,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-27 22:28:13,100 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-27 22:28:13,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-27 22:28:13,306 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:28:13,308 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-27 22:28:13,481 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-11-27 22:28:13,526 INFO L246 CegarLoopResult]: For program point L2-1(line 2) no Hoare annotation was computed. [2019-11-27 22:28:13,526 INFO L246 CegarLoopResult]: For program point L2-3(line 2) no Hoare annotation was computed. [2019-11-27 22:28:13,526 INFO L246 CegarLoopResult]: For program point L31-2(lines 31 35) no Hoare annotation was computed. [2019-11-27 22:28:13,526 INFO L242 CegarLoopResult]: At program point L31-3(lines 31 35) the Hoare annotation is: (= ULTIMATE.start_main_~flag~0 1) [2019-11-27 22:28:13,526 INFO L246 CegarLoopResult]: For program point L31-4(lines 31 35) no Hoare annotation was computed. [2019-11-27 22:28:13,527 INFO L249 CegarLoopResult]: At program point L36(lines 17 37) the Hoare annotation is: true [2019-11-27 22:28:13,527 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-27 22:28:13,527 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-27 22:28:13,527 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-27 22:28:13,527 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 2) no Hoare annotation was computed. [2019-11-27 22:28:13,527 INFO L246 CegarLoopResult]: For program point L24-2(lines 24 30) no Hoare annotation was computed. [2019-11-27 22:28:13,527 INFO L242 CegarLoopResult]: At program point L24-3(lines 24 30) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~#a~0.offset| 0)) (.cse1 (= |ULTIMATE.start_main_~#a~0.offset| ULTIMATE.start_init_~a.offset)) (.cse2 (exists ((v_ULTIMATE.start_init_~i~0_26 Int)) (and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0.base|) (+ |ULTIMATE.start_main_~#a~0.offset| (* v_ULTIMATE.start_init_~i~0_26 4))) 0)) (<= 999999 v_ULTIMATE.start_init_~i~0_26) (< v_ULTIMATE.start_init_~i~0_26 1000000)))) (.cse3 (= ULTIMATE.start_main_~flag~0 0)) (.cse4 (= |ULTIMATE.start_main_~#a~0.base| ULTIMATE.start_init_~a.base)) (.cse5 (exists ((v_ULTIMATE.start_init_~i~0_26 Int)) (and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0.base|) (+ |ULTIMATE.start_main_~#a~0.offset| (* v_ULTIMATE.start_init_~i~0_26 4))) 0)) (< v_ULTIMATE.start_init_~i~0_26 ULTIMATE.start_init_~size) (<= ULTIMATE.start_init_~i~0 (+ v_ULTIMATE.start_init_~i~0_26 1))))) (.cse6 (= ULTIMATE.start_init_~size 1000000))) (or (and .cse0 .cse1 (= ULTIMATE.start_main_~i~1 0) .cse2 .cse3 .cse4 .cse5 .cse6) (and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#a~0.base|) |ULTIMATE.start_main_~#a~0.offset|)) .cse0 .cse1 .cse2 .cse3 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0.base|) |ULTIMATE.start_main_~#a~0.offset|) 0) .cse4 .cse5 (<= ULTIMATE.start_main_~i~1 999999) .cse6) (= ULTIMATE.start_main_~flag~0 1))) [2019-11-27 22:28:13,528 INFO L246 CegarLoopResult]: For program point L24-4(lines 24 30) no Hoare annotation was computed. [2019-11-27 22:28:13,528 INFO L246 CegarLoopResult]: For program point L12-2(lines 12 15) no Hoare annotation was computed. [2019-11-27 22:28:13,528 INFO L242 CegarLoopResult]: At program point L12-3(lines 12 15) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~#a~0.offset| 0)) (.cse1 (= |ULTIMATE.start_main_~#a~0.offset| ULTIMATE.start_init_~a.offset)) (.cse2 (= ULTIMATE.start_main_~flag~0 0)) (.cse3 (= |ULTIMATE.start_main_~#a~0.base| ULTIMATE.start_init_~a.base)) (.cse4 (= ULTIMATE.start_init_~size 1000000))) (or (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_init_~i~0 0) .cse4) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_ULTIMATE.start_init_~i~0_26 Int)) (and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0.base|) (+ |ULTIMATE.start_main_~#a~0.offset| (* v_ULTIMATE.start_init_~i~0_26 4))) 0)) (< v_ULTIMATE.start_init_~i~0_26 ULTIMATE.start_init_~size) (<= ULTIMATE.start_init_~i~0 (+ v_ULTIMATE.start_init_~i~0_26 1)))) .cse4))) [2019-11-27 22:28:13,528 INFO L246 CegarLoopResult]: For program point L33(lines 33 34) no Hoare annotation was computed. [2019-11-27 22:28:13,528 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-27 22:28:13,528 INFO L246 CegarLoopResult]: For program point L9(lines 9 16) no Hoare annotation was computed. [2019-11-27 22:28:13,528 INFO L246 CegarLoopResult]: For program point L26(lines 26 29) no Hoare annotation was computed. [2019-11-27 22:28:13,528 INFO L246 CegarLoopResult]: For program point L2(line 2) no Hoare annotation was computed. [2019-11-27 22:28:13,543 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-27 22:28:13,544 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:28:13,544 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:28:13,545 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:28:13,545 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-27 22:28:13,545 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:28:13,545 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:28:13,546 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:28:13,546 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-27 22:28:13,546 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-27 22:28:13,547 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:28:13,547 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:28:13,547 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:28:13,548 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-27 22:28:13,548 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-27 22:28:13,548 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:28:13,549 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:28:13,549 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:28:13,552 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 22:28:13,552 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 22:28:13,552 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 22:28:13,552 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 22:28:13,553 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 22:28:13,553 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 22:28:13,556 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-27 22:28:13,557 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:28:13,557 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:28:13,557 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:28:13,557 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-27 22:28:13,557 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:28:13,557 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:28:13,558 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:28:13,558 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-27 22:28:13,558 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-27 22:28:13,558 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:28:13,559 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:28:13,559 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:28:13,559 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-27 22:28:13,560 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-27 22:28:13,560 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:28:13,560 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:28:13,561 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:28:13,561 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 22:28:13,562 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 22:28:13,562 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 22:28:13,563 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 22:28:13,563 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 22:28:13,563 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 22:28:13,565 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-27 22:28:13,566 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:28:13,566 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:28:13,566 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:28:13,567 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 22:28:13,568 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-27 22:28:13,568 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:28:13,568 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:28:13,569 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:28:13,569 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 22:28:13,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 10:28:13 BoogieIcfgContainer [2019-11-27 22:28:13,574 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 22:28:13,574 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 22:28:13,574 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 22:28:13,575 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 22:28:13,575 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:28:05" (3/4) ... [2019-11-27 22:28:13,582 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-27 22:28:13,601 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-11-27 22:28:13,602 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-27 22:28:13,602 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-27 22:28:13,632 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((a == 0 && a == a) && flag == 0) && a == a) && i == 0) && size == 1000000) || (((((a == 0 && a == a) && flag == 0) && a == a) && (\exists v_ULTIMATE.start_init_~i~0_26 : int :: (!(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0_26 * 4] == 0) && v_ULTIMATE.start_init_~i~0_26 < size) && i <= v_ULTIMATE.start_init_~i~0_26 + 1)) && size == 1000000) [2019-11-27 22:28:13,633 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((a == 0 && a == a) && i == 0) && (\exists v_ULTIMATE.start_init_~i~0_26 : int :: (!(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0_26 * 4] == 0) && 999999 <= v_ULTIMATE.start_init_~i~0_26) && v_ULTIMATE.start_init_~i~0_26 < 1000000)) && flag == 0) && a == a) && (\exists v_ULTIMATE.start_init_~i~0_26 : int :: (!(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0_26 * 4] == 0) && v_ULTIMATE.start_init_~i~0_26 < size) && i <= v_ULTIMATE.start_init_~i~0_26 + 1)) && size == 1000000) || (((((((((0 == #memory_$Pointer$[a][a] && a == 0) && a == a) && (\exists v_ULTIMATE.start_init_~i~0_26 : int :: (!(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0_26 * 4] == 0) && 999999 <= v_ULTIMATE.start_init_~i~0_26) && v_ULTIMATE.start_init_~i~0_26 < 1000000)) && flag == 0) && #memory_$Pointer$[a][a] == 0) && a == a) && (\exists v_ULTIMATE.start_init_~i~0_26 : int :: (!(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0_26 * 4] == 0) && v_ULTIMATE.start_init_~i~0_26 < size) && i <= v_ULTIMATE.start_init_~i~0_26 + 1)) && i <= 999999) && size == 1000000)) || flag == 1 [2019-11-27 22:28:13,676 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 22:28:13,676 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 22:28:13,678 INFO L168 Benchmark]: Toolchain (without parser) took 9228.44 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 272.1 MB). Free memory was 961.7 MB in the beginning and 1.2 GB in the end (delta: -227.2 MB). Peak memory consumption was 44.9 MB. Max. memory is 11.5 GB. [2019-11-27 22:28:13,678 INFO L168 Benchmark]: CDTParser took 0.31 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-27 22:28:13,679 INFO L168 Benchmark]: CACSL2BoogieTranslator took 302.40 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-27 22:28:13,680 INFO L168 Benchmark]: Boogie Procedure Inliner took 104.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -191.3 MB). Peak memory consumption was 9.9 MB. Max. memory is 11.5 GB. [2019-11-27 22:28:13,680 INFO L168 Benchmark]: Boogie Preprocessor took 28.08 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-27 22:28:13,685 INFO L168 Benchmark]: RCFGBuilder took 362.78 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: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. [2019-11-27 22:28:13,685 INFO L168 Benchmark]: TraceAbstraction took 8320.15 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 126.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -81.6 MB). Peak memory consumption was 44.8 MB. Max. memory is 11.5 GB. [2019-11-27 22:28:13,686 INFO L168 Benchmark]: Witness Printer took 102.14 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. [2019-11-27 22:28:13,689 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.31 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 302.40 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 104.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -191.3 MB). Peak memory consumption was 9.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.08 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 362.78 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: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8320.15 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 126.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -81.6 MB). Peak memory consumption was 44.8 MB. Max. memory is 11.5 GB. * Witness Printer took 102.14 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 2]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 24]: Loop Invariant [2019-11-27 22:28:13,707 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-27 22:28:13,708 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:28:13,708 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:28:13,708 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:28:13,709 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-27 22:28:13,709 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:28:13,710 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:28:13,710 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:28:13,711 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-27 22:28:13,711 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-27 22:28:13,712 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:28:13,712 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:28:13,712 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:28:13,712 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-27 22:28:13,712 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-27 22:28:13,713 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:28:13,713 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:28:13,713 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:28:13,714 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 22:28:13,714 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 22:28:13,714 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 22:28:13,715 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 22:28:13,715 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 22:28:13,715 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 22:28:13,716 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-27 22:28:13,716 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:28:13,717 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:28:13,717 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:28:13,717 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-27 22:28:13,718 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:28:13,718 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:28:13,718 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:28:13,718 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-27 22:28:13,719 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-27 22:28:13,719 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:28:13,719 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:28:13,719 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:28:13,720 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-27 22:28:13,720 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-27 22:28:13,720 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:28:13,721 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:28:13,721 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:28:13,722 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 22:28:13,722 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 22:28:13,722 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 22:28:13,723 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 22:28:13,723 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 22:28:13,723 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((((a == 0 && a == a) && i == 0) && (\exists v_ULTIMATE.start_init_~i~0_26 : int :: (!(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0_26 * 4] == 0) && 999999 <= v_ULTIMATE.start_init_~i~0_26) && v_ULTIMATE.start_init_~i~0_26 < 1000000)) && flag == 0) && a == a) && (\exists v_ULTIMATE.start_init_~i~0_26 : int :: (!(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0_26 * 4] == 0) && v_ULTIMATE.start_init_~i~0_26 < size) && i <= v_ULTIMATE.start_init_~i~0_26 + 1)) && size == 1000000) || (((((((((0 == #memory_$Pointer$[a][a] && a == 0) && a == a) && (\exists v_ULTIMATE.start_init_~i~0_26 : int :: (!(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0_26 * 4] == 0) && 999999 <= v_ULTIMATE.start_init_~i~0_26) && v_ULTIMATE.start_init_~i~0_26 < 1000000)) && flag == 0) && #memory_$Pointer$[a][a] == 0) && a == a) && (\exists v_ULTIMATE.start_init_~i~0_26 : int :: (!(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0_26 * 4] == 0) && v_ULTIMATE.start_init_~i~0_26 < size) && i <= v_ULTIMATE.start_init_~i~0_26 + 1)) && i <= 999999) && size == 1000000)) || flag == 1 - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: flag == 1 - InvariantResult [Line: 12]: Loop Invariant [2019-11-27 22:28:13,725 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-27 22:28:13,725 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:28:13,725 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:28:13,725 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:28:13,726 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 22:28:13,727 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-27 22:28:13,727 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:28:13,727 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:28:13,727 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2019-11-27 22:28:13,728 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((((a == 0 && a == a) && flag == 0) && a == a) && i == 0) && size == 1000000) || (((((a == 0 && a == a) && flag == 0) && a == a) && (\exists v_ULTIMATE.start_init_~i~0_26 : int :: (!(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0_26 * 4] == 0) && v_ULTIMATE.start_init_~i~0_26 < size) && i <= v_ULTIMATE.start_init_~i~0_26 + 1)) && size == 1000000) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 1 error locations. Result: SAFE, OverallTime: 7.9s, OverallIterations: 14, TraceHistogramMax: 9, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, HoareTripleCheckerStatistics: 214 SDtfs, 241 SDslu, 499 SDs, 0 SdLazy, 507 SolverSat, 69 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 380 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 93 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 22 NumberOfFragments, 202 HoareAnnotationTreeSize, 4 FomulaSimplifications, 630 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 6 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 619 NumberOfCodeBlocks, 585 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 596 ConstructedInterpolants, 12 QuantifiedInterpolants, 79467 SizeOfPredicates, 37 NumberOfNonLiveVariables, 1175 ConjunctsInSsa, 94 ConjunctsInUnsatCore, 23 InterpolantComputations, 5 PerfectInterpolantSequences, 424/879 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...