./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-industry-pattern/array_of_struct_ptr_flag_init.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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-industry-pattern/array_of_struct_ptr_flag_init.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(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 452bca413427171f12d7ad8836a46968f2acfe1a ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-25 15:47:39,140 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-25 15:47:39,144 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-25 15:47:39,198 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-25 15:47:39,198 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-25 15:47:39,202 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-25 15:47:39,204 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-25 15:47:39,210 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-25 15:47:39,214 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-25 15:47:39,219 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-25 15:47:39,220 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-25 15:47:39,222 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-25 15:47:39,222 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-25 15:47:39,224 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-25 15:47:39,226 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-25 15:47:39,229 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-25 15:47:39,231 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-25 15:47:39,231 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-25 15:47:39,234 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-25 15:47:39,240 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-25 15:47:39,241 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-25 15:47:39,242 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-25 15:47:39,244 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-25 15:47:39,245 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-25 15:47:39,251 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-25 15:47:39,252 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-25 15:47:39,252 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-25 15:47:39,254 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-25 15:47:39,254 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-25 15:47:39,255 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-25 15:47:39,255 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-25 15:47:39,256 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-25 15:47:39,257 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-25 15:47:39,258 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-25 15:47:39,259 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-25 15:47:39,260 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-25 15:47:39,260 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-25 15:47:39,261 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-25 15:47:39,261 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-25 15:47:39,262 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-25 15:47:39,263 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-25 15:47:39,264 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-25 15:47:39,303 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-25 15:47:39,304 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-25 15:47:39,304 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-25 15:47:39,304 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-25 15:47:39,306 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-25 15:47:39,307 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-25 15:47:39,307 INFO L138 SettingsManager]: * Use SBE=true [2021-08-25 15:47:39,307 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-25 15:47:39,307 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-25 15:47:39,308 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-25 15:47:39,308 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-25 15:47:39,309 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-25 15:47:39,309 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-25 15:47:39,309 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-25 15:47:39,309 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-25 15:47:39,309 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-25 15:47:39,309 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-25 15:47:39,310 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-25 15:47:39,310 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-25 15:47:39,310 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-25 15:47:39,310 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-25 15:47:39,310 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-25 15:47:39,311 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 15:47:39,311 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-25 15:47:39,311 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-25 15:47:39,311 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-25 15:47:39,311 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-25 15:47:39,311 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-25 15:47:39,312 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-25 15:47:39,312 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-25 15:47:39,312 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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(reach_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 -> 452bca413427171f12d7ad8836a46968f2acfe1a [2021-08-25 15:47:39,648 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-25 15:47:39,673 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-25 15:47:39,676 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-25 15:47:39,678 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-25 15:47:39,678 INFO L275 PluginConnector]: CDTParser initialized [2021-08-25 15:47:39,679 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-industry-pattern/array_of_struct_ptr_flag_init.i [2021-08-25 15:47:39,758 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97cd13689/42459a42044544deb4e4202c954ebbb8/FLAGb67ab9339 [2021-08-25 15:47:40,204 INFO L306 CDTParser]: Found 1 translation units. [2021-08-25 15:47:40,205 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-industry-pattern/array_of_struct_ptr_flag_init.i [2021-08-25 15:47:40,212 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97cd13689/42459a42044544deb4e4202c954ebbb8/FLAGb67ab9339 [2021-08-25 15:47:40,600 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97cd13689/42459a42044544deb4e4202c954ebbb8 [2021-08-25 15:47:40,603 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-25 15:47:40,605 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-25 15:47:40,609 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-25 15:47:40,609 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-25 15:47:40,613 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-25 15:47:40,614 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 03:47:40" (1/1) ... [2021-08-25 15:47:40,615 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7deea738 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 03:47:40, skipping insertion in model container [2021-08-25 15:47:40,615 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 03:47:40" (1/1) ... [2021-08-25 15:47:40,622 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-25 15:47:40,635 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-25 15:47:40,780 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-industry-pattern/array_of_struct_ptr_flag_init.i[959,972] [2021-08-25 15:47:40,800 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 15:47:40,813 INFO L203 MainTranslator]: Completed pre-run [2021-08-25 15:47:40,827 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-industry-pattern/array_of_struct_ptr_flag_init.i[959,972] [2021-08-25 15:47:40,841 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 15:47:40,861 INFO L208 MainTranslator]: Completed translation [2021-08-25 15:47:40,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 03:47:40 WrapperNode [2021-08-25 15:47:40,864 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-25 15:47:40,865 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-25 15:47:40,865 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-25 15:47:40,866 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-25 15:47:40,872 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 03:47:40" (1/1) ... [2021-08-25 15:47:40,893 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 03:47:40" (1/1) ... [2021-08-25 15:47:40,909 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-25 15:47:40,910 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-25 15:47:40,910 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-25 15:47:40,910 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-25 15:47:40,917 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 03:47:40" (1/1) ... [2021-08-25 15:47:40,917 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 03:47:40" (1/1) ... [2021-08-25 15:47:40,919 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 03:47:40" (1/1) ... [2021-08-25 15:47:40,919 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 03:47:40" (1/1) ... [2021-08-25 15:47:40,924 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 03:47:40" (1/1) ... [2021-08-25 15:47:40,928 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 03:47:40" (1/1) ... [2021-08-25 15:47:40,930 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 03:47:40" (1/1) ... [2021-08-25 15:47:40,932 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-25 15:47:40,933 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-25 15:47:40,933 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-25 15:47:40,933 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-25 15:47:40,934 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 03:47:40" (1/1) ... [2021-08-25 15:47:40,940 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 15:47:40,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 15:47:40,974 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-25 15:47:41,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-25 15:47:41,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-25 15:47:41,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-25 15:47:41,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-25 15:47:41,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-25 15:47:41,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-25 15:47:41,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-25 15:47:41,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-25 15:47:41,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-25 15:47:41,343 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-25 15:47:41,343 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2021-08-25 15:47:41,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 03:47:41 BoogieIcfgContainer [2021-08-25 15:47:41,345 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-25 15:47:41,347 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-25 15:47:41,347 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-25 15:47:41,350 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-25 15:47:41,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 03:47:40" (1/3) ... [2021-08-25 15:47:41,351 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cfbe325 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 03:47:41, skipping insertion in model container [2021-08-25 15:47:41,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 03:47:40" (2/3) ... [2021-08-25 15:47:41,351 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cfbe325 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 03:47:41, skipping insertion in model container [2021-08-25 15:47:41,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 03:47:41" (3/3) ... [2021-08-25 15:47:41,353 INFO L111 eAbstractionObserver]: Analyzing ICFG array_of_struct_ptr_flag_init.i [2021-08-25 15:47:41,357 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-25 15:47:41,358 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-25 15:47:41,409 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-25 15:47:41,415 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-25 15:47:41,416 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-25 15:47:41,428 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 15:47:41,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-25 15:47:41,433 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 15:47:41,433 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 15:47:41,434 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 15:47:41,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 15:47:41,439 INFO L82 PathProgramCache]: Analyzing trace with hash -2060710478, now seen corresponding path program 1 times [2021-08-25 15:47:41,447 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 15:47:41,448 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683222284] [2021-08-25 15:47:41,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 15:47:41,449 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 15:47:41,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 15:47:41,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 15:47:41,608 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 15:47:41,609 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683222284] [2021-08-25 15:47:41,609 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683222284] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 15:47:41,610 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 15:47:41,610 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 15:47:41,612 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990967204] [2021-08-25 15:47:41,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 15:47:41,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 15:47:41,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 15:47:41,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 15:47:41,629 INFO L87 Difference]: Start difference. First operand has 20 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 15:47:41,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 15:47:41,656 INFO L93 Difference]: Finished difference Result 38 states and 54 transitions. [2021-08-25 15:47:41,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 15:47:41,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-08-25 15:47:41,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 15:47:41,664 INFO L225 Difference]: With dead ends: 38 [2021-08-25 15:47:41,665 INFO L226 Difference]: Without dead ends: 18 [2021-08-25 15:47:41,667 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 15:47:41,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2021-08-25 15:47:41,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2021-08-25 15:47:41,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 15:47:41,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2021-08-25 15:47:41,694 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2021-08-25 15:47:41,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 15:47:41,694 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2021-08-25 15:47:41,694 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 15:47:41,695 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2021-08-25 15:47:41,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-25 15:47:41,695 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 15:47:41,695 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 15:47:41,696 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-25 15:47:41,696 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 15:47:41,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 15:47:41,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1264138591, now seen corresponding path program 1 times [2021-08-25 15:47:41,697 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 15:47:41,698 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984581400] [2021-08-25 15:47:41,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 15:47:41,698 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 15:47:41,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 15:47:41,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-25 15:47:41,742 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 15:47:41,742 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984581400] [2021-08-25 15:47:41,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984581400] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 15:47:41,743 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 15:47:41,743 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 15:47:41,743 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509884547] [2021-08-25 15:47:41,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 15:47:41,745 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 15:47:41,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 15:47:41,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 15:47:41,746 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 15:47:41,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 15:47:41,776 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2021-08-25 15:47:41,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 15:47:41,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-08-25 15:47:41,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 15:47:41,778 INFO L225 Difference]: With dead ends: 35 [2021-08-25 15:47:41,778 INFO L226 Difference]: Without dead ends: 27 [2021-08-25 15:47:41,779 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 15:47:41,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-08-25 15:47:41,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 18. [2021-08-25 15:47:41,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 15:47:41,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2021-08-25 15:47:41,783 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 12 [2021-08-25 15:47:41,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 15:47:41,783 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-08-25 15:47:41,783 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 15:47:41,784 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2021-08-25 15:47:41,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-25 15:47:41,784 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 15:47:41,784 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 15:47:41,785 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-25 15:47:41,785 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 15:47:41,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 15:47:41,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1458340319, now seen corresponding path program 1 times [2021-08-25 15:47:41,786 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 15:47:41,786 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173747026] [2021-08-25 15:47:41,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 15:47:41,787 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 15:47:41,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 15:47:41,851 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-25 15:47:41,851 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 15:47:41,852 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173747026] [2021-08-25 15:47:41,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173747026] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 15:47:41,852 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441271260] [2021-08-25 15:47:41,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 15:47:41,853 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 15:47:41,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 15:47:41,857 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 15:47:41,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-08-25 15:47:41,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 15:47:41,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 15:47:41,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 15:47:42,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-25 15:47:42,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441271260] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 15:47:42,060 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-25 15:47:42,061 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-08-25 15:47:42,061 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126979900] [2021-08-25 15:47:42,062 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 15:47:42,062 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 15:47:42,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 15:47:42,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-25 15:47:42,064 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 15:47:42,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 15:47:42,083 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2021-08-25 15:47:42,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 15:47:42,084 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-08-25 15:47:42,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 15:47:42,086 INFO L225 Difference]: With dead ends: 32 [2021-08-25 15:47:42,086 INFO L226 Difference]: Without dead ends: 18 [2021-08-25 15:47:42,086 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 17.7ms TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-25 15:47:42,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2021-08-25 15:47:42,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2021-08-25 15:47:42,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 15:47:42,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2021-08-25 15:47:42,092 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 15 [2021-08-25 15:47:42,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 15:47:42,093 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2021-08-25 15:47:42,093 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 15:47:42,093 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2021-08-25 15:47:42,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-25 15:47:42,094 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 15:47:42,094 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 15:47:42,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-08-25 15:47:42,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 15:47:42,309 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 15:47:42,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 15:47:42,310 INFO L82 PathProgramCache]: Analyzing trace with hash 2027280351, now seen corresponding path program 1 times [2021-08-25 15:47:42,310 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 15:47:42,311 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425277363] [2021-08-25 15:47:42,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 15:47:42,311 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 15:47:42,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 15:47:42,363 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-25 15:47:42,363 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 15:47:42,363 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425277363] [2021-08-25 15:47:42,365 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425277363] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 15:47:42,365 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753519757] [2021-08-25 15:47:42,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 15:47:42,366 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 15:47:42,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 15:47:42,367 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 15:47:42,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-08-25 15:47:42,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 15:47:42,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-25 15:47:42,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 15:47:42,654 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-25 15:47:42,654 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753519757] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 15:47:42,654 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 15:47:42,655 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-08-25 15:47:42,656 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212852555] [2021-08-25 15:47:42,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 15:47:42,656 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 15:47:42,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 15:47:42,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 15:47:42,658 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 15:47:42,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 15:47:42,792 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2021-08-25 15:47:42,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 15:47:42,793 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-08-25 15:47:42,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 15:47:42,793 INFO L225 Difference]: With dead ends: 53 [2021-08-25 15:47:42,793 INFO L226 Difference]: Without dead ends: 40 [2021-08-25 15:47:42,794 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 32.4ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 15:47:42,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-08-25 15:47:42,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 23. [2021-08-25 15:47:42,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 15:47:42,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2021-08-25 15:47:42,797 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 15 [2021-08-25 15:47:42,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 15:47:42,798 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2021-08-25 15:47:42,798 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 15:47:42,798 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2021-08-25 15:47:42,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-25 15:47:42,798 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 15:47:42,799 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 15:47:42,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-08-25 15:47:42,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2021-08-25 15:47:43,000 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 15:47:43,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 15:47:43,000 INFO L82 PathProgramCache]: Analyzing trace with hash -2139127327, now seen corresponding path program 2 times [2021-08-25 15:47:43,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 15:47:43,000 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812635810] [2021-08-25 15:47:43,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 15:47:43,000 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 15:47:43,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 15:47:43,126 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-08-25 15:47:43,127 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 15:47:43,127 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812635810] [2021-08-25 15:47:43,127 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812635810] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 15:47:43,128 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756943026] [2021-08-25 15:47:43,128 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-25 15:47:43,128 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 15:47:43,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 15:47:43,129 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 15:47:43,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-08-25 15:47:43,301 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-25 15:47:43,302 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-25 15:47:43,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-25 15:47:43,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 15:47:43,506 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-08-25 15:47:43,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756943026] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 15:47:43,507 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 15:47:43,507 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-08-25 15:47:43,507 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206735118] [2021-08-25 15:47:43,508 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-25 15:47:43,508 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 15:47:43,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-25 15:47:43,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2021-08-25 15:47:43,509 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 15:47:43,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 15:47:43,536 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2021-08-25 15:47:43,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-25 15:47:43,541 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-08-25 15:47:43,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 15:47:43,543 INFO L225 Difference]: With dead ends: 42 [2021-08-25 15:47:43,543 INFO L226 Difference]: Without dead ends: 26 [2021-08-25 15:47:43,546 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 73.6ms TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2021-08-25 15:47:43,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-08-25 15:47:43,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2021-08-25 15:47:43,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 15:47:43,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2021-08-25 15:47:43,557 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 20 [2021-08-25 15:47:43,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 15:47:43,557 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2021-08-25 15:47:43,557 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 15:47:43,558 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2021-08-25 15:47:43,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-08-25 15:47:43,559 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 15:47:43,559 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 15:47:43,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-08-25 15:47:43,772 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 15:47:43,773 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 15:47:43,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 15:47:43,774 INFO L82 PathProgramCache]: Analyzing trace with hash -331071005, now seen corresponding path program 3 times [2021-08-25 15:47:43,774 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 15:47:43,774 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73499607] [2021-08-25 15:47:43,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 15:47:43,775 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 15:47:43,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 15:47:43,899 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-08-25 15:47:43,899 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 15:47:43,900 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73499607] [2021-08-25 15:47:43,900 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73499607] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 15:47:43,900 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308367394] [2021-08-25 15:47:43,900 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-25 15:47:43,900 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 15:47:43,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 15:47:43,902 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 15:47:43,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-08-25 15:47:44,000 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-08-25 15:47:44,001 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-25 15:47:44,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-25 15:47:44,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 15:47:44,106 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-08-25 15:47:44,107 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308367394] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 15:47:44,107 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 15:47:44,107 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2021-08-25 15:47:44,107 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041691765] [2021-08-25 15:47:44,109 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-25 15:47:44,109 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 15:47:44,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-25 15:47:44,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-08-25 15:47:44,111 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 15:47:44,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 15:47:44,194 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2021-08-25 15:47:44,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-25 15:47:44,194 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-08-25 15:47:44,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 15:47:44,196 INFO L225 Difference]: With dead ends: 70 [2021-08-25 15:47:44,196 INFO L226 Difference]: Without dead ends: 54 [2021-08-25 15:47:44,196 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 49.8ms TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-08-25 15:47:44,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2021-08-25 15:47:44,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 30. [2021-08-25 15:47:44,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 15:47:44,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2021-08-25 15:47:44,209 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 22 [2021-08-25 15:47:44,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 15:47:44,209 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2021-08-25 15:47:44,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 15:47:44,211 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2021-08-25 15:47:44,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-25 15:47:44,212 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 15:47:44,212 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 15:47:44,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-08-25 15:47:44,428 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 15:47:44,429 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 15:47:44,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 15:47:44,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1534672359, now seen corresponding path program 4 times [2021-08-25 15:47:44,430 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 15:47:44,430 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196213389] [2021-08-25 15:47:44,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 15:47:44,430 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 15:47:44,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 15:47:44,558 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-08-25 15:47:44,558 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 15:47:44,558 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196213389] [2021-08-25 15:47:44,558 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196213389] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 15:47:44,559 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057439308] [2021-08-25 15:47:44,559 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-25 15:47:44,559 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 15:47:44,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 15:47:44,565 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 15:47:44,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-08-25 15:47:44,664 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-25 15:47:44,664 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-25 15:47:44,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-25 15:47:44,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 15:47:44,772 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-08-25 15:47:44,773 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057439308] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 15:47:44,773 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 15:47:44,773 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2021-08-25 15:47:44,773 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305853588] [2021-08-25 15:47:44,774 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-25 15:47:44,774 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 15:47:44,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-25 15:47:44,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-08-25 15:47:44,775 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 15:47:44,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 15:47:44,852 INFO L93 Difference]: Finished difference Result 85 states and 96 transitions. [2021-08-25 15:47:44,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-25 15:47:44,853 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-08-25 15:47:44,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 15:47:44,854 INFO L225 Difference]: With dead ends: 85 [2021-08-25 15:47:44,854 INFO L226 Difference]: Without dead ends: 66 [2021-08-25 15:47:44,854 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 56.8ms TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-08-25 15:47:44,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-08-25 15:47:44,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 35. [2021-08-25 15:47:44,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 15:47:44,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2021-08-25 15:47:44,858 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 27 [2021-08-25 15:47:44,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 15:47:44,859 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2021-08-25 15:47:44,859 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 15:47:44,859 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2021-08-25 15:47:44,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-08-25 15:47:44,860 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 15:47:44,860 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 15:47:44,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-08-25 15:47:45,072 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 15:47:45,073 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 15:47:45,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 15:47:45,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1766720103, now seen corresponding path program 5 times [2021-08-25 15:47:45,074 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 15:47:45,074 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357545049] [2021-08-25 15:47:45,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 15:47:45,074 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 15:47:45,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 15:47:45,222 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-08-25 15:47:45,222 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 15:47:45,222 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357545049] [2021-08-25 15:47:45,222 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357545049] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 15:47:45,223 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209369000] [2021-08-25 15:47:45,223 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-25 15:47:45,223 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 15:47:45,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 15:47:45,224 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 15:47:45,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-08-25 15:47:45,366 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2021-08-25 15:47:45,366 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-25 15:47:45,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-25 15:47:45,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 15:47:45,547 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-08-25 15:47:45,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1209369000] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 15:47:45,548 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 15:47:45,548 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2021-08-25 15:47:45,548 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919911502] [2021-08-25 15:47:45,549 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-25 15:47:45,549 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 15:47:45,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-25 15:47:45,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-08-25 15:47:45,550 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 15:47:45,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 15:47:45,645 INFO L93 Difference]: Finished difference Result 100 states and 112 transitions. [2021-08-25 15:47:45,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-25 15:47:45,646 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-08-25 15:47:45,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 15:47:45,646 INFO L225 Difference]: With dead ends: 100 [2021-08-25 15:47:45,646 INFO L226 Difference]: Without dead ends: 78 [2021-08-25 15:47:45,647 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 86.9ms TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-08-25 15:47:45,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-08-25 15:47:45,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 40. [2021-08-25 15:47:45,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 15:47:45,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2021-08-25 15:47:45,651 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 32 [2021-08-25 15:47:45,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 15:47:45,651 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2021-08-25 15:47:45,651 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 15:47:45,651 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2021-08-25 15:47:45,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-08-25 15:47:45,652 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 15:47:45,652 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 15:47:45,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-08-25 15:47:45,872 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 15:47:45,873 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 15:47:45,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 15:47:45,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1089794667, now seen corresponding path program 6 times [2021-08-25 15:47:45,874 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 15:47:45,874 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481619156] [2021-08-25 15:47:45,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 15:47:45,874 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 15:47:45,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 15:47:46,003 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-08-25 15:47:46,004 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 15:47:46,004 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481619156] [2021-08-25 15:47:46,004 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481619156] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 15:47:46,004 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408620088] [2021-08-25 15:47:46,004 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-08-25 15:47:46,004 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 15:47:46,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 15:47:46,005 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 15:47:46,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-08-25 15:47:46,131 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2021-08-25 15:47:46,132 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-25 15:47:46,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 21 conjunts are in the unsatisfiable core [2021-08-25 15:47:46,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 15:47:46,569 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2021-08-25 15:47:46,569 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408620088] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 15:47:46,569 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 15:47:46,569 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2021-08-25 15:47:46,571 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486552118] [2021-08-25 15:47:46,572 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-25 15:47:46,572 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 15:47:46,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-25 15:47:46,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2021-08-25 15:47:46,573 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 15:47:46,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 15:47:46,800 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2021-08-25 15:47:46,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-25 15:47:46,800 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-08-25 15:47:46,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 15:47:46,803 INFO L225 Difference]: With dead ends: 77 [2021-08-25 15:47:46,803 INFO L226 Difference]: Without dead ends: 52 [2021-08-25 15:47:46,804 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 237.6ms TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2021-08-25 15:47:46,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-08-25 15:47:46,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 45. [2021-08-25 15:47:46,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.1136363636363635) internal successors, (49), 44 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 15:47:46,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2021-08-25 15:47:46,814 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 37 [2021-08-25 15:47:46,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 15:47:46,814 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2021-08-25 15:47:46,814 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 15:47:46,815 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2021-08-25 15:47:46,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-08-25 15:47:46,815 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 15:47:46,815 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 15:47:46,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-08-25 15:47:47,027 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 15:47:47,027 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 15:47:47,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 15:47:47,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1351978204, now seen corresponding path program 1 times [2021-08-25 15:47:47,028 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 15:47:47,028 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589759145] [2021-08-25 15:47:47,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 15:47:47,028 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 15:47:47,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 15:47:47,098 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2021-08-25 15:47:47,098 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 15:47:47,098 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589759145] [2021-08-25 15:47:47,098 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589759145] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 15:47:47,099 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 15:47:47,099 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 15:47:47,099 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414948064] [2021-08-25 15:47:47,100 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 15:47:47,101 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 15:47:47,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 15:47:47,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 15:47:47,103 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 15:47:47,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 15:47:47,108 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2021-08-25 15:47:47,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 15:47:47,109 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-08-25 15:47:47,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 15:47:47,111 INFO L225 Difference]: With dead ends: 52 [2021-08-25 15:47:47,111 INFO L226 Difference]: Without dead ends: 45 [2021-08-25 15:47:47,111 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 15:47:47,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2021-08-25 15:47:47,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2021-08-25 15:47:47,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 44 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 15:47:47,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2021-08-25 15:47:47,125 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 42 [2021-08-25 15:47:47,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 15:47:47,126 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2021-08-25 15:47:47,126 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 15:47:47,126 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2021-08-25 15:47:47,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-08-25 15:47:47,128 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 15:47:47,128 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 15:47:47,128 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-25 15:47:47,128 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 15:47:47,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 15:47:47,129 INFO L82 PathProgramCache]: Analyzing trace with hash 2040020590, now seen corresponding path program 1 times [2021-08-25 15:47:47,129 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 15:47:47,129 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578898954] [2021-08-25 15:47:47,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 15:47:47,129 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 15:47:47,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 15:47:47,280 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2021-08-25 15:47:47,281 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 15:47:47,281 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578898954] [2021-08-25 15:47:47,281 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578898954] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 15:47:47,281 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030163034] [2021-08-25 15:47:47,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 15:47:47,282 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 15:47:47,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 15:47:47,283 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 15:47:47,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-08-25 15:47:47,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 15:47:47,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-25 15:47:47,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 15:47:47,768 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2021-08-25 15:47:47,769 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030163034] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 15:47:47,769 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 15:47:47,769 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-08-25 15:47:47,769 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368995791] [2021-08-25 15:47:47,770 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-08-25 15:47:47,770 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 15:47:47,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-08-25 15:47:47,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2021-08-25 15:47:47,771 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 15:47:47,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 15:47:47,813 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2021-08-25 15:47:47,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-25 15:47:47,813 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-08-25 15:47:47,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 15:47:47,814 INFO L225 Difference]: With dead ends: 76 [2021-08-25 15:47:47,814 INFO L226 Difference]: Without dead ends: 48 [2021-08-25 15:47:47,815 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 166.6ms TimeCoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2021-08-25 15:47:47,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2021-08-25 15:47:47,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2021-08-25 15:47:47,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.065217391304348) internal successors, (49), 46 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 15:47:47,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2021-08-25 15:47:47,823 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 44 [2021-08-25 15:47:47,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 15:47:47,826 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2021-08-25 15:47:47,826 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 15:47:47,826 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2021-08-25 15:47:47,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-08-25 15:47:47,827 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 15:47:47,827 INFO L512 BasicCegarLoop]: trace histogram [8, 8, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 15:47:47,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-08-25 15:47:48,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-08-25 15:47:48,044 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 15:47:48,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 15:47:48,044 INFO L82 PathProgramCache]: Analyzing trace with hash 461215856, now seen corresponding path program 2 times [2021-08-25 15:47:48,044 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 15:47:48,044 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260465538] [2021-08-25 15:47:48,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 15:47:48,045 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 15:47:48,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 15:47:48,216 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2021-08-25 15:47:48,216 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 15:47:48,216 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260465538] [2021-08-25 15:47:48,217 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260465538] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 15:47:48,217 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621390118] [2021-08-25 15:47:48,217 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-25 15:47:48,217 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 15:47:48,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 15:47:48,218 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 15:47:48,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-08-25 15:47:48,398 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-25 15:47:48,398 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-25 15:47:48,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-25 15:47:48,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 15:47:48,747 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2021-08-25 15:47:48,748 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621390118] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 15:47:48,748 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 15:47:48,748 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-08-25 15:47:48,748 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466528030] [2021-08-25 15:47:48,749 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-08-25 15:47:48,749 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 15:47:48,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-08-25 15:47:48,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2021-08-25 15:47:48,750 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand has 20 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 15:47:48,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 15:47:48,794 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2021-08-25 15:47:48,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-25 15:47:48,795 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-08-25 15:47:48,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 15:47:48,795 INFO L225 Difference]: With dead ends: 78 [2021-08-25 15:47:48,795 INFO L226 Difference]: Without dead ends: 50 [2021-08-25 15:47:48,796 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 210.9ms TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2021-08-25 15:47:48,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-08-25 15:47:48,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2021-08-25 15:47:48,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 15:47:48,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2021-08-25 15:47:48,799 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 46 [2021-08-25 15:47:48,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 15:47:48,800 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2021-08-25 15:47:48,800 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 15:47:48,800 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2021-08-25 15:47:48,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-08-25 15:47:48,801 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 15:47:48,801 INFO L512 BasicCegarLoop]: trace histogram [9, 9, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 15:47:48,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-08-25 15:47:49,029 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 15:47:49,029 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 15:47:49,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 15:47:49,030 INFO L82 PathProgramCache]: Analyzing trace with hash -646678030, now seen corresponding path program 3 times [2021-08-25 15:47:49,030 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 15:47:49,030 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295807118] [2021-08-25 15:47:49,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 15:47:49,030 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 15:47:49,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 15:47:49,204 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2021-08-25 15:47:49,205 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 15:47:49,205 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295807118] [2021-08-25 15:47:49,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295807118] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 15:47:49,205 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712559805] [2021-08-25 15:47:49,205 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-25 15:47:49,205 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 15:47:49,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 15:47:49,209 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 15:47:49,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-08-25 15:47:49,406 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-08-25 15:47:49,406 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-25 15:47:49,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 24 conjunts are in the unsatisfiable core [2021-08-25 15:47:49,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 15:47:49,687 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-08-25 15:47:50,064 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-25 15:47:50,065 INFO L388 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 30 treesize of output 30 [2021-08-25 15:47:50,193 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2021-08-25 15:47:50,193 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1712559805] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 15:47:50,194 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 15:47:50,194 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2021-08-25 15:47:50,194 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352600239] [2021-08-25 15:47:50,195 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-08-25 15:47:50,195 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 15:47:50,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-25 15:47:50,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2021-08-25 15:47:50,197 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 15:47:53,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 15:47:53,068 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2021-08-25 15:47:53,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-08-25 15:47:53,069 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-08-25 15:47:53,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 15:47:53,069 INFO L225 Difference]: With dead ends: 69 [2021-08-25 15:47:53,069 INFO L226 Difference]: Without dead ends: 0 [2021-08-25 15:47:53,071 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 933.9ms TimeCoverageRelationStatistics Valid=494, Invalid=1486, Unknown=0, NotChecked=0, Total=1980 [2021-08-25 15:47:53,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-08-25 15:47:53,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-08-25 15:47:53,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 15:47:53,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-08-25 15:47:53,071 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2021-08-25 15:47:53,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 15:47:53,071 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-25 15:47:53,071 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 15:47:53,071 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-08-25 15:47:53,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-25 15:47:53,074 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 15:47:53,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-08-25 15:47:53,274 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-08-25 15:47:53,276 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-08-25 15:47:53,280 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 15:47:53,282 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 15:47:53,294 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 15:47:53,296 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 15:47:53,503 INFO L857 garLoopResultBuilder]: For program point L35-2(lines 35 41) no Hoare annotation was computed. [2021-08-25 15:47:53,504 INFO L853 garLoopResultBuilder]: At program point L35-3(lines 35 41) the Hoare annotation is: (let ((.cse0 (exists ((v_ULTIMATE.start_init_~i~0_26 Int)) (and (<= ULTIMATE.start_init_~i~0 (+ v_ULTIMATE.start_init_~i~0_26 1)) (< v_ULTIMATE.start_init_~i~0_26 ULTIMATE.start_init_~size) (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))))) (.cse1 (= |ULTIMATE.start_main_~#a~0.offset| 0)) (.cse2 (= ULTIMATE.start_main_~flag~0 0)) (.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)) (<= 99999 v_ULTIMATE.start_init_~i~0_26) (< v_ULTIMATE.start_init_~i~0_26 100000)))) (.cse4 (= |ULTIMATE.start_main_~#a~0.base| ULTIMATE.start_init_~a.base)) (.cse5 (= ULTIMATE.start_init_~size 100000)) (.cse6 (= |ULTIMATE.start_main_~#a~0.offset| ULTIMATE.start_init_~a.offset))) (or (<= 1 ULTIMATE.start_main_~flag~0) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_main_~i~1 0) .cse5 .cse6) (and (< ULTIMATE.start_main_~i~1 100000) .cse0 .cse1 .cse2 .cse3 .cse4 (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#a~0.base|) |ULTIMATE.start_main_~#a~0.offset|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0.base|) |ULTIMATE.start_main_~#a~0.offset|) 0) .cse5 .cse6))) [2021-08-25 15:47:53,504 INFO L857 garLoopResultBuilder]: For program point L35-4(lines 35 41) no Hoare annotation was computed. [2021-08-25 15:47:53,504 INFO L857 garLoopResultBuilder]: For program point L23-2(lines 23 26) no Hoare annotation was computed. [2021-08-25 15:47:53,504 INFO L853 garLoopResultBuilder]: At program point L23-3(lines 23 26) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~#a~0.offset| 0)) (.cse1 (= ULTIMATE.start_main_~flag~0 0)) (.cse2 (= |ULTIMATE.start_main_~#a~0.base| ULTIMATE.start_init_~a.base)) (.cse3 (= ULTIMATE.start_init_~size 100000)) (.cse4 (= |ULTIMATE.start_main_~#a~0.offset| ULTIMATE.start_init_~a.offset))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_init_~i~0 0) .cse3 .cse4) (and (exists ((v_ULTIMATE.start_init_~i~0_26 Int)) (and (<= ULTIMATE.start_init_~i~0 (+ v_ULTIMATE.start_init_~i~0_26 1)) (< v_ULTIMATE.start_init_~i~0_26 ULTIMATE.start_init_~size) (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)))) .cse0 .cse1 .cse2 .cse3 .cse4))) [2021-08-25 15:47:53,504 INFO L857 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2021-08-25 15:47:53,504 INFO L857 garLoopResultBuilder]: For program point L15-1(line 15) no Hoare annotation was computed. [2021-08-25 15:47:53,504 INFO L857 garLoopResultBuilder]: For program point L44(lines 44 45) no Hoare annotation was computed. [2021-08-25 15:47:53,504 INFO L857 garLoopResultBuilder]: For program point L15-3(line 15) no Hoare annotation was computed. [2021-08-25 15:47:53,504 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-08-25 15:47:53,504 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-08-25 15:47:53,504 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-08-25 15:47:53,505 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 15) no Hoare annotation was computed. [2021-08-25 15:47:53,505 INFO L857 garLoopResultBuilder]: For program point L20(lines 20 27) no Hoare annotation was computed. [2021-08-25 15:47:53,505 INFO L857 garLoopResultBuilder]: For program point L37(lines 37 40) no Hoare annotation was computed. [2021-08-25 15:47:53,505 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-08-25 15:47:53,505 INFO L857 garLoopResultBuilder]: For program point L42-2(lines 42 46) no Hoare annotation was computed. [2021-08-25 15:47:53,505 INFO L853 garLoopResultBuilder]: At program point L42-3(lines 42 46) the Hoare annotation is: (<= 1 ULTIMATE.start_main_~flag~0) [2021-08-25 15:47:53,505 INFO L857 garLoopResultBuilder]: For program point L42-4(lines 42 46) no Hoare annotation was computed. [2021-08-25 15:47:53,505 INFO L860 garLoopResultBuilder]: At program point L47(lines 28 48) the Hoare annotation is: true [2021-08-25 15:47:53,509 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-25 15:47:53,517 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2021-08-25 15:47:53,518 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2021-08-25 15:47:53,520 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-25 15:47:53,520 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2021-08-25 15:47:53,523 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2021-08-25 15:47:53,523 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2021-08-25 15:47:53,523 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-25 15:47:53,524 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2021-08-25 15:47:53,525 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2021-08-25 15:47:53,525 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2021-08-25 15:47:53,526 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-25 15:47:53,526 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2021-08-25 15:47:53,526 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-25 15:47:53,526 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2021-08-25 15:47:53,526 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2021-08-25 15:47:53,527 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2021-08-25 15:47:53,527 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2021-08-25 15:47:53,527 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2021-08-25 15:47:53,527 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-25 15:47:53,527 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2021-08-25 15:47:53,528 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-25 15:47:53,528 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2021-08-25 15:47:53,528 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2021-08-25 15:47:53,528 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2021-08-25 15:47:53,529 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-25 15:47:53,529 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-25 15:47:53,530 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2021-08-25 15:47:53,530 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2021-08-25 15:47:53,530 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-25 15:47:53,530 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2021-08-25 15:47:53,531 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-25 15:47:53,531 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2021-08-25 15:47:53,531 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2021-08-25 15:47:53,531 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2021-08-25 15:47:53,531 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2021-08-25 15:47:53,532 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2021-08-25 15:47:53,532 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-25 15:47:53,532 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2021-08-25 15:47:53,532 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-25 15:47:53,532 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2021-08-25 15:47:53,533 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2021-08-25 15:47:53,533 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2021-08-25 15:47:53,533 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-25 15:47:53,533 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-25 15:47:53,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 03:47:53 BoogieIcfgContainer [2021-08-25 15:47:53,534 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-25 15:47:53,535 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-25 15:47:53,535 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-25 15:47:53,535 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-25 15:47:53,536 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 03:47:41" (3/4) ... [2021-08-25 15:47:53,538 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-08-25 15:47:53,546 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2021-08-25 15:47:53,547 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-08-25 15:47:53,547 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-25 15:47:53,547 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-25 15:47:53,582 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((a == 0 && flag == 0) && a == a) && i == 0) && size == 100000) && a == a) || ((((((\exists v_ULTIMATE.start_init_~i~0_26 : int :: (i <= v_ULTIMATE.start_init_~i~0_26 + 1 && v_ULTIMATE.start_init_~i~0_26 < size) && !(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0_26 * 4] == 0)) && a == 0) && flag == 0) && a == a) && size == 100000) && a == a) [2021-08-25 15:47:53,582 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (1 <= flag || ((((((((\exists v_ULTIMATE.start_init_~i~0_26 : int :: (i <= v_ULTIMATE.start_init_~i~0_26 + 1 && v_ULTIMATE.start_init_~i~0_26 < size) && !(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0_26 * 4] == 0)) && a == 0) && flag == 0) && (\exists v_ULTIMATE.start_init_~i~0_26 : int :: (!(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0_26 * 4] == 0) && 99999 <= v_ULTIMATE.start_init_~i~0_26) && v_ULTIMATE.start_init_~i~0_26 < 100000)) && a == a) && i == 0) && size == 100000) && a == a)) || (((((((((i < 100000 && (\exists v_ULTIMATE.start_init_~i~0_26 : int :: (i <= v_ULTIMATE.start_init_~i~0_26 + 1 && v_ULTIMATE.start_init_~i~0_26 < size) && !(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0_26 * 4] == 0))) && a == 0) && flag == 0) && (\exists v_ULTIMATE.start_init_~i~0_26 : int :: (!(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0_26 * 4] == 0) && 99999 <= v_ULTIMATE.start_init_~i~0_26) && v_ULTIMATE.start_init_~i~0_26 < 100000)) && a == a) && 0 == #memory_$Pointer$[a][a]) && #memory_$Pointer$[a][a] == 0) && size == 100000) && a == a) [2021-08-25 15:47:53,596 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-25 15:47:53,597 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-25 15:47:53,598 INFO L168 Benchmark]: Toolchain (without parser) took 12992.05 ms. Allocated memory was 67.1 MB in the beginning and 157.3 MB in the end (delta: 90.2 MB). Free memory was 47.8 MB in the beginning and 113.3 MB in the end (delta: -65.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 16.1 GB. [2021-08-25 15:47:53,598 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 67.1 MB. Free memory is still 49.0 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 15:47:53,598 INFO L168 Benchmark]: CACSL2BoogieTranslator took 255.32 ms. Allocated memory is still 67.1 MB. Free memory was 47.6 MB in the beginning and 51.3 MB in the end (delta: -3.7 MB). Peak memory consumption was 11.5 MB. Max. memory is 16.1 GB. [2021-08-25 15:47:53,598 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.40 ms. Allocated memory is still 67.1 MB. Free memory was 51.3 MB in the beginning and 49.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-25 15:47:53,599 INFO L168 Benchmark]: Boogie Preprocessor took 21.89 ms. Allocated memory is still 67.1 MB. Free memory was 49.6 MB in the beginning and 48.4 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 15:47:53,599 INFO L168 Benchmark]: RCFGBuilder took 412.57 ms. Allocated memory is still 67.1 MB. Free memory was 48.4 MB in the beginning and 33.5 MB in the end (delta: 14.9 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-08-25 15:47:53,599 INFO L168 Benchmark]: TraceAbstraction took 12187.82 ms. Allocated memory was 67.1 MB in the beginning and 157.3 MB in the end (delta: 90.2 MB). Free memory was 33.0 MB in the beginning and 115.4 MB in the end (delta: -82.4 MB). Peak memory consumption was 81.2 MB. Max. memory is 16.1 GB. [2021-08-25 15:47:53,600 INFO L168 Benchmark]: Witness Printer took 61.69 ms. Allocated memory is still 157.3 MB. Free memory was 115.4 MB in the beginning and 113.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-25 15:47:53,601 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 67.1 MB. Free memory is still 49.0 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 255.32 ms. Allocated memory is still 67.1 MB. Free memory was 47.6 MB in the beginning and 51.3 MB in the end (delta: -3.7 MB). Peak memory consumption was 11.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 44.40 ms. Allocated memory is still 67.1 MB. Free memory was 51.3 MB in the beginning and 49.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 21.89 ms. Allocated memory is still 67.1 MB. Free memory was 49.6 MB in the beginning and 48.4 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 412.57 ms. Allocated memory is still 67.1 MB. Free memory was 48.4 MB in the beginning and 33.5 MB in the end (delta: 14.9 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 12187.82 ms. Allocated memory was 67.1 MB in the beginning and 157.3 MB in the end (delta: 90.2 MB). Free memory was 33.0 MB in the beginning and 115.4 MB in the end (delta: -82.4 MB). Peak memory consumption was 81.2 MB. Max. memory is 16.1 GB. * Witness Printer took 61.69 ms. Allocated memory is still 157.3 MB. Free memory was 115.4 MB in the beginning and 113.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - 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$.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 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 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 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 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 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 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 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 15]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12101.8ms, OverallIterations: 13, TraceHistogramMax: 9, EmptinessCheckTime: 17.0ms, AutomataDifference: 3753.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 228.0ms, InitialAbstractionConstructionTime: 8.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 190 SDtfs, 313 SDslu, 509 SDs, 0 SdLazy, 474 SolverSat, 81 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 2520.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 417 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 641 ImplicationChecksByTransitivity, 1884.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=12, InterpolantAutomatonStates: 121, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 88.2ms AutomataMinimizationTime, 13 MinimizatonAttempts, 130 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 23 NumberOfFragments, 202 HoareAnnotationTreeSize, 4 FomulaSimplifications, 684 FormulaSimplificationTreeSizeReduction, 22.1ms HoareSimplificationTime, 4 FomulaSimplificationsInter, 12 FormulaSimplificationTreeSizeReductionInter, 199.1ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 179.7ms SsaConstructionTime, 561.9ms SatisfiabilityAnalysisTime, 3955.3ms InterpolantComputationTime, 676 NumberOfCodeBlocks, 641 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 653 ConstructedInterpolants, 15 QuantifiedInterpolants, 2458 SizeOfPredicates, 31 NumberOfNonLiveVariables, 1474 ConjunctsInSsa, 96 ConjunctsInUnsatCore, 23 InterpolantComputations, 4 PerfectInterpolantSequences, 567/1049 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 23]: Loop Invariant [2021-08-25 15:47:53,617 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2021-08-25 15:47:53,617 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2021-08-25 15:47:53,618 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-25 15:47:53,618 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2021-08-25 15:47:53,619 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2021-08-25 15:47:53,620 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2021-08-25 15:47:53,620 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-25 15:47:53,620 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] Derived loop invariant: (((((a == 0 && flag == 0) && a == a) && i == 0) && size == 100000) && a == a) || ((((((\exists v_ULTIMATE.start_init_~i~0_26 : int :: (i <= v_ULTIMATE.start_init_~i~0_26 + 1 && v_ULTIMATE.start_init_~i~0_26 < size) && !(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0_26 * 4] == 0)) && a == 0) && flag == 0) && a == a) && size == 100000) && a == a) - InvariantResult [Line: 42]: Loop Invariant Derived loop invariant: 1 <= flag - InvariantResult [Line: 35]: Loop Invariant [2021-08-25 15:47:53,627 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2021-08-25 15:47:53,627 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2021-08-25 15:47:53,627 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-25 15:47:53,628 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2021-08-25 15:47:53,628 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-25 15:47:53,628 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2021-08-25 15:47:53,628 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2021-08-25 15:47:53,628 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2021-08-25 15:47:53,628 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2021-08-25 15:47:53,629 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2021-08-25 15:47:53,629 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-25 15:47:53,629 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2021-08-25 15:47:53,629 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-25 15:47:53,630 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2021-08-25 15:47:53,630 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2021-08-25 15:47:53,630 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2021-08-25 15:47:53,630 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-25 15:47:53,631 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-25 15:47:53,636 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2021-08-25 15:47:53,636 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2021-08-25 15:47:53,636 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-25 15:47:53,636 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2021-08-25 15:47:53,638 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-25 15:47:53,638 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2021-08-25 15:47:53,638 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2021-08-25 15:47:53,638 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2021-08-25 15:47:53,639 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2021-08-25 15:47:53,639 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2021-08-25 15:47:53,639 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-25 15:47:53,639 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2021-08-25 15:47:53,640 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-08-25 15:47:53,640 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2021-08-25 15:47:53,640 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2021-08-25 15:47:53,640 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0_26,QUANTIFIED] [2021-08-25 15:47:53,640 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-08-25 15:47:53,641 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (1 <= flag || ((((((((\exists v_ULTIMATE.start_init_~i~0_26 : int :: (i <= v_ULTIMATE.start_init_~i~0_26 + 1 && v_ULTIMATE.start_init_~i~0_26 < size) && !(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0_26 * 4] == 0)) && a == 0) && flag == 0) && (\exists v_ULTIMATE.start_init_~i~0_26 : int :: (!(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0_26 * 4] == 0) && 99999 <= v_ULTIMATE.start_init_~i~0_26) && v_ULTIMATE.start_init_~i~0_26 < 100000)) && a == a) && i == 0) && size == 100000) && a == a)) || (((((((((i < 100000 && (\exists v_ULTIMATE.start_init_~i~0_26 : int :: (i <= v_ULTIMATE.start_init_~i~0_26 + 1 && v_ULTIMATE.start_init_~i~0_26 < size) && !(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0_26 * 4] == 0))) && a == 0) && flag == 0) && (\exists v_ULTIMATE.start_init_~i~0_26 : int :: (!(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0_26 * 4] == 0) && 99999 <= v_ULTIMATE.start_init_~i~0_26) && v_ULTIMATE.start_init_~i~0_26 < 100000)) && a == a) && 0 == #memory_$Pointer$[a][a]) && #memory_$Pointer$[a][a] == 0) && size == 100000) && a == a) RESULT: Ultimate proved your program to be correct! [2021-08-25 15:47:53,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...