./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 35987657 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 b855c2333aba0768da7f98c0f43af3ba5efb2578eeec0e9146f1a7f4f307c07a --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-20 20:54:48,067 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 20:54:48,069 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 20:54:48,121 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 20:54:48,125 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 20:54:48,127 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 20:54:48,132 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 20:54:48,137 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 20:54:48,139 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 20:54:48,141 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 20:54:48,142 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 20:54:48,144 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 20:54:48,145 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 20:54:48,149 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 20:54:48,150 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 20:54:48,152 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 20:54:48,153 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 20:54:48,154 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 20:54:48,156 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 20:54:48,159 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 20:54:48,162 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 20:54:48,163 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 20:54:48,164 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 20:54:48,165 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 20:54:48,166 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 20:54:48,171 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 20:54:48,171 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 20:54:48,172 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 20:54:48,173 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 20:54:48,173 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 20:54:48,174 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 20:54:48,174 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 20:54:48,177 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 20:54:48,177 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 20:54:48,178 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 20:54:48,179 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 20:54:48,179 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 20:54:48,179 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 20:54:48,179 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 20:54:48,180 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 20:54:48,180 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 20:54:48,182 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 20:54:48,184 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-20 20:54:48,214 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 20:54:48,214 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 20:54:48,215 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 20:54:48,215 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 20:54:48,216 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 20:54:48,216 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 20:54:48,216 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 20:54:48,217 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 20:54:48,217 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 20:54:48,218 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 20:54:48,218 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 20:54:48,218 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 20:54:48,218 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 20:54:48,218 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 20:54:48,219 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-20 20:54:48,219 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 20:54:48,219 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-20 20:54:48,219 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 20:54:48,219 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-20 20:54:48,219 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 20:54:48,220 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-20 20:54:48,220 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 20:54:48,220 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 20:54:48,220 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 20:54:48,220 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 20:54:48,221 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 20:54:48,221 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 20:54:48,221 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-20 20:54:48,221 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 20:54:48,221 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 20:54:48,222 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-20 20:54:48,222 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-20 20:54:48,222 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-20 20:54:48,222 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 -> b855c2333aba0768da7f98c0f43af3ba5efb2578eeec0e9146f1a7f4f307c07a [2022-07-20 20:54:48,491 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 20:54:48,516 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 20:54:48,519 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 20:54:48,520 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 20:54:48,521 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 20:54:48,522 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 [2022-07-20 20:54:48,596 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72589d4e8/3b47df25f0a447f79602d84c1f4696a3/FLAGd01fc7637 [2022-07-20 20:54:49,021 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 20:54:49,022 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-industry-pattern/array_of_struct_ptr_flag_init.i [2022-07-20 20:54:49,032 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72589d4e8/3b47df25f0a447f79602d84c1f4696a3/FLAGd01fc7637 [2022-07-20 20:54:49,429 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72589d4e8/3b47df25f0a447f79602d84c1f4696a3 [2022-07-20 20:54:49,432 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 20:54:49,434 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 20:54:49,437 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 20:54:49,437 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 20:54:49,440 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 20:54:49,440 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 08:54:49" (1/1) ... [2022-07-20 20:54:49,441 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@478c059c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 08:54:49, skipping insertion in model container [2022-07-20 20:54:49,442 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 08:54:49" (1/1) ... [2022-07-20 20:54:49,448 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 20:54:49,462 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 20:54:49,609 WARN L230 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] [2022-07-20 20:54:49,625 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 20:54:49,631 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 20:54:49,642 WARN L230 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] [2022-07-20 20:54:49,647 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 20:54:49,657 INFO L208 MainTranslator]: Completed translation [2022-07-20 20:54:49,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 08:54:49 WrapperNode [2022-07-20 20:54:49,658 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 20:54:49,658 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 20:54:49,658 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 20:54:49,658 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 20:54:49,664 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 08:54:49" (1/1) ... [2022-07-20 20:54:49,670 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 08:54:49" (1/1) ... [2022-07-20 20:54:49,686 INFO L137 Inliner]: procedures = 20, calls = 15, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 64 [2022-07-20 20:54:49,686 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 20:54:49,687 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 20:54:49,687 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 20:54:49,687 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 20:54:49,694 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 08:54:49" (1/1) ... [2022-07-20 20:54:49,694 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 08:54:49" (1/1) ... [2022-07-20 20:54:49,696 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 08:54:49" (1/1) ... [2022-07-20 20:54:49,696 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 08:54:49" (1/1) ... [2022-07-20 20:54:49,701 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 08:54:49" (1/1) ... [2022-07-20 20:54:49,704 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 08:54:49" (1/1) ... [2022-07-20 20:54:49,706 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 08:54:49" (1/1) ... [2022-07-20 20:54:49,707 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 20:54:49,708 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 20:54:49,708 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 20:54:49,709 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 20:54:49,709 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 08:54:49" (1/1) ... [2022-07-20 20:54:49,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 20:54:49,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 20:54:49,761 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) [2022-07-20 20:54:49,772 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 [2022-07-20 20:54:49,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 20:54:49,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 20:54:49,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 20:54:49,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-20 20:54:49,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 20:54:49,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 20:54:49,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 20:54:49,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 20:54:49,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 20:54:49,891 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 20:54:49,893 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 20:54:50,053 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 20:54:50,058 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 20:54:50,058 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-20 20:54:50,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 08:54:50 BoogieIcfgContainer [2022-07-20 20:54:50,075 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 20:54:50,077 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 20:54:50,077 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 20:54:50,080 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 20:54:50,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 08:54:49" (1/3) ... [2022-07-20 20:54:50,081 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bf6b032 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 08:54:50, skipping insertion in model container [2022-07-20 20:54:50,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 08:54:49" (2/3) ... [2022-07-20 20:54:50,081 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bf6b032 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 08:54:50, skipping insertion in model container [2022-07-20 20:54:50,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 08:54:50" (3/3) ... [2022-07-20 20:54:50,083 INFO L111 eAbstractionObserver]: Analyzing ICFG array_of_struct_ptr_flag_init.i [2022-07-20 20:54:50,096 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 20:54:50,111 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-20 20:54:50,171 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 20:54:50,188 INFO L357 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, mAutomataTypeConcurrency=PETRI_NET, 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@740bca65, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@128cd68c [2022-07-20 20:54:50,189 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-20 20:54:50,194 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) [2022-07-20 20:54:50,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-20 20:54:50,202 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 20:54:50,203 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 20:54:50,204 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 20:54:50,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 20:54:50,211 INFO L85 PathProgramCache]: Analyzing trace with hash -2060710478, now seen corresponding path program 1 times [2022-07-20 20:54:50,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 20:54:50,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857590254] [2022-07-20 20:54:50,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 20:54:50,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 20:54:50,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 20:54:50,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 20:54:50,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 20:54:50,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857590254] [2022-07-20 20:54:50,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857590254] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 20:54:50,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 20:54:50,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 20:54:50,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280447805] [2022-07-20 20:54:50,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 20:54:50,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 20:54:50,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 20:54:50,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 20:54:50,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 20:54:50,484 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) [2022-07-20 20:54:50,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 20:54:50,520 INFO L93 Difference]: Finished difference Result 38 states and 54 transitions. [2022-07-20 20:54:50,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 20:54:50,523 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 [2022-07-20 20:54:50,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 20:54:50,530 INFO L225 Difference]: With dead ends: 38 [2022-07-20 20:54:50,531 INFO L226 Difference]: Without dead ends: 18 [2022-07-20 20:54:50,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 20:54:50,538 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 20:54:50,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 42 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 20:54:50,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-07-20 20:54:50,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2022-07-20 20:54:50,570 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) [2022-07-20 20:54:50,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2022-07-20 20:54:50,573 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2022-07-20 20:54:50,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 20:54:50,574 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-07-20 20:54:50,575 INFO L496 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) [2022-07-20 20:54:50,575 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-07-20 20:54:50,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-20 20:54:50,576 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 20:54:50,576 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 20:54:50,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 20:54:50,576 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 20:54:50,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 20:54:50,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1264138591, now seen corresponding path program 1 times [2022-07-20 20:54:50,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 20:54:50,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786266988] [2022-07-20 20:54:50,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 20:54:50,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 20:54:50,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 20:54:50,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 20:54:50,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 20:54:50,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786266988] [2022-07-20 20:54:50,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786266988] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 20:54:50,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 20:54:50,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 20:54:50,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998205156] [2022-07-20 20:54:50,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 20:54:50,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 20:54:50,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 20:54:50,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 20:54:50,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 20:54:50,633 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) [2022-07-20 20:54:50,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 20:54:50,661 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2022-07-20 20:54:50,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 20:54:50,662 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 [2022-07-20 20:54:50,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 20:54:50,663 INFO L225 Difference]: With dead ends: 35 [2022-07-20 20:54:50,663 INFO L226 Difference]: Without dead ends: 27 [2022-07-20 20:54:50,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 20:54:50,665 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 10 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 20:54:50,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 26 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 20:54:50,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-20 20:54:50,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 18. [2022-07-20 20:54:50,670 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) [2022-07-20 20:54:50,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2022-07-20 20:54:50,671 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 12 [2022-07-20 20:54:50,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 20:54:50,671 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2022-07-20 20:54:50,671 INFO L496 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) [2022-07-20 20:54:50,672 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-07-20 20:54:50,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-20 20:54:50,672 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 20:54:50,672 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 20:54:50,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 20:54:50,673 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 20:54:50,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 20:54:50,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1458340319, now seen corresponding path program 1 times [2022-07-20 20:54:50,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 20:54:50,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044084993] [2022-07-20 20:54:50,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 20:54:50,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 20:54:50,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 20:54:50,731 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 20:54:50,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 20:54:50,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044084993] [2022-07-20 20:54:50,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044084993] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 20:54:50,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [808323972] [2022-07-20 20:54:50,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 20:54:50,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 20:54:50,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 20:54:50,735 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) [2022-07-20 20:54:50,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-20 20:54:50,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 20:54:50,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 20:54:50,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 20:54:50,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 20:54:50,866 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 20:54:50,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [808323972] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 20:54:50,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 20:54:50,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-07-20 20:54:50,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631372167] [2022-07-20 20:54:50,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 20:54:50,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 20:54:50,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 20:54:50,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 20:54:50,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-20 20:54:50,875 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) [2022-07-20 20:54:50,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 20:54:50,892 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-07-20 20:54:50,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 20:54:50,893 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 [2022-07-20 20:54:50,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 20:54:50,894 INFO L225 Difference]: With dead ends: 32 [2022-07-20 20:54:50,894 INFO L226 Difference]: Without dead ends: 18 [2022-07-20 20:54:50,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-20 20:54:50,898 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 20:54:50,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 38 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 20:54:50,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-07-20 20:54:50,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-07-20 20:54:50,904 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) [2022-07-20 20:54:50,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-07-20 20:54:50,905 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 15 [2022-07-20 20:54:50,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 20:54:50,905 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-07-20 20:54:50,906 INFO L496 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) [2022-07-20 20:54:50,906 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-07-20 20:54:50,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-20 20:54:50,906 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 20:54:50,907 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 20:54:50,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-20 20:54:51,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 20:54:51,112 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 20:54:51,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 20:54:51,113 INFO L85 PathProgramCache]: Analyzing trace with hash 2027280351, now seen corresponding path program 1 times [2022-07-20 20:54:51,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 20:54:51,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170808109] [2022-07-20 20:54:51,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 20:54:51,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 20:54:51,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 20:54:51,162 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 20:54:51,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 20:54:51,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170808109] [2022-07-20 20:54:51,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170808109] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 20:54:51,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339046780] [2022-07-20 20:54:51,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 20:54:51,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 20:54:51,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 20:54:51,166 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) [2022-07-20 20:54:51,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-20 20:54:51,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 20:54:51,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-20 20:54:51,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 20:54:51,302 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 20:54:51,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 20:54:51,357 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 20:54:51,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339046780] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 20:54:51,358 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 20:54:51,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-07-20 20:54:51,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412318656] [2022-07-20 20:54:51,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 20:54:51,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 20:54:51,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 20:54:51,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 20:54:51,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-07-20 20:54:51,360 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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) [2022-07-20 20:54:51,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 20:54:51,413 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2022-07-20 20:54:51,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 20:54:51,413 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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) Word has length 15 [2022-07-20 20:54:51,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 20:54:51,414 INFO L225 Difference]: With dead ends: 56 [2022-07-20 20:54:51,414 INFO L226 Difference]: Without dead ends: 43 [2022-07-20 20:54:51,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-07-20 20:54:51,416 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 29 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 20:54:51,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 56 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 20:54:51,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-20 20:54:51,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 27. [2022-07-20 20:54:51,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 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) [2022-07-20 20:54:51,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-07-20 20:54:51,422 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 15 [2022-07-20 20:54:51,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 20:54:51,422 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-07-20 20:54:51,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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) [2022-07-20 20:54:51,423 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-07-20 20:54:51,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-20 20:54:51,426 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 20:54:51,426 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 20:54:51,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-20 20:54:51,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-20 20:54:51,628 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 20:54:51,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 20:54:51,628 INFO L85 PathProgramCache]: Analyzing trace with hash 2044266853, now seen corresponding path program 2 times [2022-07-20 20:54:51,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 20:54:51,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987370257] [2022-07-20 20:54:51,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 20:54:51,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 20:54:51,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 20:54:51,780 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-20 20:54:51,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 20:54:51,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987370257] [2022-07-20 20:54:51,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987370257] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 20:54:51,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900980813] [2022-07-20 20:54:51,781 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 20:54:51,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 20:54:51,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 20:54:51,783 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) [2022-07-20 20:54:51,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-20 20:54:51,871 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 20:54:51,871 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 20:54:51,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 20:54:51,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 20:54:51,966 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-20 20:54:51,966 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 20:54:52,062 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-20 20:54:52,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900980813] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 20:54:52,062 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 20:54:52,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-07-20 20:54:52,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608873547] [2022-07-20 20:54:52,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 20:54:52,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-20 20:54:52,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 20:54:52,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-20 20:54:52,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2022-07-20 20:54:52,065 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 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) [2022-07-20 20:54:52,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 20:54:52,122 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2022-07-20 20:54:52,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-20 20:54:52,123 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 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 24 [2022-07-20 20:54:52,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 20:54:52,123 INFO L225 Difference]: With dead ends: 55 [2022-07-20 20:54:52,124 INFO L226 Difference]: Without dead ends: 39 [2022-07-20 20:54:52,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2022-07-20 20:54:52,125 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 20 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 20:54:52,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 47 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 20:54:52,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-07-20 20:54:52,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-07-20 20:54:52,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 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) [2022-07-20 20:54:52,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2022-07-20 20:54:52,130 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 24 [2022-07-20 20:54:52,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 20:54:52,131 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2022-07-20 20:54:52,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 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) [2022-07-20 20:54:52,131 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2022-07-20 20:54:52,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-20 20:54:52,132 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 20:54:52,132 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 20:54:52,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-20 20:54:52,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 20:54:52,352 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 20:54:52,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 20:54:52,352 INFO L85 PathProgramCache]: Analyzing trace with hash 2120045553, now seen corresponding path program 3 times [2022-07-20 20:54:52,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 20:54:52,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953425890] [2022-07-20 20:54:52,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 20:54:52,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 20:54:52,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 20:54:52,608 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-20 20:54:52,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 20:54:52,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953425890] [2022-07-20 20:54:52,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953425890] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 20:54:52,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832249310] [2022-07-20 20:54:52,610 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 20:54:52,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 20:54:52,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 20:54:52,611 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) [2022-07-20 20:54:52,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-20 20:54:52,712 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-20 20:54:52,713 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 20:54:52,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 20:54:52,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 20:54:52,774 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-07-20 20:54:52,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 20:54:52,827 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-07-20 20:54:52,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832249310] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 20:54:52,828 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 20:54:52,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5, 5] total 19 [2022-07-20 20:54:52,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791356915] [2022-07-20 20:54:52,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 20:54:52,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-20 20:54:52,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 20:54:52,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-20 20:54:52,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2022-07-20 20:54:52,831 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 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) [2022-07-20 20:54:52,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 20:54:52,957 INFO L93 Difference]: Finished difference Result 106 states and 121 transitions. [2022-07-20 20:54:52,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-20 20:54:52,957 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 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 36 [2022-07-20 20:54:52,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 20:54:52,961 INFO L225 Difference]: With dead ends: 106 [2022-07-20 20:54:52,962 INFO L226 Difference]: Without dead ends: 90 [2022-07-20 20:54:52,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2022-07-20 20:54:52,964 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 85 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 20:54:52,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 100 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 20:54:52,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-20 20:54:52,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 53. [2022-07-20 20:54:52,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 52 states have internal predecessors, (56), 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) [2022-07-20 20:54:52,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2022-07-20 20:54:52,977 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 36 [2022-07-20 20:54:52,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 20:54:52,977 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2022-07-20 20:54:52,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 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) [2022-07-20 20:54:52,978 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2022-07-20 20:54:52,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-20 20:54:52,979 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 20:54:52,979 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 20:54:52,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-20 20:54:53,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 20:54:53,188 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 20:54:53,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 20:54:53,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1925935603, now seen corresponding path program 4 times [2022-07-20 20:54:53,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 20:54:53,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903765887] [2022-07-20 20:54:53,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 20:54:53,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 20:54:53,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 20:54:53,454 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-07-20 20:54:53,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 20:54:53,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903765887] [2022-07-20 20:54:53,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903765887] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 20:54:53,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188602632] [2022-07-20 20:54:53,455 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-20 20:54:53,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 20:54:53,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 20:54:53,457 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) [2022-07-20 20:54:53,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-20 20:54:54,090 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-20 20:54:54,091 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 20:54:54,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 20:54:54,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 20:54:54,201 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-07-20 20:54:54,201 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 20:54:54,346 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-07-20 20:54:54,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188602632] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 20:54:54,351 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 20:54:54,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 9] total 28 [2022-07-20 20:54:54,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098681343] [2022-07-20 20:54:54,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 20:54:54,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-20 20:54:54,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 20:54:54,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-20 20:54:54,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2022-07-20 20:54:54,356 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand has 28 states, 28 states have (on average 2.8214285714285716) internal successors, (79), 28 states have internal predecessors, (79), 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) [2022-07-20 20:54:54,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 20:54:54,533 INFO L93 Difference]: Finished difference Result 200 states and 227 transitions. [2022-07-20 20:54:54,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-20 20:54:54,533 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.8214285714285716) internal successors, (79), 28 states have internal predecessors, (79), 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 50 [2022-07-20 20:54:54,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 20:54:54,535 INFO L225 Difference]: With dead ends: 200 [2022-07-20 20:54:54,535 INFO L226 Difference]: Without dead ends: 172 [2022-07-20 20:54:54,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2022-07-20 20:54:54,536 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 222 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 20:54:54,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 130 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 20:54:54,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-07-20 20:54:54,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 79. [2022-07-20 20:54:54,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.0512820512820513) internal successors, (82), 78 states have internal predecessors, (82), 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) [2022-07-20 20:54:54,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2022-07-20 20:54:54,545 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 50 [2022-07-20 20:54:54,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 20:54:54,545 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2022-07-20 20:54:54,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.8214285714285716) internal successors, (79), 28 states have internal predecessors, (79), 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) [2022-07-20 20:54:54,546 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2022-07-20 20:54:54,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-20 20:54:54,547 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 20:54:54,547 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 20:54:54,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-20 20:54:54,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 20:54:54,776 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 20:54:54,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 20:54:54,776 INFO L85 PathProgramCache]: Analyzing trace with hash 2083201141, now seen corresponding path program 5 times [2022-07-20 20:54:54,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 20:54:54,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118107294] [2022-07-20 20:54:54,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 20:54:54,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 20:54:54,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 20:54:55,072 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2022-07-20 20:54:55,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 20:54:55,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118107294] [2022-07-20 20:54:55,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118107294] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 20:54:55,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612476327] [2022-07-20 20:54:55,072 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-20 20:54:55,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 20:54:55,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 20:54:55,076 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) [2022-07-20 20:54:55,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-20 20:54:55,638 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2022-07-20 20:54:55,639 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 20:54:55,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-20 20:54:55,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 20:54:55,898 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-07-20 20:54:55,899 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 20:54:56,309 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-07-20 20:54:56,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612476327] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 20:54:56,309 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 20:54:56,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 17] total 45 [2022-07-20 20:54:56,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797983457] [2022-07-20 20:54:56,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 20:54:56,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-20 20:54:56,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 20:54:56,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-20 20:54:56,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=600, Invalid=1380, Unknown=0, NotChecked=0, Total=1980 [2022-07-20 20:54:56,316 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand has 45 states, 45 states have (on average 2.8666666666666667) internal successors, (129), 45 states have internal predecessors, (129), 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) [2022-07-20 20:54:56,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 20:54:56,632 INFO L93 Difference]: Finished difference Result 386 states and 437 transitions. [2022-07-20 20:54:56,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-07-20 20:54:56,633 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.8666666666666667) internal successors, (129), 45 states have internal predecessors, (129), 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 76 [2022-07-20 20:54:56,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 20:54:56,634 INFO L225 Difference]: With dead ends: 386 [2022-07-20 20:54:56,635 INFO L226 Difference]: Without dead ends: 334 [2022-07-20 20:54:56,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=600, Invalid=1380, Unknown=0, NotChecked=0, Total=1980 [2022-07-20 20:54:56,636 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 570 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 20:54:56,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [570 Valid, 236 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 20:54:56,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2022-07-20 20:54:56,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 129. [2022-07-20 20:54:56,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 1.03125) internal successors, (132), 128 states have internal predecessors, (132), 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) [2022-07-20 20:54:56,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 132 transitions. [2022-07-20 20:54:56,648 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 132 transitions. Word has length 76 [2022-07-20 20:54:56,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 20:54:56,648 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 132 transitions. [2022-07-20 20:54:56,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.8666666666666667) internal successors, (129), 45 states have internal predecessors, (129), 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) [2022-07-20 20:54:56,648 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 132 transitions. [2022-07-20 20:54:56,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-07-20 20:54:56,650 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 20:54:56,650 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 30, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 20:54:56,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-20 20:54:56,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 20:54:56,860 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 20:54:56,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 20:54:56,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1615061623, now seen corresponding path program 6 times [2022-07-20 20:54:56,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 20:54:56,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582416280] [2022-07-20 20:54:56,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 20:54:56,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 20:54:56,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 20:54:57,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1504 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 1335 trivial. 0 not checked. [2022-07-20 20:54:57,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 20:54:57,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582416280] [2022-07-20 20:54:57,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582416280] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 20:54:57,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109395294] [2022-07-20 20:54:57,119 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-20 20:54:57,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 20:54:57,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 20:54:57,121 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) [2022-07-20 20:54:57,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-20 20:54:57,262 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-07-20 20:54:57,263 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 20:54:57,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-20 20:54:57,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 20:54:57,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1504 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 1445 trivial. 0 not checked. [2022-07-20 20:54:57,787 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 20:54:58,197 INFO L356 Elim1Store]: treesize reduction 7, result has 41.7 percent of original size [2022-07-20 20:54:58,198 INFO L390 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 28 treesize of output 21 [2022-07-20 20:54:58,206 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-20 20:54:58,206 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2022-07-20 20:54:58,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1504 backedges. 29 proven. 30 refuted. 0 times theorem prover too weak. 1445 trivial. 0 not checked. [2022-07-20 20:54:58,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109395294] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 20:54:58,223 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 20:54:58,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8, 7] total 26 [2022-07-20 20:54:58,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254381777] [2022-07-20 20:54:58,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 20:54:58,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-20 20:54:58,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 20:54:58,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-20 20:54:58,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=495, Unknown=0, NotChecked=0, Total=650 [2022-07-20 20:54:58,229 INFO L87 Difference]: Start difference. First operand 129 states and 132 transitions. Second operand has 26 states, 26 states have (on average 2.6153846153846154) internal successors, (68), 26 states have internal predecessors, (68), 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) [2022-07-20 20:54:58,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 20:54:58,585 INFO L93 Difference]: Finished difference Result 241 states and 250 transitions. [2022-07-20 20:54:58,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-20 20:54:58,586 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.6153846153846154) internal successors, (68), 26 states have internal predecessors, (68), 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 126 [2022-07-20 20:54:58,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 20:54:58,586 INFO L225 Difference]: With dead ends: 241 [2022-07-20 20:54:58,586 INFO L226 Difference]: Without dead ends: 141 [2022-07-20 20:54:58,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 241 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=419, Invalid=1387, Unknown=0, NotChecked=0, Total=1806 [2022-07-20 20:54:58,588 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 84 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 20:54:58,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 106 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 20:54:58,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-07-20 20:54:58,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 134. [2022-07-20 20:54:58,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 1.037593984962406) internal successors, (138), 133 states have internal predecessors, (138), 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) [2022-07-20 20:54:58,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 138 transitions. [2022-07-20 20:54:58,607 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 138 transitions. Word has length 126 [2022-07-20 20:54:58,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 20:54:58,607 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 138 transitions. [2022-07-20 20:54:58,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.6153846153846154) internal successors, (68), 26 states have internal predecessors, (68), 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) [2022-07-20 20:54:58,608 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 138 transitions. [2022-07-20 20:54:58,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-07-20 20:54:58,609 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 20:54:58,609 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 30, 14, 14, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 20:54:58,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-20 20:54:58,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 20:54:58,827 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 20:54:58,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 20:54:58,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1690999614, now seen corresponding path program 1 times [2022-07-20 20:54:58,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 20:54:58,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184929017] [2022-07-20 20:54:58,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 20:54:58,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 20:54:58,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 20:54:58,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1533 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1531 trivial. 0 not checked. [2022-07-20 20:54:58,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 20:54:58,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184929017] [2022-07-20 20:54:58,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184929017] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 20:54:58,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 20:54:58,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 20:54:58,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122814006] [2022-07-20 20:54:58,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 20:54:58,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 20:54:58,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 20:54:58,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 20:54:58,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 20:54:58,933 INFO L87 Difference]: Start difference. First operand 134 states and 138 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) [2022-07-20 20:54:58,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 20:54:58,939 INFO L93 Difference]: Finished difference Result 141 states and 146 transitions. [2022-07-20 20:54:58,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 20:54:58,939 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 131 [2022-07-20 20:54:58,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 20:54:58,941 INFO L225 Difference]: With dead ends: 141 [2022-07-20 20:54:58,941 INFO L226 Difference]: Without dead ends: 134 [2022-07-20 20:54:58,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 20:54:58,942 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 6 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 20:54:58,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 20:54:58,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-07-20 20:54:58,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2022-07-20 20:54:58,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 1.0225563909774436) internal successors, (136), 133 states have internal predecessors, (136), 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) [2022-07-20 20:54:58,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 136 transitions. [2022-07-20 20:54:58,951 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 136 transitions. Word has length 131 [2022-07-20 20:54:58,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 20:54:58,952 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 136 transitions. [2022-07-20 20:54:58,952 INFO L496 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) [2022-07-20 20:54:58,952 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 136 transitions. [2022-07-20 20:54:58,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-07-20 20:54:58,953 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 20:54:58,954 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 30, 14, 14, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 20:54:58,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-20 20:54:58,954 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 20:54:58,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 20:54:58,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1468975112, now seen corresponding path program 1 times [2022-07-20 20:54:58,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 20:54:58,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373973542] [2022-07-20 20:54:58,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 20:54:58,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 20:54:59,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 20:54:59,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1534 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 1338 trivial. 0 not checked. [2022-07-20 20:54:59,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 20:54:59,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373973542] [2022-07-20 20:54:59,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373973542] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 20:54:59,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235170926] [2022-07-20 20:54:59,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 20:54:59,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 20:54:59,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 20:54:59,208 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) [2022-07-20 20:54:59,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-20 20:54:59,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 20:54:59,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 764 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-20 20:54:59,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 20:54:59,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1534 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 1338 trivial. 0 not checked. [2022-07-20 20:54:59,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 20:55:00,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1534 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 1338 trivial. 0 not checked. [2022-07-20 20:55:00,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235170926] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 20:55:00,281 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 20:55:00,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 47 [2022-07-20 20:55:00,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444038252] [2022-07-20 20:55:00,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 20:55:00,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-07-20 20:55:00,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 20:55:00,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-07-20 20:55:00,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=976, Invalid=1186, Unknown=0, NotChecked=0, Total=2162 [2022-07-20 20:55:00,284 INFO L87 Difference]: Start difference. First operand 134 states and 136 transitions. Second operand has 47 states, 47 states have (on average 2.2127659574468086) internal successors, (104), 47 states have internal predecessors, (104), 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) [2022-07-20 20:55:00,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 20:55:00,388 INFO L93 Difference]: Finished difference Result 269 states and 288 transitions. [2022-07-20 20:55:00,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-07-20 20:55:00,392 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.2127659574468086) internal successors, (104), 47 states have internal predecessors, (104), 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 133 [2022-07-20 20:55:00,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 20:55:00,393 INFO L225 Difference]: With dead ends: 269 [2022-07-20 20:55:00,393 INFO L226 Difference]: Without dead ends: 166 [2022-07-20 20:55:00,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=976, Invalid=1186, Unknown=0, NotChecked=0, Total=2162 [2022-07-20 20:55:00,395 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 45 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 20:55:00,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 58 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 20:55:00,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-07-20 20:55:00,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2022-07-20 20:55:00,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 1.018181818181818) internal successors, (168), 165 states have internal predecessors, (168), 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) [2022-07-20 20:55:00,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 168 transitions. [2022-07-20 20:55:00,407 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 168 transitions. Word has length 133 [2022-07-20 20:55:00,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 20:55:00,407 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 168 transitions. [2022-07-20 20:55:00,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.2127659574468086) internal successors, (104), 47 states have internal predecessors, (104), 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) [2022-07-20 20:55:00,408 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 168 transitions. [2022-07-20 20:55:00,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-07-20 20:55:00,409 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 20:55:00,409 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 30, 30, 30, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 20:55:00,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-20 20:55:00,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-20 20:55:00,628 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 20:55:00,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 20:55:00,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1733851160, now seen corresponding path program 2 times [2022-07-20 20:55:00,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 20:55:00,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004284804] [2022-07-20 20:55:00,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 20:55:00,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 20:55:00,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 20:55:01,359 INFO L134 CoverageAnalysis]: Checked inductivity of 2238 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 1338 trivial. 0 not checked. [2022-07-20 20:55:01,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 20:55:01,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004284804] [2022-07-20 20:55:01,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004284804] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 20:55:01,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130406301] [2022-07-20 20:55:01,360 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 20:55:01,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 20:55:01,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 20:55:01,362 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) [2022-07-20 20:55:01,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-20 20:55:01,652 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 20:55:01,653 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 20:55:01,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 1164 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-20 20:55:01,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 20:55:02,875 INFO L134 CoverageAnalysis]: Checked inductivity of 2238 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 1338 trivial. 0 not checked. [2022-07-20 20:55:02,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 20:55:04,672 INFO L134 CoverageAnalysis]: Checked inductivity of 2238 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 1338 trivial. 0 not checked. [2022-07-20 20:55:04,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1130406301] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 20:55:04,673 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 20:55:04,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 95 [2022-07-20 20:55:04,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869666812] [2022-07-20 20:55:04,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 20:55:04,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 95 states [2022-07-20 20:55:04,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 20:55:04,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2022-07-20 20:55:04,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4000, Invalid=4930, Unknown=0, NotChecked=0, Total=8930 [2022-07-20 20:55:04,679 INFO L87 Difference]: Start difference. First operand 166 states and 168 transitions. Second operand has 95 states, 95 states have (on average 2.1052631578947367) internal successors, (200), 95 states have internal predecessors, (200), 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) [2022-07-20 20:55:04,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 20:55:04,895 INFO L93 Difference]: Finished difference Result 333 states and 368 transitions. [2022-07-20 20:55:04,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-07-20 20:55:04,895 INFO L78 Accepts]: Start accepts. Automaton has has 95 states, 95 states have (on average 2.1052631578947367) internal successors, (200), 95 states have internal predecessors, (200), 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 165 [2022-07-20 20:55:04,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 20:55:04,897 INFO L225 Difference]: With dead ends: 333 [2022-07-20 20:55:04,897 INFO L226 Difference]: Without dead ends: 230 [2022-07-20 20:55:04,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4000, Invalid=4930, Unknown=0, NotChecked=0, Total=8930 [2022-07-20 20:55:04,902 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 124 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 20:55:04,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 72 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 20:55:04,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-07-20 20:55:04,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2022-07-20 20:55:04,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 1.0131004366812226) internal successors, (232), 229 states have internal predecessors, (232), 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) [2022-07-20 20:55:04,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 232 transitions. [2022-07-20 20:55:04,912 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 232 transitions. Word has length 165 [2022-07-20 20:55:04,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 20:55:04,912 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 232 transitions. [2022-07-20 20:55:04,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 95 states, 95 states have (on average 2.1052631578947367) internal successors, (200), 95 states have internal predecessors, (200), 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) [2022-07-20 20:55:04,912 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 232 transitions. [2022-07-20 20:55:04,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2022-07-20 20:55:04,914 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 20:55:04,914 INFO L195 NwaCegarLoop]: trace histogram [62, 62, 30, 30, 30, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 20:55:04,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-20 20:55:05,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 20:55:05,127 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 20:55:05,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 20:55:05,128 INFO L85 PathProgramCache]: Analyzing trace with hash -286095448, now seen corresponding path program 3 times [2022-07-20 20:55:05,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 20:55:05,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031574902] [2022-07-20 20:55:05,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 20:55:05,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 20:55:05,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 20:55:07,201 INFO L134 CoverageAnalysis]: Checked inductivity of 5182 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 1338 trivial. 0 not checked. [2022-07-20 20:55:07,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 20:55:07,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031574902] [2022-07-20 20:55:07,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031574902] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 20:55:07,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094946452] [2022-07-20 20:55:07,202 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 20:55:07,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 20:55:07,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 20:55:07,203 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) [2022-07-20 20:55:07,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-20 20:55:07,457 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-20 20:55:07,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 20:55:07,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-20 20:55:07,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 20:55:07,962 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-20 20:55:08,729 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 20:55:08,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 24 [2022-07-20 20:55:08,860 INFO L134 CoverageAnalysis]: Checked inductivity of 5182 backedges. 0 proven. 211 refuted. 0 times theorem prover too weak. 4971 trivial. 0 not checked. [2022-07-20 20:55:08,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 20:55:09,670 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2022-07-20 20:55:10,500 INFO L134 CoverageAnalysis]: Checked inductivity of 5182 backedges. 0 proven. 211 refuted. 0 times theorem prover too weak. 4971 trivial. 0 not checked. [2022-07-20 20:55:10,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094946452] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 20:55:10,501 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 20:55:10,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 9, 9] total 77 [2022-07-20 20:55:10,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542173972] [2022-07-20 20:55:10,501 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 20:55:10,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-07-20 20:55:10,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 20:55:10,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-07-20 20:55:10,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2247, Invalid=3605, Unknown=0, NotChecked=0, Total=5852 [2022-07-20 20:55:10,505 INFO L87 Difference]: Start difference. First operand 230 states and 232 transitions. Second operand has 77 states, 77 states have (on average 2.155844155844156) internal successors, (166), 77 states have internal predecessors, (166), 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) [2022-07-20 20:55:17,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 20:55:17,398 INFO L93 Difference]: Finished difference Result 324 states and 328 transitions. [2022-07-20 20:55:17,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2022-07-20 20:55:17,398 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 77 states have (on average 2.155844155844156) internal successors, (166), 77 states have internal predecessors, (166), 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 229 [2022-07-20 20:55:17,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 20:55:17,399 INFO L225 Difference]: With dead ends: 324 [2022-07-20 20:55:17,399 INFO L226 Difference]: Without dead ends: 0 [2022-07-20 20:55:17,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 653 GetRequests, 446 SyntacticMatches, 2 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 11439 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=13241, Invalid=29401, Unknown=0, NotChecked=0, Total=42642 [2022-07-20 20:55:17,410 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 2 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 20:55:17,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 18 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 23 Unchecked, 0.0s Time] [2022-07-20 20:55:17,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-20 20:55:17,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-20 20:55:17,411 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) [2022-07-20 20:55:17,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-20 20:55:17,411 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 229 [2022-07-20 20:55:17,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 20:55:17,412 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-20 20:55:17,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 77 states have (on average 2.155844155844156) internal successors, (166), 77 states have internal predecessors, (166), 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) [2022-07-20 20:55:17,412 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-20 20:55:17,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-20 20:55:17,415 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-20 20:55:17,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-20 20:55:17,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-20 20:55:17,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-20 20:55:18,596 INFO L899 garLoopResultBuilder]: For program point L35-2(lines 35 41) no Hoare annotation was computed. [2022-07-20 20:55:18,597 INFO L895 garLoopResultBuilder]: At program point L35-3(lines 35 41) the Hoare annotation is: (let ((.cse0 (forall ((|ULTIMATE.start_main_~i~1#1| Int)) (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0)) (not (< |ULTIMATE.start_main_~i~1#1| 100000)) (< |ULTIMATE.start_main_~i~1#1| 99999)))) (.cse1 (= |ULTIMATE.start_main_~flag~0#1| 0)) (.cse2 (= |ULTIMATE.start_main_~#a~0#1.offset| 0))) (or (and (= |ULTIMATE.start_main_~i~1#1| 0) .cse0 .cse1 .cse2) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) .cse0 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) .cse1 .cse2 (< |ULTIMATE.start_main_~i~1#1| 100000)) (<= 1 |ULTIMATE.start_main_~flag~0#1|))) [2022-07-20 20:55:18,597 INFO L899 garLoopResultBuilder]: For program point L35-4(lines 35 41) no Hoare annotation was computed. [2022-07-20 20:55:18,597 INFO L899 garLoopResultBuilder]: For program point L23-2(lines 23 26) no Hoare annotation was computed. [2022-07-20 20:55:18,597 INFO L895 garLoopResultBuilder]: At program point L23-3(lines 23 26) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~#a~0#1.offset| |ULTIMATE.start_init_~a#1.offset|)) (.cse1 (= |ULTIMATE.start_init_~size#1| 100000)) (.cse2 (= |ULTIMATE.start_main_~flag~0#1| 0)) (.cse3 (= |ULTIMATE.start_main_~#a~0#1.offset| 0)) (.cse4 (= |ULTIMATE.start_init_~a#1.base| |ULTIMATE.start_main_~#a~0#1.base|))) (or (and .cse0 .cse1 (= |ULTIMATE.start_init_~i~0#1| 0) .cse2 .cse3 .cse4) (and .cse0 .cse1 (exists ((|v_ULTIMATE.start_init_~i~0#1_110| Int)) (and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |v_ULTIMATE.start_init_~i~0#1_110| 4))) 0)) (< |v_ULTIMATE.start_init_~i~0#1_110| |ULTIMATE.start_init_~size#1|) (<= |ULTIMATE.start_init_~i~0#1| (+ |v_ULTIMATE.start_init_~i~0#1_110| 1)))) .cse2 .cse3 .cse4))) [2022-07-20 20:55:18,597 INFO L899 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-07-20 20:55:18,597 INFO L899 garLoopResultBuilder]: For program point L15-1(line 15) no Hoare annotation was computed. [2022-07-20 20:55:18,597 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 45) no Hoare annotation was computed. [2022-07-20 20:55:18,597 INFO L899 garLoopResultBuilder]: For program point L15-3(line 15) no Hoare annotation was computed. [2022-07-20 20:55:18,597 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-20 20:55:18,597 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-20 20:55:18,597 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-20 20:55:18,598 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 15) no Hoare annotation was computed. [2022-07-20 20:55:18,598 INFO L899 garLoopResultBuilder]: For program point L20(lines 20 27) no Hoare annotation was computed. [2022-07-20 20:55:18,598 INFO L899 garLoopResultBuilder]: For program point L37(lines 37 40) no Hoare annotation was computed. [2022-07-20 20:55:18,598 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-20 20:55:18,598 INFO L899 garLoopResultBuilder]: For program point L42-2(lines 42 46) no Hoare annotation was computed. [2022-07-20 20:55:18,599 INFO L895 garLoopResultBuilder]: At program point L42-3(lines 42 46) the Hoare annotation is: (<= 1 |ULTIMATE.start_main_~flag~0#1|) [2022-07-20 20:55:18,599 INFO L899 garLoopResultBuilder]: For program point L42-4(lines 42 46) no Hoare annotation was computed. [2022-07-20 20:55:18,599 INFO L902 garLoopResultBuilder]: At program point L47(lines 28 48) the Hoare annotation is: true [2022-07-20 20:55:18,601 INFO L356 BasicCegarLoop]: Path program histogram: [6, 3, 1, 1, 1, 1] [2022-07-20 20:55:18,603 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-20 20:55:18,613 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-20 20:55:18,614 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_110,QUANTIFIED] [2022-07-20 20:55:18,614 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_110,QUANTIFIED] [2022-07-20 20:55:18,614 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_110,QUANTIFIED] [2022-07-20 20:55:18,616 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-20 20:55:18,617 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_110,QUANTIFIED] [2022-07-20 20:55:18,617 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_110,QUANTIFIED] [2022-07-20 20:55:18,617 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_110,QUANTIFIED] [2022-07-20 20:55:18,619 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-20 20:55:18,619 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~1#1,QUANTIFIED] [2022-07-20 20:55:18,619 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~1#1,QUANTIFIED] [2022-07-20 20:55:18,619 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~1#1,QUANTIFIED] [2022-07-20 20:55:18,619 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-20 20:55:18,620 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-20 20:55:18,620 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~1#1,QUANTIFIED] [2022-07-20 20:55:18,620 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~1#1,QUANTIFIED] [2022-07-20 20:55:18,620 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~1#1,QUANTIFIED] [2022-07-20 20:55:18,620 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-20 20:55:18,621 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-20 20:55:18,621 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~1#1,QUANTIFIED] [2022-07-20 20:55:18,621 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~1#1,QUANTIFIED] [2022-07-20 20:55:18,622 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~1#1,QUANTIFIED] [2022-07-20 20:55:18,622 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-20 20:55:18,622 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-20 20:55:18,622 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~1#1,QUANTIFIED] [2022-07-20 20:55:18,622 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~1#1,QUANTIFIED] [2022-07-20 20:55:18,622 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~1#1,QUANTIFIED] [2022-07-20 20:55:18,623 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-20 20:55:18,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 08:55:18 BoogieIcfgContainer [2022-07-20 20:55:18,624 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-20 20:55:18,624 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-20 20:55:18,624 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-20 20:55:18,625 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-20 20:55:18,625 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 08:54:50" (3/4) ... [2022-07-20 20:55:18,628 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-20 20:55:18,638 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2022-07-20 20:55:18,638 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-20 20:55:18,638 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-20 20:55:18,638 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-20 20:55:18,659 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((a == a && size == 100000) && i == 0) && flag == 0) && a == 0) && a == a) || (((((a == a && size == 100000) && (\exists v_ULTIMATE.start_init_~i~0#1_110 : int :: (!(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0#1_110 * 4] == 0) && v_ULTIMATE.start_init_~i~0#1_110 < size) && i <= v_ULTIMATE.start_init_~i~0#1_110 + 1)) && flag == 0) && a == 0) && a == a) [2022-07-20 20:55:18,666 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-20 20:55:18,666 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-20 20:55:18,666 INFO L158 Benchmark]: Toolchain (without parser) took 29232.51ms. Allocated memory was 113.2MB in the beginning and 268.4MB in the end (delta: 155.2MB). Free memory was 80.2MB in the beginning and 188.7MB in the end (delta: -108.4MB). Peak memory consumption was 46.5MB. Max. memory is 16.1GB. [2022-07-20 20:55:18,666 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 77.6MB. Free memory was 49.8MB in the beginning and 49.7MB in the end (delta: 31.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 20:55:18,667 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.22ms. Allocated memory is still 113.2MB. Free memory was 80.0MB in the beginning and 89.7MB in the end (delta: -9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-20 20:55:18,667 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.18ms. Allocated memory is still 113.2MB. Free memory was 89.7MB in the beginning and 88.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 20:55:18,667 INFO L158 Benchmark]: Boogie Preprocessor took 20.55ms. Allocated memory is still 113.2MB. Free memory was 88.5MB in the beginning and 87.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-20 20:55:18,667 INFO L158 Benchmark]: RCFGBuilder took 367.11ms. Allocated memory is still 113.2MB. Free memory was 87.0MB in the beginning and 76.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-20 20:55:18,668 INFO L158 Benchmark]: TraceAbstraction took 28546.90ms. Allocated memory was 113.2MB in the beginning and 268.4MB in the end (delta: 155.2MB). Free memory was 75.9MB in the beginning and 190.8MB in the end (delta: -114.8MB). Peak memory consumption was 162.7MB. Max. memory is 16.1GB. [2022-07-20 20:55:18,668 INFO L158 Benchmark]: Witness Printer took 41.63ms. Allocated memory is still 268.4MB. Free memory was 190.8MB in the beginning and 188.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-20 20:55:18,669 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.22ms. Allocated memory is still 77.6MB. Free memory was 49.8MB in the beginning and 49.7MB in the end (delta: 31.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 221.22ms. Allocated memory is still 113.2MB. Free memory was 80.0MB in the beginning and 89.7MB in the end (delta: -9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.18ms. Allocated memory is still 113.2MB. Free memory was 89.7MB in the beginning and 88.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 20.55ms. Allocated memory is still 113.2MB. Free memory was 88.5MB in the beginning and 87.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 367.11ms. Allocated memory is still 113.2MB. Free memory was 87.0MB in the beginning and 76.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 28546.90ms. Allocated memory was 113.2MB in the beginning and 268.4MB in the end (delta: 155.2MB). Free memory was 75.9MB in the beginning and 190.8MB in the end (delta: -114.8MB). Peak memory consumption was 162.7MB. Max. memory is 16.1GB. * Witness Printer took 41.63ms. Allocated memory is still 268.4MB. Free memory was 190.8MB in the beginning and 188.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_110,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_110,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_110,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#1_110,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_110,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_110,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[ULTIMATE.start_main_~i~1#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~1#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~1#1,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[ULTIMATE.start_main_~i~1#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~1#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~1#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~1#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~1#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~1#1,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[ULTIMATE.start_main_~i~1#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~1#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~1#1,QUANTIFIED] - 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.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s 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: 28.4s, OverallIterations: 13, TraceHistogramMax: 62, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 8.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1202 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1202 mSDsluCounter, 947 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 23 IncrementalHoareTripleChecker+Unchecked, 758 mSDsCounter, 253 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 966 IncrementalHoareTripleChecker+Invalid, 1242 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 253 mSolverCounterUnsat, 189 mSDtfsCounter, 966 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2050 GetRequests, 1550 SyntacticMatches, 3 SemanticMatches, 497 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 12874 ImplicationChecksByTransitivity, 14.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=230occurred in iteration=12, InterpolantAutomatonStates: 376, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 368 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 100 NumberOfFragments, 142 HoareAnnotationTreeSize, 4 FomulaSimplifications, 275 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 4 FomulaSimplificationsInter, 4059 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 13.2s InterpolantComputationTime, 1891 NumberOfCodeBlocks, 1571 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 2713 ConstructedInterpolants, 181 QuantifiedInterpolants, 17724 SizeOfPredicates, 37 NumberOfNonLiveVariables, 3721 ConjunctsInSsa, 143 ConjunctsInUnsatCore, 32 InterpolantComputations, 4 PerfectInterpolantSequences, 26190/35105 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 [2022-07-20 20:55:18,680 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-20 20:55:18,680 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_110,QUANTIFIED] [2022-07-20 20:55:18,681 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_110,QUANTIFIED] [2022-07-20 20:55:18,681 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_110,QUANTIFIED] [2022-07-20 20:55:18,681 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-20 20:55:18,682 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_110,QUANTIFIED] [2022-07-20 20:55:18,682 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_110,QUANTIFIED] [2022-07-20 20:55:18,682 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_init_~i~0#1_110,QUANTIFIED] Derived loop invariant: (((((a == a && size == 100000) && i == 0) && flag == 0) && a == 0) && a == a) || (((((a == a && size == 100000) && (\exists v_ULTIMATE.start_init_~i~0#1_110 : int :: (!(#memory_$Pointer$[a][a + v_ULTIMATE.start_init_~i~0#1_110 * 4] == 0) && v_ULTIMATE.start_init_~i~0#1_110 < size) && i <= v_ULTIMATE.start_init_~i~0#1_110 + 1)) && flag == 0) && a == 0) && a == a) - InvariantResult [Line: 42]: Loop Invariant Derived loop invariant: 1 <= flag - InvariantResult [Line: 35]: Loop Invariant [2022-07-20 20:55:18,683 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-20 20:55:18,683 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~1#1,QUANTIFIED] [2022-07-20 20:55:18,683 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~1#1,QUANTIFIED] [2022-07-20 20:55:18,683 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~1#1,QUANTIFIED] [2022-07-20 20:55:18,684 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-20 20:55:18,684 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-20 20:55:18,684 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~1#1,QUANTIFIED] [2022-07-20 20:55:18,684 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~1#1,QUANTIFIED] [2022-07-20 20:55:18,684 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~1#1,QUANTIFIED] [2022-07-20 20:55:18,684 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-20 20:55:18,685 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-20 20:55:18,685 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~1#1,QUANTIFIED] [2022-07-20 20:55:18,685 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~1#1,QUANTIFIED] [2022-07-20 20:55:18,686 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~1#1,QUANTIFIED] [2022-07-20 20:55:18,686 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-20 20:55:18,686 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-20 20:55:18,686 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~1#1,QUANTIFIED] [2022-07-20 20:55:18,686 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~1#1,QUANTIFIED] [2022-07-20 20:55:18,686 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~1#1,QUANTIFIED] [2022-07-20 20:55:18,687 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((i == 0 && (forall ULTIMATE.start_main_~i~1#1 : int :: (!(#memory_$Pointer$[a][a + ULTIMATE.start_main_~i~1#1 * 4] == 0) || !(ULTIMATE.start_main_~i~1#1 < 100000)) || ULTIMATE.start_main_~i~1#1 < 99999)) && flag == 0) && a == 0) || (((((#memory_$Pointer$[a][a] == 0 && (forall ULTIMATE.start_main_~i~1#1 : int :: (!(#memory_$Pointer$[a][a + ULTIMATE.start_main_~i~1#1 * 4] == 0) || !(ULTIMATE.start_main_~i~1#1 < 100000)) || ULTIMATE.start_main_~i~1#1 < 99999)) && #memory_$Pointer$[a][a] == 0) && flag == 0) && a == 0) && i < 100000)) || 1 <= flag RESULT: Ultimate proved your program to be correct! [2022-07-20 20:55:18,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE