./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/sll-optional-1.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/forester-heap/sll-optional-1.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 8b0f1d623fff7bbdf74e6250d2f53fb98e44ca7ba1aae1265f5b0871b427fba0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 02:07:12,061 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 02:07:12,063 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 02:07:12,112 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 02:07:12,113 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 02:07:12,114 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 02:07:12,118 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 02:07:12,121 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 02:07:12,123 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 02:07:12,129 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 02:07:12,130 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 02:07:12,135 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 02:07:12,136 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 02:07:12,138 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 02:07:12,139 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 02:07:12,143 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 02:07:12,143 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 02:07:12,145 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 02:07:12,146 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 02:07:12,151 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 02:07:12,152 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 02:07:12,153 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 02:07:12,154 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 02:07:12,155 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 02:07:12,157 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 02:07:12,161 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 02:07:12,164 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 02:07:12,165 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 02:07:12,166 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 02:07:12,166 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 02:07:12,167 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 02:07:12,167 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 02:07:12,168 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 02:07:12,169 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 02:07:12,170 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 02:07:12,171 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 02:07:12,171 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 02:07:12,172 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 02:07:12,172 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 02:07:12,172 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 02:07:12,173 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 02:07:12,174 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 02:07:12,175 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-21 02:07:12,206 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 02:07:12,207 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 02:07:12,207 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 02:07:12,208 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 02:07:12,208 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 02:07:12,208 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 02:07:12,209 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 02:07:12,209 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 02:07:12,209 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 02:07:12,210 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 02:07:12,210 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 02:07:12,211 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 02:07:12,211 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 02:07:12,211 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 02:07:12,211 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 02:07:12,211 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 02:07:12,211 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 02:07:12,212 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 02:07:12,212 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 02:07:12,212 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 02:07:12,212 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 02:07:12,212 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 02:07:12,213 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 02:07:12,213 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 02:07:12,213 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 02:07:12,213 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 02:07:12,213 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 02:07:12,214 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 02:07:12,214 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 02:07:12,214 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 02:07:12,214 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 02:07:12,214 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 02:07:12,215 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 02:07:12,215 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 -> 8b0f1d623fff7bbdf74e6250d2f53fb98e44ca7ba1aae1265f5b0871b427fba0 [2022-07-21 02:07:12,519 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 02:07:12,539 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 02:07:12,542 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 02:07:12,543 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 02:07:12,544 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 02:07:12,546 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-optional-1.i [2022-07-21 02:07:12,606 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/218c0639e/4be508a6d1054e37bd7feef44b47263e/FLAGcc96d2087 [2022-07-21 02:07:13,095 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 02:07:13,096 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-optional-1.i [2022-07-21 02:07:13,107 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/218c0639e/4be508a6d1054e37bd7feef44b47263e/FLAGcc96d2087 [2022-07-21 02:07:13,602 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/218c0639e/4be508a6d1054e37bd7feef44b47263e [2022-07-21 02:07:13,604 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 02:07:13,605 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 02:07:13,606 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 02:07:13,607 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 02:07:13,613 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 02:07:13,613 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 02:07:13" (1/1) ... [2022-07-21 02:07:13,614 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a176a7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:07:13, skipping insertion in model container [2022-07-21 02:07:13,614 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 02:07:13" (1/1) ... [2022-07-21 02:07:13,628 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 02:07:13,664 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 02:07:13,969 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/forester-heap/sll-optional-1.i[22688,22701] [2022-07-21 02:07:13,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 02:07:13,986 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 02:07:14,037 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/forester-heap/sll-optional-1.i[22688,22701] [2022-07-21 02:07:14,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 02:07:14,069 INFO L208 MainTranslator]: Completed translation [2022-07-21 02:07:14,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:07:14 WrapperNode [2022-07-21 02:07:14,070 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 02:07:14,071 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 02:07:14,071 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 02:07:14,071 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 02:07:14,076 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:07:14" (1/1) ... [2022-07-21 02:07:14,104 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:07:14" (1/1) ... [2022-07-21 02:07:14,134 INFO L137 Inliner]: procedures = 119, calls = 41, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 130 [2022-07-21 02:07:14,134 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 02:07:14,135 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 02:07:14,135 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 02:07:14,135 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 02:07:14,142 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:07:14" (1/1) ... [2022-07-21 02:07:14,143 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:07:14" (1/1) ... [2022-07-21 02:07:14,157 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:07:14" (1/1) ... [2022-07-21 02:07:14,158 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:07:14" (1/1) ... [2022-07-21 02:07:14,168 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:07:14" (1/1) ... [2022-07-21 02:07:14,177 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:07:14" (1/1) ... [2022-07-21 02:07:14,182 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:07:14" (1/1) ... [2022-07-21 02:07:14,184 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 02:07:14,185 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 02:07:14,185 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 02:07:14,186 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 02:07:14,186 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:07:14" (1/1) ... [2022-07-21 02:07:14,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 02:07:14,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:07:14,216 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-21 02:07:14,243 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-21 02:07:14,258 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 02:07:14,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 02:07:14,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 02:07:14,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 02:07:14,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 02:07:14,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 02:07:14,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 02:07:14,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 02:07:14,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 02:07:14,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 02:07:14,373 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 02:07:14,375 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 02:07:14,616 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 02:07:14,622 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 02:07:14,622 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-21 02:07:14,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 02:07:14 BoogieIcfgContainer [2022-07-21 02:07:14,624 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 02:07:14,625 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 02:07:14,625 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 02:07:14,628 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 02:07:14,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 02:07:13" (1/3) ... [2022-07-21 02:07:14,629 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@544218ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 02:07:14, skipping insertion in model container [2022-07-21 02:07:14,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:07:14" (2/3) ... [2022-07-21 02:07:14,629 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@544218ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 02:07:14, skipping insertion in model container [2022-07-21 02:07:14,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 02:07:14" (3/3) ... [2022-07-21 02:07:14,631 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-optional-1.i [2022-07-21 02:07:14,641 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 02:07:14,641 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 02:07:14,680 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 02:07:14,686 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@4260d9ef, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@77b37616 [2022-07-21 02:07:14,686 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 02:07:14,690 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 29 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:07:14,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-21 02:07:14,696 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:07:14,696 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:07:14,697 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:07:14,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:07:14,701 INFO L85 PathProgramCache]: Analyzing trace with hash 573386926, now seen corresponding path program 1 times [2022-07-21 02:07:14,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:07:14,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565491169] [2022-07-21 02:07:14,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:07:14,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:07:14,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:07:14,905 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-21 02:07:14,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:07:14,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565491169] [2022-07-21 02:07:14,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565491169] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:07:14,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:07:14,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 02:07:14,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650369964] [2022-07-21 02:07:14,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:07:14,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-21 02:07:14,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:07:14,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-21 02:07:14,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 02:07:14,945 INFO L87 Difference]: Start difference. First operand has 30 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 29 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 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-21 02:07:14,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:07:14,962 INFO L93 Difference]: Finished difference Result 51 states and 77 transitions. [2022-07-21 02:07:14,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-21 02:07:14,964 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 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-21 02:07:14,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:07:14,969 INFO L225 Difference]: With dead ends: 51 [2022-07-21 02:07:14,969 INFO L226 Difference]: Without dead ends: 22 [2022-07-21 02:07:14,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 02:07:14,976 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 02:07:14,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 02:07:14,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-07-21 02:07:14,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-07-21 02:07:14,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 21 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-21 02:07:15,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2022-07-21 02:07:15,001 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 15 [2022-07-21 02:07:15,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:07:15,001 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. [2022-07-21 02:07:15,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 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-21 02:07:15,002 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2022-07-21 02:07:15,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-21 02:07:15,004 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:07:15,004 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:07:15,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 02:07:15,005 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:07:15,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:07:15,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1170055612, now seen corresponding path program 1 times [2022-07-21 02:07:15,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:07:15,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294940138] [2022-07-21 02:07:15,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:07:15,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:07:15,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:07:15,113 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-21 02:07:15,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:07:15,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294940138] [2022-07-21 02:07:15,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294940138] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:07:15,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:07:15,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 02:07:15,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947870145] [2022-07-21 02:07:15,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:07:15,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 02:07:15,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:07:15,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 02:07:15,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 02:07:15,118 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-21 02:07:15,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:07:15,153 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2022-07-21 02:07:15,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 02:07:15,154 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 16 [2022-07-21 02:07:15,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:07:15,155 INFO L225 Difference]: With dead ends: 37 [2022-07-21 02:07:15,155 INFO L226 Difference]: Without dead ends: 25 [2022-07-21 02:07:15,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 02:07:15,160 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 02:07:15,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 75 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 02:07:15,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-21 02:07:15,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-07-21 02:07:15,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.391304347826087) internal successors, (32), 23 states have internal predecessors, (32), 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-21 02:07:15,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2022-07-21 02:07:15,170 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 16 [2022-07-21 02:07:15,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:07:15,171 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 32 transitions. [2022-07-21 02:07:15,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-21 02:07:15,171 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2022-07-21 02:07:15,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-21 02:07:15,172 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:07:15,172 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:07:15,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 02:07:15,172 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:07:15,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:07:15,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1170053690, now seen corresponding path program 1 times [2022-07-21 02:07:15,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:07:15,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802728013] [2022-07-21 02:07:15,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:07:15,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:07:15,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:07:15,329 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-21 02:07:15,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:07:15,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802728013] [2022-07-21 02:07:15,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802728013] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:07:15,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:07:15,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 02:07:15,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903406008] [2022-07-21 02:07:15,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:07:15,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 02:07:15,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:07:15,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 02:07:15,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-21 02:07:15,335 INFO L87 Difference]: Start difference. First operand 24 states and 32 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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-21 02:07:15,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:07:15,496 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2022-07-21 02:07:15,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 02:07:15,497 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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 16 [2022-07-21 02:07:15,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:07:15,498 INFO L225 Difference]: With dead ends: 41 [2022-07-21 02:07:15,499 INFO L226 Difference]: Without dead ends: 39 [2022-07-21 02:07:15,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-07-21 02:07:15,505 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 12 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 02:07:15,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 81 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 02:07:15,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-07-21 02:07:15,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 29. [2022-07-21 02:07:15,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:07:15,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2022-07-21 02:07:15,515 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 16 [2022-07-21 02:07:15,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:07:15,515 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2022-07-21 02:07:15,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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-21 02:07:15,516 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2022-07-21 02:07:15,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-21 02:07:15,517 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:07:15,517 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:07:15,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 02:07:15,517 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:07:15,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:07:15,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1171900732, now seen corresponding path program 1 times [2022-07-21 02:07:15,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:07:15,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179982276] [2022-07-21 02:07:15,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:07:15,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:07:15,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:07:15,773 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-21 02:07:15,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:07:15,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179982276] [2022-07-21 02:07:15,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179982276] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:07:15,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:07:15,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 02:07:15,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245946879] [2022-07-21 02:07:15,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:07:15,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 02:07:15,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:07:15,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 02:07:15,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-21 02:07:15,776 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 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-21 02:07:16,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:07:16,046 INFO L93 Difference]: Finished difference Result 93 states and 115 transitions. [2022-07-21 02:07:16,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 02:07:16,049 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 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 16 [2022-07-21 02:07:16,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:07:16,050 INFO L225 Difference]: With dead ends: 93 [2022-07-21 02:07:16,050 INFO L226 Difference]: Without dead ends: 74 [2022-07-21 02:07:16,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2022-07-21 02:07:16,051 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 102 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 02:07:16,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 79 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 02:07:16,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-07-21 02:07:16,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 42. [2022-07-21 02:07:16,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 states have internal predecessors, (55), 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-21 02:07:16,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2022-07-21 02:07:16,062 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 55 transitions. Word has length 16 [2022-07-21 02:07:16,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:07:16,063 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 55 transitions. [2022-07-21 02:07:16,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 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-21 02:07:16,063 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2022-07-21 02:07:16,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-21 02:07:16,064 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:07:16,064 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:07:16,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 02:07:16,064 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:07:16,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:07:16,067 INFO L85 PathProgramCache]: Analyzing trace with hash 604953672, now seen corresponding path program 1 times [2022-07-21 02:07:16,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:07:16,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375166186] [2022-07-21 02:07:16,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:07:16,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:07:16,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:07:16,158 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-21 02:07:16,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:07:16,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375166186] [2022-07-21 02:07:16,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375166186] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:07:16,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:07:16,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 02:07:16,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212339291] [2022-07-21 02:07:16,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:07:16,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 02:07:16,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:07:16,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 02:07:16,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 02:07:16,163 INFO L87 Difference]: Start difference. First operand 42 states and 55 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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-21 02:07:16,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:07:16,283 INFO L93 Difference]: Finished difference Result 87 states and 108 transitions. [2022-07-21 02:07:16,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 02:07:16,284 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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 16 [2022-07-21 02:07:16,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:07:16,285 INFO L225 Difference]: With dead ends: 87 [2022-07-21 02:07:16,285 INFO L226 Difference]: Without dead ends: 64 [2022-07-21 02:07:16,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-21 02:07:16,286 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 74 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 02:07:16,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 73 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 02:07:16,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-07-21 02:07:16,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 40. [2022-07-21 02:07:16,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 39 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 02:07:16,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2022-07-21 02:07:16,300 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 51 transitions. Word has length 16 [2022-07-21 02:07:16,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:07:16,300 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 51 transitions. [2022-07-21 02:07:16,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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-21 02:07:16,301 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2022-07-21 02:07:16,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-21 02:07:16,301 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:07:16,301 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:07:16,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 02:07:16,302 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:07:16,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:07:16,302 INFO L85 PathProgramCache]: Analyzing trace with hash 466614784, now seen corresponding path program 1 times [2022-07-21 02:07:16,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:07:16,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250136149] [2022-07-21 02:07:16,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:07:16,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:07:16,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:07:16,369 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-21 02:07:16,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:07:16,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250136149] [2022-07-21 02:07:16,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250136149] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:07:16,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:07:16,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 02:07:16,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579094065] [2022-07-21 02:07:16,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:07:16,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 02:07:16,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:07:16,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 02:07:16,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 02:07:16,372 INFO L87 Difference]: Start difference. First operand 40 states and 51 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-21 02:07:16,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:07:16,496 INFO L93 Difference]: Finished difference Result 86 states and 107 transitions. [2022-07-21 02:07:16,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 02:07:16,497 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 17 [2022-07-21 02:07:16,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:07:16,498 INFO L225 Difference]: With dead ends: 86 [2022-07-21 02:07:16,498 INFO L226 Difference]: Without dead ends: 84 [2022-07-21 02:07:16,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-21 02:07:16,499 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 35 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 02:07:16,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 110 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 02:07:16,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-07-21 02:07:16,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 50. [2022-07-21 02:07:16,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 49 states have internal predecessors, (65), 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-21 02:07:16,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 65 transitions. [2022-07-21 02:07:16,508 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 65 transitions. Word has length 17 [2022-07-21 02:07:16,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:07:16,508 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 65 transitions. [2022-07-21 02:07:16,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-21 02:07:16,509 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 65 transitions. [2022-07-21 02:07:16,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-21 02:07:16,509 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:07:16,509 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:07:16,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 02:07:16,510 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:07:16,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:07:16,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1690516158, now seen corresponding path program 1 times [2022-07-21 02:07:16,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:07:16,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557417586] [2022-07-21 02:07:16,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:07:16,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:07:16,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:07:16,802 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:07:16,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:07:16,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557417586] [2022-07-21 02:07:16,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557417586] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:07:16,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282963111] [2022-07-21 02:07:16,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:07:16,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:07:16,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:07:16,808 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-21 02:07:16,838 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-21 02:07:16,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:07:16,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 82 conjunts are in the unsatisfiable core [2022-07-21 02:07:16,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:07:17,016 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 02:07:17,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:07:17,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:07:17,071 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2022-07-21 02:07:17,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:07:17,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:07:17,091 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2022-07-21 02:07:17,101 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-07-21 02:07:17,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:07:17,110 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 42 [2022-07-21 02:07:17,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:07:17,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2022-07-21 02:07:17,123 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2022-07-21 02:07:17,140 INFO L356 Elim1Store]: treesize reduction 30, result has 34.8 percent of original size [2022-07-21 02:07:17,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 33 [2022-07-21 02:07:17,146 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-07-21 02:07:17,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:07:17,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-07-21 02:07:17,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:07:17,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:07:17,280 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-21 02:07:17,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 52 [2022-07-21 02:07:17,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:07:17,299 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-21 02:07:17,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 61 [2022-07-21 02:07:17,341 INFO L356 Elim1Store]: treesize reduction 54, result has 36.5 percent of original size [2022-07-21 02:07:17,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 45 [2022-07-21 02:07:17,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 39 [2022-07-21 02:07:17,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:07:17,488 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-07-21 02:07:17,489 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 108 treesize of output 103 [2022-07-21 02:07:17,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:07:17,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:07:17,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:07:17,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 51 [2022-07-21 02:07:17,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-21 02:07:17,536 INFO L356 Elim1Store]: treesize reduction 12, result has 65.7 percent of original size [2022-07-21 02:07:17,537 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 35 [2022-07-21 02:07:17,985 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:07:17,986 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:07:18,187 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:07:18,188 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 115 [2022-07-21 02:07:19,566 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_348 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc10#1.base_7| Int) (v_ArrVal_342 (Array Int Int)) (v_ArrVal_344 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_5) |v_ULTIMATE.start_main_#t~malloc10#1.base_7| v_ArrVal_342)) (.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_344) |v_ULTIMATE.start_main_#t~malloc10#1.base_7| v_ArrVal_348)) (.cse4 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4)) (.cse2 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) (or (not (= (select v_arrayElimArr_5 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_7|) 0)) (and (= (select (select .cse0 .cse1) .cse2) 0) (= (select (select .cse3 .cse1) .cse2) 0)) (and (= |c_ULTIMATE.start_main_~head~0#1.base| .cse1) (= .cse2 |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2022-07-21 02:07:22,727 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_348 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc10#1.base_7| Int) (v_ArrVal_342 (Array Int Int)) (v_ArrVal_339 Int) (v_ArrVal_344 (Array Int Int))) (let ((.cse3 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| 0)) v_ArrVal_339 v_arrayElimArr_5) |v_ULTIMATE.start_main_#t~malloc10#1.base_7| v_ArrVal_342)) (.cse0 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_339)) v_ArrVal_339 v_ArrVal_344) |v_ULTIMATE.start_main_#t~malloc10#1.base_7| v_ArrVal_348)) (.cse4 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) (or (not (= (select (store |c_#valid| v_ArrVal_339 1) |v_ULTIMATE.start_main_#t~malloc10#1.base_7|) 0)) (not (= (select |c_#valid| v_ArrVal_339) 0)) (and (= 0 (select (select .cse0 .cse1) .cse2)) (= (select (select .cse3 .cse1) .cse2) 0)) (not (= (select v_arrayElimArr_5 4) 0)) (and (= .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) (= .cse2 |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2022-07-21 02:07:28,369 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_348 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc10#1.base_7| Int) (v_ArrVal_342 (Array Int Int)) (v_ArrVal_339 Int) (v_ArrVal_344 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_24| Int)) (let ((.cse3 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_24| 0)) v_ArrVal_339 v_arrayElimArr_5) |v_ULTIMATE.start_main_#t~malloc10#1.base_7| v_ArrVal_342)) (.cse2 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_24| v_ArrVal_339)) v_ArrVal_339 v_ArrVal_344) |v_ULTIMATE.start_main_#t~malloc10#1.base_7| v_ArrVal_348)) (.cse4 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4)) (.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) (or (not (= (select (store |c_#valid| v_ArrVal_339 1) |v_ULTIMATE.start_main_#t~malloc10#1.base_7|) 0)) (and (= .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) (= .cse1 |c_ULTIMATE.start_main_~head~0#1.offset|)) (and (= (select (select .cse2 .cse0) .cse1) 0) (= (select (select .cse3 .cse0) .cse1) 0)) (not (= (select |c_#valid| v_ArrVal_339) 0)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_24| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select v_arrayElimArr_5 4) 0)))))) is different from false [2022-07-21 02:07:28,463 INFO L356 Elim1Store]: treesize reduction 15, result has 67.4 percent of original size [2022-07-21 02:07:28,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 912 treesize of output 766 [2022-07-21 02:07:28,871 INFO L356 Elim1Store]: treesize reduction 72, result has 78.6 percent of original size [2022-07-21 02:07:28,873 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 256536 treesize of output 252335 [2022-07-21 02:07:29,739 INFO L356 Elim1Store]: treesize reduction 15, result has 67.4 percent of original size [2022-07-21 02:07:29,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 422453 treesize of output 306807 [2022-07-21 02:07:30,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:07:30,387 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:07:30,388 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:07:31,159 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:07:31,168 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 4268797 treesize of output 4194873 [2022-07-21 02:07:40,062 WARN L233 SmtUtils]: Spent 8.88s on a formula simplification that was a NOOP. DAG size: 9652 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-21 02:07:48,793 WARN L233 SmtUtils]: Spent 8.70s on a formula simplification that was a NOOP. DAG size: 9649 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-21 02:07:50,235 INFO L356 Elim1Store]: treesize reduction 22, result has 92.9 percent of original size [2022-07-21 02:07:50,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 4272045 treesize of output 3703017 [2022-07-21 02:07:59,605 WARN L233 SmtUtils]: Spent 9.35s on a formula simplification that was a NOOP. DAG size: 9707 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-21 02:08:08,633 WARN L233 SmtUtils]: Spent 9.00s on a formula simplification that was a NOOP. DAG size: 9704 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-21 02:08:08,839 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:08:08,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:08:09,480 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:08:09,489 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 3928142 treesize of output 3889274 [2022-07-21 02:09:07,995 WARN L233 SmtUtils]: Spent 58.49s on a formula simplification. DAG size of input: 9830 DAG size of output: 9827 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-21 02:09:09,310 INFO L356 Elim1Store]: treesize reduction 22, result has 92.9 percent of original size [2022-07-21 02:09:09,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 3855414 treesize of output 3454022 [2022-07-21 02:09:19,722 WARN L233 SmtUtils]: Spent 10.39s on a formula simplification that was a NOOP. DAG size: 9868 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-21 02:09:20,156 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:09:21,036 INFO L356 Elim1Store]: treesize reduction 24, result has 93.2 percent of original size [2022-07-21 02:09:21,045 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 20 case distinctions, treesize of input 3453846 treesize of output 3244564 [2022-07-21 02:09:31,782 WARN L233 SmtUtils]: Spent 10.73s on a formula simplification that was a NOOP. DAG size: 9937 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-21 02:09:42,480 WARN L233 SmtUtils]: Spent 10.67s on a formula simplification that was a NOOP. DAG size: 9920 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-21 02:09:42,699 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:09:42,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:09:43,416 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:09:43,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 3355730 treesize of output 3310372