./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3dbbec33 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/heap-manipulation/bubble_sort_linux-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 a38de44f112a10364737c35b840e673503a211a020b9f494a50e4a32c8fe31c0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3dbbec3 [2023-02-14 10:53:24,195 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-14 10:53:24,196 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-14 10:53:24,230 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-14 10:53:24,230 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-14 10:53:24,232 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-14 10:53:24,234 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-14 10:53:24,236 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-14 10:53:24,237 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-14 10:53:24,240 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-14 10:53:24,241 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-14 10:53:24,243 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-14 10:53:24,243 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-14 10:53:24,244 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-14 10:53:24,246 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-14 10:53:24,247 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-14 10:53:24,247 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-14 10:53:24,249 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-14 10:53:24,250 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-14 10:53:24,253 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-14 10:53:24,254 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-14 10:53:24,255 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-14 10:53:24,255 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-14 10:53:24,256 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-14 10:53:24,262 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-14 10:53:24,262 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-14 10:53:24,262 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-14 10:53:24,264 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-14 10:53:24,264 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-14 10:53:24,264 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-14 10:53:24,265 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-14 10:53:24,266 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-14 10:53:24,267 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-14 10:53:24,267 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-14 10:53:24,268 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-14 10:53:24,268 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-14 10:53:24,268 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-14 10:53:24,268 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-14 10:53:24,269 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-14 10:53:24,270 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-14 10:53:24,270 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-14 10:53:24,271 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-14 10:53:24,290 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-14 10:53:24,292 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-14 10:53:24,293 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-14 10:53:24,293 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-14 10:53:24,293 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-14 10:53:24,294 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-14 10:53:24,294 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-14 10:53:24,294 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-14 10:53:24,294 INFO L138 SettingsManager]: * Use SBE=true [2023-02-14 10:53:24,295 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-14 10:53:24,295 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-14 10:53:24,295 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-14 10:53:24,296 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-14 10:53:24,296 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-14 10:53:24,296 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-14 10:53:24,296 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-14 10:53:24,296 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-14 10:53:24,296 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-14 10:53:24,296 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-14 10:53:24,296 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-14 10:53:24,297 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-14 10:53:24,297 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-14 10:53:24,297 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-14 10:53:24,297 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-14 10:53:24,297 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 10:53:24,297 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-14 10:53:24,297 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-14 10:53:24,297 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-14 10:53:24,298 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-14 10:53:24,298 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-14 10:53:24,298 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-14 10:53:24,298 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-14 10:53:24,299 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-14 10:53:24,299 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-14 10:53:24,299 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-14 10:53:24,299 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> a38de44f112a10364737c35b840e673503a211a020b9f494a50e4a32c8fe31c0 [2023-02-14 10:53:24,502 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-14 10:53:24,521 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-14 10:53:24,523 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-14 10:53:24,523 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-14 10:53:24,524 INFO L275 PluginConnector]: CDTParser initialized [2023-02-14 10:53:24,524 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i [2023-02-14 10:53:25,566 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-14 10:53:25,732 INFO L351 CDTParser]: Found 1 translation units. [2023-02-14 10:53:25,733 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i [2023-02-14 10:53:25,758 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8001a70d3/0bd59a5587b94b7bbb51cd25076bfe52/FLAG230e97428 [2023-02-14 10:53:25,774 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8001a70d3/0bd59a5587b94b7bbb51cd25076bfe52 [2023-02-14 10:53:25,776 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-14 10:53:25,777 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-14 10:53:25,777 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-14 10:53:25,778 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-14 10:53:25,787 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-14 10:53:25,787 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 10:53:25" (1/1) ... [2023-02-14 10:53:25,788 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e618149 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:53:25, skipping insertion in model container [2023-02-14 10:53:25,788 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 10:53:25" (1/1) ... [2023-02-14 10:53:25,794 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-14 10:53:25,824 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 10:53:26,051 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i[33822,33835] [2023-02-14 10:53:26,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 10:53:26,106 INFO L203 MainTranslator]: Completed pre-run [2023-02-14 10:53:26,139 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i[33822,33835] [2023-02-14 10:53:26,166 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 10:53:26,203 INFO L208 MainTranslator]: Completed translation [2023-02-14 10:53:26,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:53:26 WrapperNode [2023-02-14 10:53:26,203 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-14 10:53:26,205 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-14 10:53:26,205 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-14 10:53:26,205 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-14 10:53:26,210 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:53:26" (1/1) ... [2023-02-14 10:53:26,224 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:53:26" (1/1) ... [2023-02-14 10:53:26,249 INFO L138 Inliner]: procedures = 232, calls = 75, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 116 [2023-02-14 10:53:26,250 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-14 10:53:26,250 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-14 10:53:26,251 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-14 10:53:26,251 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-14 10:53:26,257 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:53:26" (1/1) ... [2023-02-14 10:53:26,258 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:53:26" (1/1) ... [2023-02-14 10:53:26,263 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:53:26" (1/1) ... [2023-02-14 10:53:26,263 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:53:26" (1/1) ... [2023-02-14 10:53:26,270 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:53:26" (1/1) ... [2023-02-14 10:53:26,274 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:53:26" (1/1) ... [2023-02-14 10:53:26,276 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:53:26" (1/1) ... [2023-02-14 10:53:26,278 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:53:26" (1/1) ... [2023-02-14 10:53:26,280 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-14 10:53:26,281 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-14 10:53:26,281 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-14 10:53:26,281 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-14 10:53:26,282 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:53:26" (1/1) ... [2023-02-14 10:53:26,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 10:53:26,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 10:53:26,305 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) [2023-02-14 10:53:26,310 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 [2023-02-14 10:53:26,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-14 10:53:26,333 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2023-02-14 10:53:26,334 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2023-02-14 10:53:26,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-14 10:53:26,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-14 10:53:26,340 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2023-02-14 10:53:26,341 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2023-02-14 10:53:26,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-14 10:53:26,341 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2023-02-14 10:53:26,341 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2023-02-14 10:53:26,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-14 10:53:26,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-14 10:53:26,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-14 10:53:26,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-14 10:53:26,341 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2023-02-14 10:53:26,342 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2023-02-14 10:53:26,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-14 10:53:26,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-14 10:53:26,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-14 10:53:26,435 INFO L235 CfgBuilder]: Building ICFG [2023-02-14 10:53:26,436 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-14 10:53:26,817 INFO L276 CfgBuilder]: Performing block encoding [2023-02-14 10:53:26,829 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-14 10:53:26,829 INFO L300 CfgBuilder]: Removed 41 assume(true) statements. [2023-02-14 10:53:26,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 10:53:26 BoogieIcfgContainer [2023-02-14 10:53:26,832 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-14 10:53:26,835 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-14 10:53:26,836 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-14 10:53:26,838 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-14 10:53:26,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.02 10:53:25" (1/3) ... [2023-02-14 10:53:26,839 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bcab166 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 10:53:26, skipping insertion in model container [2023-02-14 10:53:26,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:53:26" (2/3) ... [2023-02-14 10:53:26,840 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bcab166 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 10:53:26, skipping insertion in model container [2023-02-14 10:53:26,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 10:53:26" (3/3) ... [2023-02-14 10:53:26,841 INFO L112 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux-1.i [2023-02-14 10:53:26,854 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-14 10:53:26,854 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-14 10:53:26,892 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-14 10:53:26,897 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1481ab7f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-14 10:53:26,897 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-14 10:53:26,901 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 89 states have (on average 1.7415730337078652) internal successors, (155), 108 states have internal predecessors, (155), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-02-14 10:53:26,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-14 10:53:26,905 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:53:26,906 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:53:26,906 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:53:26,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:53:26,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1761516263, now seen corresponding path program 1 times [2023-02-14 10:53:26,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:53:26,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460522672] [2023-02-14 10:53:26,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:53:26,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:53:27,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:53:27,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:53:27,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 10:53:27,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460522672] [2023-02-14 10:53:27,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460522672] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 10:53:27,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 10:53:27,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 10:53:27,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851901651] [2023-02-14 10:53:27,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 10:53:27,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-14 10:53:27,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 10:53:27,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-14 10:53:27,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-14 10:53:27,100 INFO L87 Difference]: Start difference. First operand has 118 states, 89 states have (on average 1.7415730337078652) internal successors, (155), 108 states have internal predecessors, (155), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 10:53:27,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:53:27,152 INFO L93 Difference]: Finished difference Result 230 states and 397 transitions. [2023-02-14 10:53:27,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-14 10:53:27,154 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-14 10:53:27,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:53:27,160 INFO L225 Difference]: With dead ends: 230 [2023-02-14 10:53:27,160 INFO L226 Difference]: Without dead ends: 107 [2023-02-14 10:53:27,169 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 [2023-02-14 10:53:27,171 INFO L413 NwaCegarLoop]: 136 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, 136 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 [2023-02-14 10:53:27,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 10:53:27,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-02-14 10:53:27,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2023-02-14 10:53:27,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 97 states have internal predecessors, (102), 21 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-14 10:53:27,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 128 transitions. [2023-02-14 10:53:27,213 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 128 transitions. Word has length 9 [2023-02-14 10:53:27,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:53:27,214 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 128 transitions. [2023-02-14 10:53:27,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 10:53:27,214 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 128 transitions. [2023-02-14 10:53:27,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-14 10:53:27,216 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:53:27,216 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:53:27,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-14 10:53:27,217 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:53:27,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:53:27,217 INFO L85 PathProgramCache]: Analyzing trace with hash 849043181, now seen corresponding path program 1 times [2023-02-14 10:53:27,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:53:27,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415021646] [2023-02-14 10:53:27,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:53:27,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:53:27,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:53:27,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-14 10:53:27,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:53:27,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:53:27,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 10:53:27,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415021646] [2023-02-14 10:53:27,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415021646] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 10:53:27,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 10:53:27,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 10:53:27,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632826825] [2023-02-14 10:53:27,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 10:53:27,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 10:53:27,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 10:53:27,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 10:53:27,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-14 10:53:27,546 INFO L87 Difference]: Start difference. First operand 107 states and 128 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 10:53:27,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:53:27,816 INFO L93 Difference]: Finished difference Result 109 states and 129 transitions. [2023-02-14 10:53:27,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-14 10:53:27,817 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2023-02-14 10:53:27,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:53:27,818 INFO L225 Difference]: With dead ends: 109 [2023-02-14 10:53:27,818 INFO L226 Difference]: Without dead ends: 106 [2023-02-14 10:53:27,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-14 10:53:27,820 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 242 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 10:53:27,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 133 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 10:53:27,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-02-14 10:53:27,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2023-02-14 10:53:27,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 82 states have (on average 1.2317073170731707) internal successors, (101), 96 states have internal predecessors, (101), 20 states have call successors, (20), 4 states have call predecessors, (20), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-14 10:53:27,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 126 transitions. [2023-02-14 10:53:27,838 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 126 transitions. Word has length 21 [2023-02-14 10:53:27,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:53:27,839 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 126 transitions. [2023-02-14 10:53:27,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 10:53:27,840 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 126 transitions. [2023-02-14 10:53:27,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-14 10:53:27,840 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:53:27,840 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:53:27,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-14 10:53:27,841 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:53:27,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:53:27,841 INFO L85 PathProgramCache]: Analyzing trace with hash 502050183, now seen corresponding path program 1 times [2023-02-14 10:53:27,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:53:27,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211158312] [2023-02-14 10:53:27,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:53:27,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:53:27,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:53:28,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-14 10:53:28,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:53:28,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:53:28,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 10:53:28,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211158312] [2023-02-14 10:53:28,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211158312] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 10:53:28,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 10:53:28,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-14 10:53:28,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642506586] [2023-02-14 10:53:28,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 10:53:28,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-14 10:53:28,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 10:53:28,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-14 10:53:28,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-02-14 10:53:28,351 INFO L87 Difference]: Start difference. First operand 106 states and 126 transitions. Second operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 10:53:28,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:53:28,965 INFO L93 Difference]: Finished difference Result 198 states and 235 transitions. [2023-02-14 10:53:28,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-14 10:53:28,966 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2023-02-14 10:53:28,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:53:28,968 INFO L225 Difference]: With dead ends: 198 [2023-02-14 10:53:28,968 INFO L226 Difference]: Without dead ends: 192 [2023-02-14 10:53:28,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2023-02-14 10:53:28,969 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 533 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-14 10:53:28,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 157 Invalid, 969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 850 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-14 10:53:28,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2023-02-14 10:53:28,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 172. [2023-02-14 10:53:28,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 144 states have (on average 1.2430555555555556) internal successors, (179), 158 states have internal predecessors, (179), 23 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-14 10:53:28,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 209 transitions. [2023-02-14 10:53:28,985 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 209 transitions. Word has length 24 [2023-02-14 10:53:28,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:53:28,985 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 209 transitions. [2023-02-14 10:53:28,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 10:53:28,986 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 209 transitions. [2023-02-14 10:53:28,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-14 10:53:28,986 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:53:28,986 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:53:28,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-14 10:53:28,987 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:53:28,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:53:28,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1234303898, now seen corresponding path program 1 times [2023-02-14 10:53:28,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:53:28,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533244106] [2023-02-14 10:53:28,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:53:28,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:53:29,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:53:29,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-14 10:53:29,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:53:29,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:53:29,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 10:53:29,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533244106] [2023-02-14 10:53:29,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533244106] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 10:53:29,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 10:53:29,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-14 10:53:29,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643697811] [2023-02-14 10:53:29,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 10:53:29,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-14 10:53:29,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 10:53:29,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-14 10:53:29,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-02-14 10:53:29,690 INFO L87 Difference]: Start difference. First operand 172 states and 209 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 10:53:30,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:53:30,278 INFO L93 Difference]: Finished difference Result 274 states and 329 transitions. [2023-02-14 10:53:30,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-14 10:53:30,279 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2023-02-14 10:53:30,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:53:30,280 INFO L225 Difference]: With dead ends: 274 [2023-02-14 10:53:30,280 INFO L226 Difference]: Without dead ends: 271 [2023-02-14 10:53:30,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2023-02-14 10:53:30,281 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 322 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-14 10:53:30,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 225 Invalid, 998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 951 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-14 10:53:30,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2023-02-14 10:53:30,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 253. [2023-02-14 10:53:30,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 218 states have (on average 1.238532110091743) internal successors, (270), 233 states have internal predecessors, (270), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-14 10:53:30,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 309 transitions. [2023-02-14 10:53:30,312 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 309 transitions. Word has length 27 [2023-02-14 10:53:30,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:53:30,312 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 309 transitions. [2023-02-14 10:53:30,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 10:53:30,312 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 309 transitions. [2023-02-14 10:53:30,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-14 10:53:30,313 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:53:30,314 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:53:30,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-14 10:53:30,314 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:53:30,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:53:30,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1680148119, now seen corresponding path program 1 times [2023-02-14 10:53:30,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:53:30,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933851076] [2023-02-14 10:53:30,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:53:30,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:53:30,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:53:30,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-14 10:53:30,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:53:31,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:53:31,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 10:53:31,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933851076] [2023-02-14 10:53:31,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933851076] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 10:53:31,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 10:53:31,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-02-14 10:53:31,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752766877] [2023-02-14 10:53:31,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 10:53:31,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-14 10:53:31,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 10:53:31,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-14 10:53:31,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2023-02-14 10:53:31,097 INFO L87 Difference]: Start difference. First operand 253 states and 309 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 9 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 10:53:31,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:53:31,991 INFO L93 Difference]: Finished difference Result 273 states and 327 transitions. [2023-02-14 10:53:31,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-14 10:53:31,995 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 9 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2023-02-14 10:53:31,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:53:31,996 INFO L225 Difference]: With dead ends: 273 [2023-02-14 10:53:31,996 INFO L226 Difference]: Without dead ends: 270 [2023-02-14 10:53:31,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2023-02-14 10:53:31,997 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 352 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 1191 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 1233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-14 10:53:31,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 295 Invalid, 1233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1191 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-14 10:53:31,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2023-02-14 10:53:32,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 253. [2023-02-14 10:53:32,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 218 states have (on average 1.2339449541284404) internal successors, (269), 233 states have internal predecessors, (269), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-14 10:53:32,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 308 transitions. [2023-02-14 10:53:32,020 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 308 transitions. Word has length 30 [2023-02-14 10:53:32,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:53:32,020 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 308 transitions. [2023-02-14 10:53:32,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 9 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 10:53:32,020 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 308 transitions. [2023-02-14 10:53:32,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-14 10:53:32,021 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:53:32,021 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:53:32,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-14 10:53:32,021 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:53:32,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:53:32,022 INFO L85 PathProgramCache]: Analyzing trace with hash -493122043, now seen corresponding path program 1 times [2023-02-14 10:53:32,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:53:32,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377937550] [2023-02-14 10:53:32,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:53:32,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:53:32,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:53:32,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-14 10:53:32,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:53:33,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:53:33,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 10:53:33,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377937550] [2023-02-14 10:53:33,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377937550] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 10:53:33,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 10:53:33,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-02-14 10:53:33,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492233919] [2023-02-14 10:53:33,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 10:53:33,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-14 10:53:33,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 10:53:33,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-14 10:53:33,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2023-02-14 10:53:33,012 INFO L87 Difference]: Start difference. First operand 253 states and 308 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 10 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 10:53:33,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:53:33,888 INFO L93 Difference]: Finished difference Result 272 states and 325 transitions. [2023-02-14 10:53:33,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-14 10:53:33,888 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 10 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2023-02-14 10:53:33,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:53:33,889 INFO L225 Difference]: With dead ends: 272 [2023-02-14 10:53:33,889 INFO L226 Difference]: Without dead ends: 269 [2023-02-14 10:53:33,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2023-02-14 10:53:33,890 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 352 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 1090 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 1130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-14 10:53:33,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 271 Invalid, 1130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1090 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-14 10:53:33,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2023-02-14 10:53:33,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 253. [2023-02-14 10:53:33,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 218 states have (on average 1.2293577981651376) internal successors, (268), 233 states have internal predecessors, (268), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-14 10:53:33,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 307 transitions. [2023-02-14 10:53:33,911 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 307 transitions. Word has length 33 [2023-02-14 10:53:33,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:53:33,912 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 307 transitions. [2023-02-14 10:53:33,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 10 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 10:53:33,912 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 307 transitions. [2023-02-14 10:53:33,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-14 10:53:33,913 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:53:33,913 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:53:33,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-14 10:53:33,913 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:53:33,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:53:33,914 INFO L85 PathProgramCache]: Analyzing trace with hash -2033122620, now seen corresponding path program 1 times [2023-02-14 10:53:33,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:53:33,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003639428] [2023-02-14 10:53:33,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:53:33,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:53:33,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:53:34,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-14 10:53:34,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:53:35,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:53:35,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 10:53:35,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003639428] [2023-02-14 10:53:35,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003639428] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 10:53:35,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 10:53:35,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-14 10:53:35,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529803626] [2023-02-14 10:53:35,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 10:53:35,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-14 10:53:35,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 10:53:35,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-14 10:53:35,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2023-02-14 10:53:35,013 INFO L87 Difference]: Start difference. First operand 253 states and 307 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 8 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 10:53:35,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:53:35,794 INFO L93 Difference]: Finished difference Result 271 states and 323 transitions. [2023-02-14 10:53:35,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-14 10:53:35,794 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 8 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2023-02-14 10:53:35,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:53:35,796 INFO L225 Difference]: With dead ends: 271 [2023-02-14 10:53:35,796 INFO L226 Difference]: Without dead ends: 268 [2023-02-14 10:53:35,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2023-02-14 10:53:35,796 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 348 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 1054 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 1095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-14 10:53:35,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 249 Invalid, 1095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1054 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-14 10:53:35,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2023-02-14 10:53:35,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 253. [2023-02-14 10:53:35,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 218 states have (on average 1.224770642201835) internal successors, (267), 233 states have internal predecessors, (267), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-14 10:53:35,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 306 transitions. [2023-02-14 10:53:35,834 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 306 transitions. Word has length 36 [2023-02-14 10:53:35,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:53:35,835 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 306 transitions. [2023-02-14 10:53:35,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 8 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 10:53:35,835 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 306 transitions. [2023-02-14 10:53:35,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-14 10:53:35,839 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:53:35,839 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:53:35,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-14 10:53:35,839 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:53:35,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:53:35,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1335339115, now seen corresponding path program 1 times [2023-02-14 10:53:35,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:53:35,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427917238] [2023-02-14 10:53:35,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:53:35,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:53:35,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:53:36,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-14 10:53:36,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:53:36,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:53:36,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 10:53:36,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427917238] [2023-02-14 10:53:36,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427917238] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 10:53:36,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 10:53:36,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-14 10:53:36,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101563477] [2023-02-14 10:53:36,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 10:53:36,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-14 10:53:36,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 10:53:36,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-14 10:53:36,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2023-02-14 10:53:36,521 INFO L87 Difference]: Start difference. First operand 253 states and 306 transitions. Second operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 8 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 10:53:37,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:53:37,129 INFO L93 Difference]: Finished difference Result 270 states and 321 transitions. [2023-02-14 10:53:37,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-14 10:53:37,129 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 8 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2023-02-14 10:53:37,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:53:37,130 INFO L225 Difference]: With dead ends: 270 [2023-02-14 10:53:37,130 INFO L226 Difference]: Without dead ends: 267 [2023-02-14 10:53:37,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2023-02-14 10:53:37,132 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 424 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-14 10:53:37,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 250 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 992 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-14 10:53:37,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2023-02-14 10:53:37,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 253. [2023-02-14 10:53:37,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 218 states have (on average 1.2201834862385321) internal successors, (266), 233 states have internal predecessors, (266), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-14 10:53:37,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 305 transitions. [2023-02-14 10:53:37,181 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 305 transitions. Word has length 39 [2023-02-14 10:53:37,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:53:37,182 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 305 transitions. [2023-02-14 10:53:37,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 8 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 10:53:37,182 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 305 transitions. [2023-02-14 10:53:37,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-14 10:53:37,185 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:53:37,185 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:53:37,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-14 10:53:37,185 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:53:37,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:53:37,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1154705564, now seen corresponding path program 1 times [2023-02-14 10:53:37,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:53:37,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153312386] [2023-02-14 10:53:37,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:53:37,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:53:37,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:53:37,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-14 10:53:37,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:53:38,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-14 10:53:38,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:53:38,278 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 10:53:38,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 10:53:38,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153312386] [2023-02-14 10:53:38,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153312386] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 10:53:38,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648931973] [2023-02-14 10:53:38,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:53:38,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 10:53:38,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 10:53:38,297 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) [2023-02-14 10:53:38,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-14 10:53:38,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:53:38,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 142 conjunts are in the unsatisfiable core [2023-02-14 10:53:38,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 10:53:38,568 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-14 10:53:38,568 INFO L350 Elim1Store]: Elim1 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 17 treesize of output 21 [2023-02-14 10:53:38,627 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-14 10:53:38,627 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-14 10:53:38,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2023-02-14 10:53:38,649 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 10:53:38,650 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2023-02-14 10:53:38,681 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 7 [2023-02-14 10:53:38,687 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2023-02-14 10:53:38,827 INFO L321 Elim1Store]: treesize reduction 77, result has 3.8 percent of original size [2023-02-14 10:53:38,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 61 treesize of output 82 [2023-02-14 10:53:38,841 INFO L350 Elim1Store]: Elim1 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 133 treesize of output 105 [2023-02-14 10:53:38,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 78 [2023-02-14 10:53:38,899 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 10:53:38,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:53:38,902 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-02-14 10:53:38,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 treesize of output 24 [2023-02-14 10:53:38,989 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 10:53:38,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2023-02-14 10:53:39,030 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2023-02-14 10:53:39,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 22 treesize of output 8 [2023-02-14 10:53:39,192 INFO L321 Elim1Store]: treesize reduction 177, result has 36.1 percent of original size [2023-02-14 10:53:39,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 258 treesize of output 397 [2023-02-14 10:53:39,203 INFO L350 Elim1Store]: Elim1 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 8 treesize of output 7 [2023-02-14 10:53:39,214 INFO L350 Elim1Store]: Elim1 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 8 treesize of output 7 [2023-02-14 10:53:39,226 INFO L350 Elim1Store]: Elim1 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 8 treesize of output 7 [2023-02-14 10:53:39,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:53:39,670 INFO L321 Elim1Store]: treesize reduction 139, result has 22.3 percent of original size [2023-02-14 10:53:39,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 747 treesize of output 805 [2023-02-14 10:53:39,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2023-02-14 10:53:39,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2023-02-14 10:53:39,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2023-02-14 10:53:39,854 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 10:53:39,855 INFO L350 Elim1Store]: Elim1 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 156 treesize of output 11 [2023-02-14 10:53:39,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2023-02-14 10:53:40,578 INFO L321 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2023-02-14 10:53:40,579 INFO L350 Elim1Store]: Elim1 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 606 treesize of output 436 [2023-02-14 10:53:40,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:53:40,597 INFO L321 Elim1Store]: treesize reduction 38, result has 19.1 percent of original size [2023-02-14 10:53:40,598 INFO L350 Elim1Store]: Elim1 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 580 treesize of output 507 [2023-02-14 10:53:40,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 494 treesize of output 416 [2023-02-14 10:53:40,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 treesize of output 3 [2023-02-14 10:53:40,709 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-02-14 10:53:40,709 INFO L350 Elim1Store]: Elim1 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 385 treesize of output 351 [2023-02-14 10:53:40,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:53:40,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:53:40,728 INFO L321 Elim1Store]: treesize reduction 37, result has 36.2 percent of original size [2023-02-14 10:53:40,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 92 [2023-02-14 10:53:40,999 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2023-02-14 10:53:41,050 INFO L350 Elim1Store]: Elim1 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 20 treesize of output 8 [2023-02-14 10:53:41,084 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:53:41,084 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 10:53:41,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [648931973] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 10:53:41,506 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 10:53:41,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 29 [2023-02-14 10:53:41,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667575799] [2023-02-14 10:53:41,507 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 10:53:41,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-02-14 10:53:41,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 10:53:41,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-02-14 10:53:41,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1122, Unknown=34, NotChecked=0, Total=1260 [2023-02-14 10:53:41,508 INFO L87 Difference]: Start difference. First operand 253 states and 305 transitions. Second operand has 30 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 20 states have internal predecessors, (65), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-14 10:53:42,229 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.offset| |c_list_add_#in~head#1.base|)) (.cse6 (select (select |c_old(#memory_$Pointer$.base)| |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset|))) (let ((.cse0 (= |c_list_add_#in~head#1.base| .cse6)) (.cse14 (= |c_list_add_#in~new#1.offset| (select .cse3 |c_list_add_#in~head#1.offset|))) (.cse12 (select |c_#memory_$Pointer$.offset| .cse6)) (.cse4 (= |c_list_add_#in~head#1.base| |c_list_add_#in~new#1.base|)) (.cse1 (select |c_old(#memory_$Pointer$.offset)| |c_list_add_#in~head#1.base|))) (let ((.cse7 (select |c_old(#memory_$Pointer$.base)| .cse6)) (.cse8 (+ (select .cse1 |c_list_add_#in~head#1.offset|) 4)) (.cse15 (and (or (and .cse0 .cse14) (and .cse14 (exists ((v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int))) (let ((.cse21 (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse6 v_DerPreprocessor_16) |c_list_add_#in~new#1.base| v_DerPreprocessor_17) |c_list_add_#in~head#1.base| .cse3) .cse6 v_DerPreprocessor_16) |c_list_add_#in~new#1.base| v_DerPreprocessor_17) |c_list_add_#in~head#1.base| .cse3) .cse6 v_DerPreprocessor_16) |c_list_add_#in~new#1.base| v_DerPreprocessor_17) |c_list_add_#in~head#1.base| .cse3) .cse6 v_DerPreprocessor_16) |c_list_add_#in~new#1.base| v_DerPreprocessor_17) |c_list_add_#in~head#1.base| .cse3) .cse6 v_DerPreprocessor_16) |c_list_add_#in~new#1.base| v_DerPreprocessor_17) |c_list_add_#in~head#1.base| .cse3) .cse6 v_DerPreprocessor_16) |c_list_add_#in~new#1.base| v_DerPreprocessor_17) |c_list_add_#in~head#1.base| .cse3))) (let ((.cse20 (select .cse21 .cse6))) (and (= .cse20 v_DerPreprocessor_16) (= .cse12 .cse20) (= (select |c_#memory_$Pointer$.offset| |c_list_add_#in~new#1.base|) (select .cse21 |c_list_add_#in~new#1.base|)))))))) (not .cse4))) (.cse9 (= |c_list_add_#in~new#1.base| .cse6))) (and (or .cse0 (let ((.cse2 (@diff .cse1 .cse3))) (and (= (store .cse1 .cse2 (select .cse3 .cse2)) .cse3) (or (= |c_list_add_#in~head#1.offset| .cse2) (= .cse1 .cse3)))) .cse4) (exists ((v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1025 (Array Int Int)) (v_ArrVal_1017 Int) (|list_add___list_add_~next#1.offset| Int)) (= (let ((.cse5 (store |c_old(#memory_$Pointer$.base)| .cse6 (store .cse7 (+ |list_add___list_add_~next#1.offset| 4) |c_list_add_#in~new#1.base|)))) (store (store .cse5 |c_list_add_#in~new#1.base| v_ArrVal_1025) |c_list_add_#in~head#1.base| (store (select (store .cse5 |c_list_add_#in~new#1.base| v_ArrVal_1015) |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| v_ArrVal_1017))) |c_#memory_$Pointer$.base|)) (= (select |c_#valid| 3) 1) (exists ((v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1004 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store (store (store |c_old(#memory_$Pointer$.base)| .cse6 v_ArrVal_1006) |c_list_add_#in~new#1.base| v_ArrVal_1008) |c_list_add_#in~head#1.base| (store (select (store (store |c_old(#memory_$Pointer$.base)| .cse6 (store .cse7 .cse8 |c_list_add_#in~new#1.base|)) |c_list_add_#in~new#1.base| v_ArrVal_1004) |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|)))) (or (not .cse0) (<= |c_list_add_#in~new#1.offset| (select .cse3 .cse8)) .cse9 (= |c_list_add_#in~head#1.offset| .cse8)) (= 3 |c_~#gl_list~0.base|) (= (select (select |c_#memory_$Pointer$.base| |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset|) |c_list_add_#in~new#1.base|) (or (and (or (exists ((v_DerPreprocessor_12 (Array Int Int))) (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse10 (store (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse6 v_DerPreprocessor_10) |c_list_add_#in~new#1.base| v_DerPreprocessor_11) |c_list_add_#in~head#1.base| v_DerPreprocessor_12) .cse6 v_DerPreprocessor_10) |c_list_add_#in~new#1.base| v_DerPreprocessor_11) |c_list_add_#in~head#1.base| v_DerPreprocessor_12))) (and (= v_DerPreprocessor_11 (select .cse10 |c_list_add_#in~new#1.base|)) (exists ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_prenex_20 (Array Int Int))) (let ((.cse11 (store (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse6 v_prenex_19) |c_list_add_#in~new#1.base| v_prenex_21) |c_list_add_#in~head#1.base| v_prenex_20) .cse6 v_prenex_19) |c_list_add_#in~new#1.base| v_prenex_21) |c_list_add_#in~head#1.base| v_prenex_20))) (let ((.cse13 (select .cse11 .cse6))) (and (= v_prenex_21 (select .cse11 |c_list_add_#in~new#1.base|)) (= |c_list_add_#in~new#1.offset| (select v_prenex_20 |c_list_add_#in~head#1.offset|)) (= .cse12 .cse13) (= (select .cse10 .cse6) .cse13)))))))) (= |c_list_add_#in~new#1.offset| (select v_DerPreprocessor_12 |c_list_add_#in~head#1.offset|)))) .cse9) .cse14 .cse4) .cse15) (<= 0 |c_~#gl_list~0.offset|) (or .cse15 (and (or (exists ((v_DerPreprocessor_12 (Array Int Int))) (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse19 (store (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse6 v_DerPreprocessor_10) |c_list_add_#in~new#1.base| v_DerPreprocessor_11) |c_list_add_#in~head#1.base| v_DerPreprocessor_12) .cse6 v_DerPreprocessor_10) |c_list_add_#in~new#1.base| v_DerPreprocessor_11) |c_list_add_#in~head#1.base| v_DerPreprocessor_12))) (let ((.cse16 (select .cse19 .cse6))) (and (= .cse16 v_DerPreprocessor_10) (exists ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_prenex_20 (Array Int Int))) (let ((.cse17 (store (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse6 v_prenex_19) |c_list_add_#in~new#1.base| v_prenex_21) |c_list_add_#in~head#1.base| v_prenex_20) .cse6 v_prenex_19) |c_list_add_#in~new#1.base| v_prenex_21) |c_list_add_#in~head#1.base| v_prenex_20))) (let ((.cse18 (select .cse17 .cse6))) (and (= v_prenex_21 (select .cse17 |c_list_add_#in~new#1.base|)) (= |c_list_add_#in~new#1.offset| (select v_prenex_20 |c_list_add_#in~head#1.offset|)) (= v_prenex_19 .cse18) (= .cse12 .cse18) (= .cse16 .cse18))))) (= v_DerPreprocessor_11 (select .cse19 |c_list_add_#in~new#1.base|)))))) (= |c_list_add_#in~new#1.offset| (select v_DerPreprocessor_12 |c_list_add_#in~head#1.offset|)))) .cse9) .cse14 .cse4)) (<= |c_~#gl_list~0.offset| 0))))) is different from true [2023-02-14 10:53:44,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 10:53:49,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:53:49,178 INFO L93 Difference]: Finished difference Result 366 states and 429 transitions. [2023-02-14 10:53:49,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-02-14 10:53:49,179 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 20 states have internal predecessors, (65), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 40 [2023-02-14 10:53:49,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:53:49,180 INFO L225 Difference]: With dead ends: 366 [2023-02-14 10:53:49,180 INFO L226 Difference]: Without dead ends: 360 [2023-02-14 10:53:49,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=387, Invalid=2867, Unknown=56, NotChecked=112, Total=3422 [2023-02-14 10:53:49,183 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 828 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 4188 mSolverCounterSat, 157 mSolverCounterUnsat, 123 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 830 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 4483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 4188 IncrementalHoareTripleChecker+Invalid, 123 IncrementalHoareTripleChecker+Unknown, 15 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2023-02-14 10:53:49,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [830 Valid, 770 Invalid, 4483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 4188 Invalid, 123 Unknown, 15 Unchecked, 5.5s Time] [2023-02-14 10:53:49,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2023-02-14 10:53:49,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 274. [2023-02-14 10:53:49,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 237 states have (on average 1.2067510548523206) internal successors, (286), 252 states have internal predecessors, (286), 29 states have call successors, (29), 10 states have call predecessors, (29), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-14 10:53:49,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 326 transitions. [2023-02-14 10:53:49,218 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 326 transitions. Word has length 40 [2023-02-14 10:53:49,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:53:49,218 INFO L495 AbstractCegarLoop]: Abstraction has 274 states and 326 transitions. [2023-02-14 10:53:49,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 20 states have internal predecessors, (65), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-14 10:53:49,219 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 326 transitions. [2023-02-14 10:53:49,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-14 10:53:49,219 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:53:49,219 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:53:49,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-14 10:53:49,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 10:53:49,426 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:53:49,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:53:49,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1293265745, now seen corresponding path program 1 times [2023-02-14 10:53:49,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:53:49,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904900590] [2023-02-14 10:53:49,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:53:49,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:53:49,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:53:50,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-14 10:53:50,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:53:50,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:53:50,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 10:53:50,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904900590] [2023-02-14 10:53:50,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904900590] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 10:53:50,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 10:53:50,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-02-14 10:53:50,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464405395] [2023-02-14 10:53:50,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 10:53:50,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-14 10:53:50,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 10:53:50,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-14 10:53:50,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2023-02-14 10:53:50,298 INFO L87 Difference]: Start difference. First operand 274 states and 326 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 10:53:51,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:53:51,288 INFO L93 Difference]: Finished difference Result 290 states and 340 transitions. [2023-02-14 10:53:51,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-14 10:53:51,289 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2023-02-14 10:53:51,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:53:51,290 INFO L225 Difference]: With dead ends: 290 [2023-02-14 10:53:51,291 INFO L226 Difference]: Without dead ends: 287 [2023-02-14 10:53:51,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2023-02-14 10:53:51,291 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 379 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 1232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-14 10:53:51,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 295 Invalid, 1232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-14 10:53:51,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2023-02-14 10:53:51,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 274. [2023-02-14 10:53:51,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 237 states have (on average 1.2025316455696202) internal successors, (285), 252 states have internal predecessors, (285), 29 states have call successors, (29), 10 states have call predecessors, (29), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-14 10:53:51,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 325 transitions. [2023-02-14 10:53:51,322 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 325 transitions. Word has length 42 [2023-02-14 10:53:51,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:53:51,322 INFO L495 AbstractCegarLoop]: Abstraction has 274 states and 325 transitions. [2023-02-14 10:53:51,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 10:53:51,323 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 325 transitions. [2023-02-14 10:53:51,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-14 10:53:51,323 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:53:51,323 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:53:51,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-14 10:53:51,324 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:53:51,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:53:51,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1188127317, now seen corresponding path program 1 times [2023-02-14 10:53:51,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:53:51,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009718670] [2023-02-14 10:53:51,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:53:51,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:53:51,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:53:52,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-14 10:53:52,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:53:52,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-14 10:53:52,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:53:52,342 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 10:53:52,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 10:53:52,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009718670] [2023-02-14 10:53:52,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009718670] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 10:53:52,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685545500] [2023-02-14 10:53:52,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:53:52,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 10:53:52,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 10:53:52,358 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) [2023-02-14 10:53:52,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-14 10:53:52,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:53:52,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 167 conjunts are in the unsatisfiable core [2023-02-14 10:53:52,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 10:53:52,629 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-14 10:53:52,629 INFO L350 Elim1Store]: Elim1 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 17 treesize of output 21 [2023-02-14 10:53:52,693 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2023-02-14 10:53:52,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:53:52,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 17 treesize of output 7 [2023-02-14 10:53:52,768 INFO L321 Elim1Store]: treesize reduction 69, result has 33.0 percent of original size [2023-02-14 10:53:52,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 100 [2023-02-14 10:53:52,777 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 114 treesize of output 91 [2023-02-14 10:53:52,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:53:52,926 INFO L321 Elim1Store]: treesize reduction 44, result has 38.0 percent of original size [2023-02-14 10:53:52,926 INFO L350 Elim1Store]: Elim1 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 153 treesize of output 121 [2023-02-14 10:53:52,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:53:52,933 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 43 [2023-02-14 10:53:52,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:53:52,957 INFO L321 Elim1Store]: treesize reduction 30, result has 40.0 percent of original size [2023-02-14 10:53:52,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 55 [2023-02-14 10:53:53,081 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 10:53:53,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 124 [2023-02-14 10:53:53,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:53:53,087 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 79 [2023-02-14 10:53:53,099 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-14 10:53:53,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 16 treesize of output 26 [2023-02-14 10:53:53,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:53:53,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2023-02-14 10:53:53,202 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 10:53:53,202 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2023-02-14 10:53:53,262 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2023-02-14 10:53:53,266 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2023-02-14 10:53:53,290 INFO L350 Elim1Store]: Elim1 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 33 treesize of output 27 [2023-02-14 10:53:53,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:53:53,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 36 treesize of output 16 [2023-02-14 10:53:53,486 INFO L321 Elim1Store]: treesize reduction 61, result has 19.7 percent of original size [2023-02-14 10:53:53,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 137 treesize of output 148 [2023-02-14 10:53:53,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:53:53,509 INFO L321 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2023-02-14 10:53:53,510 INFO L350 Elim1Store]: Elim1 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 3 case distinctions, treesize of input 162 treesize of output 113 [2023-02-14 10:53:53,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:53:53,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 100 treesize of output 84 [2023-02-14 10:53:53,519 INFO L350 Elim1Store]: Elim1 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 67 treesize of output 59 [2023-02-14 10:53:53,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:53:53,543 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-14 10:53:53,543 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 57 [2023-02-14 10:53:53,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:53:53,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 40 [2023-02-14 10:53:53,658 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2023-02-14 10:53:53,672 INFO L321 Elim1Store]: treesize reduction 37, result has 36.2 percent of original size [2023-02-14 10:53:53,673 INFO L350 Elim1Store]: Elim1 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 2 case distinctions, treesize of input 59 treesize of output 72 [2023-02-14 10:53:53,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 30 treesize of output 18 [2023-02-14 10:53:53,960 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 11 [2023-02-14 10:53:53,986 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:53:53,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 10:53:54,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685545500] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 10:53:54,537 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 10:53:54,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 28 [2023-02-14 10:53:54,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101744213] [2023-02-14 10:53:54,537 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 10:53:54,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-02-14 10:53:54,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 10:53:54,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-02-14 10:53:54,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1063, Unknown=10, NotChecked=0, Total=1190 [2023-02-14 10:53:54,539 INFO L87 Difference]: Start difference. First operand 274 states and 325 transitions. Second operand has 29 states, 29 states have (on average 2.5172413793103448) internal successors, (73), 19 states have internal predecessors, (73), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-14 10:53:57,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:53:57,497 INFO L93 Difference]: Finished difference Result 378 states and 448 transitions. [2023-02-14 10:53:57,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-14 10:53:57,505 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.5172413793103448) internal successors, (73), 19 states have internal predecessors, (73), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 43 [2023-02-14 10:53:57,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:53:57,507 INFO L225 Difference]: With dead ends: 378 [2023-02-14 10:53:57,507 INFO L226 Difference]: Without dead ends: 375 [2023-02-14 10:53:57,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=346, Invalid=2291, Unknown=15, NotChecked=0, Total=2652 [2023-02-14 10:53:57,508 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 1687 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 2268 mSolverCounterSat, 312 mSolverCounterUnsat, 57 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1687 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 2637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 312 IncrementalHoareTripleChecker+Valid, 2268 IncrementalHoareTripleChecker+Invalid, 57 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-02-14 10:53:57,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1687 Valid, 418 Invalid, 2637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [312 Valid, 2268 Invalid, 57 Unknown, 0 Unchecked, 1.8s Time] [2023-02-14 10:53:57,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2023-02-14 10:53:57,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 277. [2023-02-14 10:53:57,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 240 states have (on average 1.1958333333333333) internal successors, (287), 255 states have internal predecessors, (287), 29 states have call successors, (29), 10 states have call predecessors, (29), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-14 10:53:57,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 327 transitions. [2023-02-14 10:53:57,591 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 327 transitions. Word has length 43 [2023-02-14 10:53:57,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:53:57,591 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 327 transitions. [2023-02-14 10:53:57,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.5172413793103448) internal successors, (73), 19 states have internal predecessors, (73), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-14 10:53:57,592 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 327 transitions. [2023-02-14 10:53:57,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-14 10:53:57,593 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:53:57,593 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:53:57,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-14 10:53:57,793 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,SelfDestructingSolverStorable10 [2023-02-14 10:53:57,793 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:53:57,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:53:57,794 INFO L85 PathProgramCache]: Analyzing trace with hash -2001574846, now seen corresponding path program 1 times [2023-02-14 10:53:57,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:53:57,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771671760] [2023-02-14 10:53:57,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:53:57,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:53:57,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:53:58,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-14 10:53:58,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:53:58,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:53:58,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 10:53:58,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771671760] [2023-02-14 10:53:58,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771671760] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 10:53:58,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 10:53:58,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-02-14 10:53:58,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203423582] [2023-02-14 10:53:58,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 10:53:58,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-14 10:53:58,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 10:53:58,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-14 10:53:58,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2023-02-14 10:53:58,549 INFO L87 Difference]: Start difference. First operand 277 states and 327 transitions. Second operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 9 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 10:53:59,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:53:59,578 INFO L93 Difference]: Finished difference Result 292 states and 340 transitions. [2023-02-14 10:53:59,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-14 10:53:59,578 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 9 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2023-02-14 10:53:59,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:53:59,579 INFO L225 Difference]: With dead ends: 292 [2023-02-14 10:53:59,579 INFO L226 Difference]: Without dead ends: 289 [2023-02-14 10:53:59,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2023-02-14 10:53:59,580 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 371 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-14 10:53:59,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 295 Invalid, 1230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-14 10:53:59,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2023-02-14 10:53:59,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 277. [2023-02-14 10:53:59,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 240 states have (on average 1.1916666666666667) internal successors, (286), 255 states have internal predecessors, (286), 29 states have call successors, (29), 10 states have call predecessors, (29), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-14 10:53:59,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 326 transitions. [2023-02-14 10:53:59,616 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 326 transitions. Word has length 45 [2023-02-14 10:53:59,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:53:59,616 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 326 transitions. [2023-02-14 10:53:59,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 9 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 10:53:59,616 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 326 transitions. [2023-02-14 10:53:59,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-14 10:53:59,617 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:53:59,617 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:53:59,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-14 10:53:59,617 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:53:59,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:53:59,618 INFO L85 PathProgramCache]: Analyzing trace with hash 438546823, now seen corresponding path program 1 times [2023-02-14 10:53:59,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:53:59,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881512285] [2023-02-14 10:53:59,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:53:59,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:53:59,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:54:00,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-14 10:54:00,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:54:01,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-14 10:54:01,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:54:01,327 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 10:54:01,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 10:54:01,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881512285] [2023-02-14 10:54:01,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881512285] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 10:54:01,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237037937] [2023-02-14 10:54:01,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:54:01,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 10:54:01,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 10:54:01,337 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) [2023-02-14 10:54:01,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-14 10:54:01,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:54:01,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 199 conjunts are in the unsatisfiable core [2023-02-14 10:54:01,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 10:54:01,585 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-14 10:54:01,585 INFO L350 Elim1Store]: Elim1 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 17 treesize of output 21 [2023-02-14 10:54:01,649 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2023-02-14 10:54:01,662 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2023-02-14 10:54:01,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:01,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 17 treesize of output 7 [2023-02-14 10:54:01,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:01,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 17 treesize of output 7 [2023-02-14 10:54:01,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:01,877 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 10:54:01,881 INFO L321 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2023-02-14 10:54:01,881 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 166 treesize of output 115 [2023-02-14 10:54:01,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 98 treesize of output 88 [2023-02-14 10:54:01,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:01,892 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2023-02-14 10:54:01,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:01,898 INFO L350 Elim1Store]: Elim1 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 62 treesize of output 38 [2023-02-14 10:54:01,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:01,911 INFO L321 Elim1Store]: treesize reduction 48, result has 18.6 percent of original size [2023-02-14 10:54:01,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 56 treesize of output 52 [2023-02-14 10:54:01,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:01,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2023-02-14 10:54:01,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 [2023-02-14 10:54:02,002 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 10:54:02,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 68 [2023-02-14 10:54:02,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:02,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:02,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:02,012 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 10:54:02,014 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-14 10:54:02,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 63 [2023-02-14 10:54:02,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:02,152 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-02-14 10:54:02,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-02-14 10:54:02,225 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 62 [2023-02-14 10:54:02,234 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-14 10:54:02,234 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 47 [2023-02-14 10:54:02,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:02,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 58 treesize of output 32 [2023-02-14 10:54:02,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:02,255 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 10:54:02,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:02,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:02,260 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 10:54:02,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 38 treesize of output 20 [2023-02-14 10:54:02,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:02,421 INFO L321 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2023-02-14 10:54:02,421 INFO L350 Elim1Store]: Elim1 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 172 treesize of output 118 [2023-02-14 10:54:02,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:02,437 INFO L321 Elim1Store]: treesize reduction 42, result has 10.6 percent of original size [2023-02-14 10:54:02,438 INFO L350 Elim1Store]: Elim1 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 146 treesize of output 127 [2023-02-14 10:54:02,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:02,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 98 [2023-02-14 10:54:02,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:02,452 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 10:54:02,495 INFO L321 Elim1Store]: treesize reduction 124, result has 38.6 percent of original size [2023-02-14 10:54:02,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 123 treesize of output 125 [2023-02-14 10:54:02,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:02,509 INFO L321 Elim1Store]: treesize reduction 50, result has 18.0 percent of original size [2023-02-14 10:54:02,509 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 75 [2023-02-14 10:54:02,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:02,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2023-02-14 10:54:02,700 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-14 10:54:02,700 INFO L350 Elim1Store]: Elim1 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 339 treesize of output 268 [2023-02-14 10:54:02,710 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2023-02-14 10:54:02,711 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 316 treesize of output 209 [2023-02-14 10:54:04,274 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 10:54:04,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:04,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:04,315 INFO L321 Elim1Store]: treesize reduction 55, result has 43.3 percent of original size [2023-02-14 10:54:04,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 10 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 27 case distinctions, treesize of input 291 treesize of output 193 [2023-02-14 10:54:04,355 INFO L321 Elim1Store]: treesize reduction 37, result has 50.7 percent of original size [2023-02-14 10:54:04,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 8 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 156 treesize of output 119 [2023-02-14 10:54:05,021 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:54:05,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 10:54:05,534 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_list_add___list_add_~next#1.offset_11| Int) (v_ArrVal_2006 (Array Int Int)) (v_ArrVal_2005 (Array Int Int)) (v_ArrVal_2035 Int) (v_ArrVal_2036 (Array Int Int)) (v_ArrVal_2034 (Array Int Int)) (v_ArrVal_2033 (Array Int Int)) (v_ArrVal_2032 (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)) (.cse7 (+ |v_list_add___list_add_~next#1.offset_11| 4))) (let ((.cse1 (store (let ((.cse8 (store |c_#memory_$Pointer$.offset| .cse6 (store (select |c_#memory_$Pointer$.offset| .cse6) .cse7 (+ |c_ULTIMATE.start_gl_insert_~node~1#1.offset| 4))))) (store (store .cse8 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2036) |c_~#gl_list~0.base| (store (select (store .cse8 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2032) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_2035))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2006)) (.cse3 (store (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse6 (store (select |c_#memory_$Pointer$.base| .cse6) .cse7 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)))) (store (store .cse5 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2033) |c_~#gl_list~0.base| (store (select (store .cse5 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2034) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base|))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2005)) (.cse4 (+ |c_~#gl_list~0.offset| 4))) (let ((.cse2 (select (select .cse3 |c_~#gl_list~0.base|) .cse4)) (.cse0 (select (select .cse1 |c_~#gl_list~0.base|) .cse4))) (or (not (= .cse0 (select (select .cse1 .cse2) .cse0))) (not (= .cse2 (select (select .cse3 .cse2) .cse0)))))))) is different from false [2023-02-14 10:54:05,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237037937] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 10:54:05,536 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 10:54:05,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 30 [2023-02-14 10:54:05,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316242292] [2023-02-14 10:54:05,536 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 10:54:05,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-02-14 10:54:05,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 10:54:05,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-02-14 10:54:05,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1197, Unknown=24, NotChecked=70, Total=1406 [2023-02-14 10:54:05,537 INFO L87 Difference]: Start difference. First operand 277 states and 326 transitions. Second operand has 31 states, 31 states have (on average 2.5483870967741935) internal successors, (79), 21 states have internal predecessors, (79), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-14 10:54:11,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:54:11,685 INFO L93 Difference]: Finished difference Result 447 states and 523 transitions. [2023-02-14 10:54:11,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-14 10:54:11,685 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.5483870967741935) internal successors, (79), 21 states have internal predecessors, (79), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 46 [2023-02-14 10:54:11,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:54:11,687 INFO L225 Difference]: With dead ends: 447 [2023-02-14 10:54:11,687 INFO L226 Difference]: Without dead ends: 444 [2023-02-14 10:54:11,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=340, Invalid=2716, Unknown=28, NotChecked=108, Total=3192 [2023-02-14 10:54:11,688 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 1129 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 3938 mSolverCounterSat, 162 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1129 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 4112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 3938 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-02-14 10:54:11,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1129 Valid, 846 Invalid, 4112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 3938 Invalid, 12 Unknown, 0 Unchecked, 3.3s Time] [2023-02-14 10:54:11,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2023-02-14 10:54:11,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 385. [2023-02-14 10:54:11,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 339 states have (on average 1.1858407079646018) internal successors, (402), 355 states have internal predecessors, (402), 35 states have call successors, (35), 14 states have call predecessors, (35), 10 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-02-14 10:54:11,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 452 transitions. [2023-02-14 10:54:11,747 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 452 transitions. Word has length 46 [2023-02-14 10:54:11,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:54:11,748 INFO L495 AbstractCegarLoop]: Abstraction has 385 states and 452 transitions. [2023-02-14 10:54:11,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.5483870967741935) internal successors, (79), 21 states have internal predecessors, (79), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-14 10:54:11,748 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 452 transitions. [2023-02-14 10:54:11,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-14 10:54:11,748 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:54:11,749 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:54:11,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-14 10:54:11,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 10:54:11,955 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:54:11,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:54:11,956 INFO L85 PathProgramCache]: Analyzing trace with hash -2049301828, now seen corresponding path program 1 times [2023-02-14 10:54:11,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:54:11,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347278009] [2023-02-14 10:54:11,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:54:11,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:54:11,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:54:11,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-14 10:54:12,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:54:12,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:54:12,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 10:54:12,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347278009] [2023-02-14 10:54:12,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347278009] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 10:54:12,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 10:54:12,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 10:54:12,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660217194] [2023-02-14 10:54:12,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 10:54:12,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 10:54:12,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 10:54:12,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 10:54:12,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-14 10:54:12,007 INFO L87 Difference]: Start difference. First operand 385 states and 452 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 10:54:12,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:54:12,258 INFO L93 Difference]: Finished difference Result 387 states and 453 transitions. [2023-02-14 10:54:12,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-14 10:54:12,259 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2023-02-14 10:54:12,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:54:12,260 INFO L225 Difference]: With dead ends: 387 [2023-02-14 10:54:12,260 INFO L226 Difference]: Without dead ends: 384 [2023-02-14 10:54:12,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-02-14 10:54:12,261 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 106 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 10:54:12,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 174 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 10:54:12,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2023-02-14 10:54:12,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2023-02-14 10:54:12,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 339 states have (on average 1.1740412979351031) internal successors, (398), 354 states have internal predecessors, (398), 34 states have call successors, (34), 14 states have call predecessors, (34), 10 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-02-14 10:54:12,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 447 transitions. [2023-02-14 10:54:12,320 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 447 transitions. Word has length 48 [2023-02-14 10:54:12,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:54:12,320 INFO L495 AbstractCegarLoop]: Abstraction has 384 states and 447 transitions. [2023-02-14 10:54:12,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 10:54:12,320 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 447 transitions. [2023-02-14 10:54:12,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-14 10:54:12,321 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:54:12,321 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:54:12,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-14 10:54:12,321 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:54:12,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:54:12,321 INFO L85 PathProgramCache]: Analyzing trace with hash -764602366, now seen corresponding path program 1 times [2023-02-14 10:54:12,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:54:12,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543462647] [2023-02-14 10:54:12,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:54:12,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:54:12,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:54:13,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-14 10:54:13,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:54:14,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-14 10:54:14,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:54:14,221 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 10:54:14,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 10:54:14,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543462647] [2023-02-14 10:54:14,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543462647] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 10:54:14,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092528882] [2023-02-14 10:54:14,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:54:14,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 10:54:14,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 10:54:14,223 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) [2023-02-14 10:54:14,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-14 10:54:14,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:54:14,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 178 conjunts are in the unsatisfiable core [2023-02-14 10:54:14,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 10:54:14,482 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-14 10:54:14,482 INFO L350 Elim1Store]: Elim1 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 17 treesize of output 21 [2023-02-14 10:54:14,542 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2023-02-14 10:54:14,549 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-14 10:54:14,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:14,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 17 treesize of output 7 [2023-02-14 10:54:14,568 INFO L350 Elim1Store]: Elim1 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 9 treesize of output 3 [2023-02-14 10:54:14,713 INFO L321 Elim1Store]: treesize reduction 73, result has 3.9 percent of original size [2023-02-14 10:54:14,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 101 treesize of output 116 [2023-02-14 10:54:14,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:14,739 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2023-02-14 10:54:14,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 92 treesize of output 94 [2023-02-14 10:54:14,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 40 treesize of output 54 [2023-02-14 10:54:14,774 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-14 10:54:14,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 58 [2023-02-14 10:54:17,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:17,051 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 113 [2023-02-14 10:54:17,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:17,057 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 85 [2023-02-14 10:54:17,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:17,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 78 treesize of output 82 [2023-02-14 10:54:17,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:17,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 79 treesize of output 85 [2023-02-14 10:54:17,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:17,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 76 treesize of output 80 [2023-02-14 10:54:17,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:17,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 69 treesize of output 73 [2023-02-14 10:54:17,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 treesize of output 5 [2023-02-14 10:54:17,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 23 treesize of output 17 [2023-02-14 10:54:17,145 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2023-02-14 10:54:17,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2023-02-14 10:54:17,308 INFO L321 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2023-02-14 10:54:17,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 102 treesize of output 98 [2023-02-14 10:54:17,409 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 80 [2023-02-14 10:54:17,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 76 [2023-02-14 10:54:17,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:17,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 17 treesize of output 7 [2023-02-14 10:54:17,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:17,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 18 treesize of output 8 [2023-02-14 10:54:17,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:17,606 INFO L321 Elim1Store]: treesize reduction 70, result has 19.5 percent of original size [2023-02-14 10:54:17,606 INFO L350 Elim1Store]: Elim1 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 174 treesize of output 126 [2023-02-14 10:54:17,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:17,621 INFO L321 Elim1Store]: treesize reduction 42, result has 10.6 percent of original size [2023-02-14 10:54:17,621 INFO L350 Elim1Store]: Elim1 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 144 treesize of output 131 [2023-02-14 10:54:17,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:17,626 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 120 treesize of output 106 [2023-02-14 10:54:17,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:17,642 INFO L321 Elim1Store]: treesize reduction 34, result has 24.4 percent of original size [2023-02-14 10:54:17,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 117 treesize of output 150 [2023-02-14 10:54:17,650 INFO L350 Elim1Store]: Elim1 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 8 treesize of output 7 [2023-02-14 10:54:17,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:17,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 73 treesize of output 67 [2023-02-14 10:54:17,914 INFO L321 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2023-02-14 10:54:17,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 231 treesize of output 228 [2023-02-14 10:54:17,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:17,957 INFO L321 Elim1Store]: treesize reduction 92, result has 24.0 percent of original size [2023-02-14 10:54:17,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 270 treesize of output 252 [2023-02-14 10:54:17,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2023-02-14 10:54:17,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2023-02-14 10:54:18,812 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 22 treesize of output 10 [2023-02-14 10:54:18,897 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-14 10:54:18,898 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 25 [2023-02-14 10:54:18,930 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:54:18,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 10:54:19,193 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#gl_list~0.offset| 4))) (and (forall ((v_ArrVal_2488 (Array Int Int)) (v_ArrVal_2487 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2488))) (let ((.cse0 (select (select .cse1 |c_~#gl_list~0.base|) .cse2))) (or (= .cse0 |c_~#gl_list~0.base|) (not (= .cse0 (select (select .cse1 .cse0) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2487) |c_~#gl_list~0.base|) .cse2) 4)))))))) (forall ((v_ArrVal_2488 (Array Int Int)) (v_ArrVal_2487 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2487) |c_~#gl_list~0.base|) .cse2))) (or (= |c_~#gl_list~0.offset| .cse3) (not (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2488))) (let ((.cse4 (select (select .cse5 |c_~#gl_list~0.base|) .cse2))) (= .cse4 (select (select .cse5 .cse4) (+ .cse3 4))))))))))) is different from false [2023-02-14 10:54:19,358 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (let ((.cse6 (+ |c_ULTIMATE.start_gl_insert_~node~1#1.offset| 4)) (.cse3 (+ |c_~#gl_list~0.offset| 4)) (.cse4 (store |c_#memory_$Pointer$.base| .cse5 (store (select |c_#memory_$Pointer$.base| .cse5) (+ (select (select |c_#memory_$Pointer$.offset| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|) 4) |c_ULTIMATE.start_gl_insert_~node~1#1.base|)))) (and (forall ((v_ArrVal_2517 (Array Int Int)) (v_ArrVal_2516 (Array Int Int)) (v_ArrVal_2515 (Array Int Int)) (v_ArrVal_2513 (Array Int Int)) (v_ArrVal_2512 (Array Int Int)) (v_ArrVal_2488 (Array Int Int)) (v_ArrVal_2487 (Array Int Int)) (v_ArrVal_2514 Int) (v_ArrVal_2518 (Array Int Int))) (let ((.cse0 (select (select (store (store (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_2518) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2515) |c_~#gl_list~0.base| (store (select (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_2516) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2512) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| .cse6)) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2487) |c_~#gl_list~0.base|) .cse3))) (or (= |c_~#gl_list~0.offset| .cse0) (not (let ((.cse1 (store (store (store .cse4 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2513) |c_~#gl_list~0.base| (store (select (store .cse4 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2517) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_2514)) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2488))) (let ((.cse2 (select (select .cse1 |c_~#gl_list~0.base|) .cse3))) (= (select (select .cse1 .cse2) (+ .cse0 4)) .cse2))))))) (forall ((v_ArrVal_2517 (Array Int Int)) (v_ArrVal_2516 (Array Int Int)) (v_ArrVal_2515 (Array Int Int)) (v_ArrVal_2513 (Array Int Int)) (v_ArrVal_2512 (Array Int Int)) (v_ArrVal_2488 (Array Int Int)) (v_ArrVal_2487 (Array Int Int)) (v_ArrVal_2514 Int) (v_ArrVal_2518 (Array Int Int))) (let ((.cse8 (store (store (store .cse4 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2513) |c_~#gl_list~0.base| (store (select (store .cse4 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2517) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_2514)) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2488))) (let ((.cse7 (select (select .cse8 |c_~#gl_list~0.base|) .cse3))) (or (= .cse7 |c_~#gl_list~0.base|) (not (= (select (select .cse8 .cse7) (+ (select (select (store (store (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_2518) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2515) |c_~#gl_list~0.base| (store (select (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_2516) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2512) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| .cse6)) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2487) |c_~#gl_list~0.base|) .cse3) 4)) .cse7))))))))) is different from false [2023-02-14 10:54:19,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092528882] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 10:54:19,360 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 10:54:19,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 32 [2023-02-14 10:54:19,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470984570] [2023-02-14 10:54:19,360 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 10:54:19,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-02-14 10:54:19,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 10:54:19,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-02-14 10:54:19,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1442, Unknown=6, NotChecked=154, Total=1722 [2023-02-14 10:54:19,362 INFO L87 Difference]: Start difference. First operand 384 states and 447 transitions. Second operand has 33 states, 33 states have (on average 2.5757575757575757) internal successors, (85), 23 states have internal predecessors, (85), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-14 10:54:23,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:54:23,742 INFO L93 Difference]: Finished difference Result 443 states and 512 transitions. [2023-02-14 10:54:23,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-14 10:54:23,742 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.5757575757575757) internal successors, (85), 23 states have internal predecessors, (85), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 49 [2023-02-14 10:54:23,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:54:23,744 INFO L225 Difference]: With dead ends: 443 [2023-02-14 10:54:23,744 INFO L226 Difference]: Without dead ends: 440 [2023-02-14 10:54:23,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=292, Invalid=2902, Unknown=6, NotChecked=222, Total=3422 [2023-02-14 10:54:23,745 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 848 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 3750 mSolverCounterSat, 128 mSolverCounterUnsat, 92 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 3970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 3750 IncrementalHoareTripleChecker+Invalid, 92 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-02-14 10:54:23,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 880 Invalid, 3970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 3750 Invalid, 92 Unknown, 0 Unchecked, 2.9s Time] [2023-02-14 10:54:23,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2023-02-14 10:54:23,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 387. [2023-02-14 10:54:23,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 342 states have (on average 1.1695906432748537) internal successors, (400), 357 states have internal predecessors, (400), 34 states have call successors, (34), 14 states have call predecessors, (34), 10 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-02-14 10:54:23,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 449 transitions. [2023-02-14 10:54:23,808 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 449 transitions. Word has length 49 [2023-02-14 10:54:23,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:54:23,808 INFO L495 AbstractCegarLoop]: Abstraction has 387 states and 449 transitions. [2023-02-14 10:54:23,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.5757575757575757) internal successors, (85), 23 states have internal predecessors, (85), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-14 10:54:23,808 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 449 transitions. [2023-02-14 10:54:23,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-14 10:54:23,809 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:54:23,809 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:54:23,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-02-14 10:54:24,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-02-14 10:54:24,015 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:54:24,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:54:24,015 INFO L85 PathProgramCache]: Analyzing trace with hash 2059695343, now seen corresponding path program 1 times [2023-02-14 10:54:24,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:54:24,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800730350] [2023-02-14 10:54:24,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:54:24,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:54:24,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:54:24,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-14 10:54:24,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:54:24,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:54:24,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 10:54:24,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800730350] [2023-02-14 10:54:24,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800730350] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 10:54:24,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 10:54:24,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-14 10:54:24,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115432335] [2023-02-14 10:54:24,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 10:54:24,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-14 10:54:24,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 10:54:24,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-14 10:54:24,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-02-14 10:54:24,152 INFO L87 Difference]: Start difference. First operand 387 states and 449 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 10:54:24,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:54:24,609 INFO L93 Difference]: Finished difference Result 389 states and 450 transitions. [2023-02-14 10:54:24,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-14 10:54:24,610 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2023-02-14 10:54:24,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:54:24,611 INFO L225 Difference]: With dead ends: 389 [2023-02-14 10:54:24,611 INFO L226 Difference]: Without dead ends: 386 [2023-02-14 10:54:24,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2023-02-14 10:54:24,612 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 163 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-14 10:54:24,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 306 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-14 10:54:24,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2023-02-14 10:54:24,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2023-02-14 10:54:24,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 342 states have (on average 1.1578947368421053) internal successors, (396), 356 states have internal predecessors, (396), 33 states have call successors, (33), 14 states have call predecessors, (33), 10 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-02-14 10:54:24,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 444 transitions. [2023-02-14 10:54:24,679 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 444 transitions. Word has length 51 [2023-02-14 10:54:24,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:54:24,679 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 444 transitions. [2023-02-14 10:54:24,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 10:54:24,680 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 444 transitions. [2023-02-14 10:54:24,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-14 10:54:24,680 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:54:24,680 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:54:24,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-14 10:54:24,680 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:54:24,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:54:24,681 INFO L85 PathProgramCache]: Analyzing trace with hash 2029277591, now seen corresponding path program 1 times [2023-02-14 10:54:24,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:54:24,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838083957] [2023-02-14 10:54:24,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:54:24,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:54:24,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:54:25,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-14 10:54:25,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:54:25,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-14 10:54:25,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:54:25,958 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 10:54:25,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 10:54:25,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838083957] [2023-02-14 10:54:25,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838083957] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 10:54:25,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64186177] [2023-02-14 10:54:25,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:54:25,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 10:54:25,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 10:54:25,962 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) [2023-02-14 10:54:25,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-14 10:54:26,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:54:26,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 132 conjunts are in the unsatisfiable core [2023-02-14 10:54:26,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 10:54:26,274 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-14 10:54:26,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-14 10:54:26,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 10:54:26,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 10:54:26,360 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2023-02-14 10:54:26,362 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2023-02-14 10:54:26,457 INFO L321 Elim1Store]: treesize reduction 77, result has 3.8 percent of original size [2023-02-14 10:54:26,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 54 treesize of output 68 [2023-02-14 10:54:26,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:26,462 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 30 [2023-02-14 10:54:26,465 INFO L350 Elim1Store]: Elim1 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 25 treesize of output 17 [2023-02-14 10:54:26,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:26,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2023-02-14 10:54:26,517 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 10:54:26,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 37 [2023-02-14 10:54:26,591 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 10:54:26,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2023-02-14 10:54:26,658 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2023-02-14 10:54:26,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:26,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 30 treesize of output 12 [2023-02-14 10:54:26,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:26,769 INFO L321 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2023-02-14 10:54:26,769 INFO L350 Elim1Store]: Elim1 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 83 treesize of output 57 [2023-02-14 10:54:26,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:26,785 INFO L321 Elim1Store]: treesize reduction 38, result has 19.1 percent of original size [2023-02-14 10:54:26,785 INFO L350 Elim1Store]: Elim1 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 57 treesize of output 56 [2023-02-14 10:54:26,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:26,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 43 treesize of output 37 [2023-02-14 10:54:26,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 treesize of output 3 [2023-02-14 10:54:26,856 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-02-14 10:54:26,856 INFO L350 Elim1Store]: Elim1 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 52 treesize of output 58 [2023-02-14 10:54:27,015 INFO L350 Elim1Store]: Elim1 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 24 treesize of output 12 [2023-02-14 10:54:27,018 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2023-02-14 10:54:27,065 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:54:27,066 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 10:54:27,132 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 7 [2023-02-14 10:54:27,198 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2949 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2949) |c_~#gl_list~0.base|) (+ |c_~#gl_list~0.offset| 4)) 0))) is different from false [2023-02-14 10:54:27,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64186177] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 10:54:27,340 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 10:54:27,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 30 [2023-02-14 10:54:27,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239842992] [2023-02-14 10:54:27,340 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 10:54:27,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-02-14 10:54:27,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 10:54:27,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-02-14 10:54:27,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1129, Unknown=8, NotChecked=68, Total=1332 [2023-02-14 10:54:27,342 INFO L87 Difference]: Start difference. First operand 386 states and 444 transitions. Second operand has 31 states, 31 states have (on average 2.935483870967742) internal successors, (91), 21 states have internal predecessors, (91), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-14 10:54:30,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:54:30,276 INFO L93 Difference]: Finished difference Result 445 states and 509 transitions. [2023-02-14 10:54:30,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-14 10:54:30,288 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.935483870967742) internal successors, (91), 21 states have internal predecessors, (91), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 52 [2023-02-14 10:54:30,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:54:30,289 INFO L225 Difference]: With dead ends: 445 [2023-02-14 10:54:30,290 INFO L226 Difference]: Without dead ends: 442 [2023-02-14 10:54:30,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 846 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=448, Invalid=2958, Unknown=20, NotChecked=114, Total=3540 [2023-02-14 10:54:30,291 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 1137 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 2274 mSolverCounterSat, 175 mSolverCounterUnsat, 66 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1140 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 2515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 2274 IncrementalHoareTripleChecker+Invalid, 66 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-02-14 10:54:30,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1140 Valid, 534 Invalid, 2515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 2274 Invalid, 66 Unknown, 0 Unchecked, 1.7s Time] [2023-02-14 10:54:30,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2023-02-14 10:54:30,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 395. [2023-02-14 10:54:30,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 351 states have (on average 1.1538461538461537) internal successors, (405), 365 states have internal predecessors, (405), 33 states have call successors, (33), 14 states have call predecessors, (33), 10 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-02-14 10:54:30,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 453 transitions. [2023-02-14 10:54:30,362 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 453 transitions. Word has length 52 [2023-02-14 10:54:30,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:54:30,362 INFO L495 AbstractCegarLoop]: Abstraction has 395 states and 453 transitions. [2023-02-14 10:54:30,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.935483870967742) internal successors, (91), 21 states have internal predecessors, (91), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-14 10:54:30,363 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 453 transitions. [2023-02-14 10:54:30,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-14 10:54:30,363 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:54:30,363 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:54:30,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-14 10:54:30,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-02-14 10:54:30,565 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:54:30,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:54:30,565 INFO L85 PathProgramCache]: Analyzing trace with hash -617053959, now seen corresponding path program 1 times [2023-02-14 10:54:30,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:54:30,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846906347] [2023-02-14 10:54:30,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:54:30,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:54:30,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:54:30,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-14 10:54:30,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:54:30,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:54:30,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 10:54:30,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846906347] [2023-02-14 10:54:30,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846906347] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 10:54:30,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 10:54:30,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 10:54:30,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885908754] [2023-02-14 10:54:30,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 10:54:30,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 10:54:30,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 10:54:30,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 10:54:30,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 10:54:30,617 INFO L87 Difference]: Start difference. First operand 395 states and 453 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 10:54:30,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:54:30,889 INFO L93 Difference]: Finished difference Result 397 states and 454 transitions. [2023-02-14 10:54:30,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 10:54:30,889 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2023-02-14 10:54:30,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:54:30,890 INFO L225 Difference]: With dead ends: 397 [2023-02-14 10:54:30,891 INFO L226 Difference]: Without dead ends: 394 [2023-02-14 10:54:30,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-14 10:54:30,891 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 92 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 10:54:30,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 108 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 10:54:30,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2023-02-14 10:54:30,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2023-02-14 10:54:30,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 351 states have (on average 1.1424501424501425) internal successors, (401), 364 states have internal predecessors, (401), 32 states have call successors, (32), 14 states have call predecessors, (32), 10 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-02-14 10:54:30,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 448 transitions. [2023-02-14 10:54:30,956 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 448 transitions. Word has length 53 [2023-02-14 10:54:30,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:54:30,956 INFO L495 AbstractCegarLoop]: Abstraction has 394 states and 448 transitions. [2023-02-14 10:54:30,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 10:54:30,956 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 448 transitions. [2023-02-14 10:54:30,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-02-14 10:54:30,957 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:54:30,957 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:54:30,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-02-14 10:54:30,957 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:54:30,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:54:30,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1943731347, now seen corresponding path program 1 times [2023-02-14 10:54:30,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:54:30,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570028086] [2023-02-14 10:54:30,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:54:30,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:54:31,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:54:32,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-14 10:54:32,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:54:32,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-14 10:54:32,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:54:32,852 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 10:54:32,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 10:54:32,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570028086] [2023-02-14 10:54:32,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570028086] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 10:54:32,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908041225] [2023-02-14 10:54:32,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:54:32,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 10:54:32,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 10:54:32,854 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) [2023-02-14 10:54:32,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-14 10:54:33,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:54:33,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 196 conjunts are in the unsatisfiable core [2023-02-14 10:54:33,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 10:54:33,145 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-14 10:54:33,145 INFO L350 Elim1Store]: Elim1 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 17 treesize of output 21 [2023-02-14 10:54:33,205 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-14 10:54:33,210 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2023-02-14 10:54:33,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:33,220 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 17 treesize of output 7 [2023-02-14 10:54:33,226 INFO L350 Elim1Store]: Elim1 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 9 treesize of output 3 [2023-02-14 10:54:33,391 INFO L321 Elim1Store]: treesize reduction 73, result has 3.9 percent of original size [2023-02-14 10:54:33,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 116 treesize of output 120 [2023-02-14 10:54:33,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:33,417 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2023-02-14 10:54:33,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 96 treesize of output 100 [2023-02-14 10:54:33,431 INFO L321 Elim1Store]: treesize reduction 17, result has 43.3 percent of original size [2023-02-14 10:54:33,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 45 [2023-02-14 10:54:33,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:33,436 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 34 [2023-02-14 10:54:33,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:33,440 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 38 [2023-02-14 10:54:33,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:33,457 INFO L321 Elim1Store]: treesize reduction 30, result has 40.0 percent of original size [2023-02-14 10:54:33,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 55 [2023-02-14 10:54:33,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:33,473 INFO L321 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2023-02-14 10:54:33,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 29 treesize of output 44 [2023-02-14 10:54:33,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:33,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:33,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:33,587 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 84 [2023-02-14 10:54:33,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:33,591 INFO L350 Elim1Store]: Elim1 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 73 treesize of output 73 [2023-02-14 10:54:33,758 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-02-14 10:54:33,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-02-14 10:54:33,858 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-14 10:54:33,858 INFO L350 Elim1Store]: Elim1 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 103 treesize of output 95 [2023-02-14 10:54:33,864 INFO L350 Elim1Store]: Elim1 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 79 treesize of output 74 [2023-02-14 10:54:33,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:33,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:33,891 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 10:54:33,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 52 [2023-02-14 10:54:33,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:33,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 49 treesize of output 25 [2023-02-14 10:54:34,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:34,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:34,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:34,076 INFO L321 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2023-02-14 10:54:34,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 192 treesize of output 135 [2023-02-14 10:54:34,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:34,091 INFO L321 Elim1Store]: treesize reduction 42, result has 10.6 percent of original size [2023-02-14 10:54:34,091 INFO L350 Elim1Store]: Elim1 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 2 case distinctions, treesize of input 165 treesize of output 141 [2023-02-14 10:54:34,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:34,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:34,096 INFO L350 Elim1Store]: Elim1 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 108 treesize of output 87 [2023-02-14 10:54:34,100 INFO L350 Elim1Store]: Elim1 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 82 treesize of output 76 [2023-02-14 10:54:34,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:34,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 53 treesize of output 51 [2023-02-14 10:54:34,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:34,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 58 treesize of output 54 [2023-02-14 10:54:34,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:34,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:34,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 25 treesize of output 42 [2023-02-14 10:54:34,306 INFO L321 Elim1Store]: treesize reduction 76, result has 31.5 percent of original size [2023-02-14 10:54:34,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 5 case distinctions, treesize of input 197 treesize of output 193 [2023-02-14 10:54:34,331 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2023-02-14 10:54:34,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 5 case distinctions, treesize of input 188 treesize of output 180 [2023-02-14 10:54:34,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2023-02-14 10:54:34,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2023-02-14 10:54:36,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:36,061 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 10:54:36,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:36,064 INFO L321 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2023-02-14 10:54:36,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 102 treesize of output 51 [2023-02-14 10:54:36,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:36,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:36,072 INFO L321 Elim1Store]: treesize reduction 24, result has 11.1 percent of original size [2023-02-14 10:54:36,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 27 [2023-02-14 10:54:36,105 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:54:36,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 10:54:36,386 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_~#gl_list~0.offset| 4))) (and (forall ((v_ArrVal_3421 (Array Int Int)) (v_ArrVal_3422 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3421) |c_~#gl_list~0.base|) .cse3))) (or (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3422))) (let ((.cse0 (+ (select (select .cse1 |c_~#gl_list~0.base|) .cse3) 8))) (= .cse0 (select (select .cse1 .cse2) .cse0)))) (= .cse2 |c_~#gl_list~0.base|)))) (forall ((v_ArrVal_3421 (Array Int Int)) (v_ArrVal_3422 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3422))) (let ((.cse6 (select (select .cse5 |c_~#gl_list~0.base|) .cse3))) (or (let ((.cse4 (+ .cse6 8))) (= .cse4 (select (select .cse5 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3421) |c_~#gl_list~0.base|) .cse3)) .cse4))) (= |c_~#gl_list~0.offset| .cse6))))) (forall ((v_ArrVal_3421 (Array Int Int)) (v_ArrVal_3422 (Array Int Int))) (let ((.cse9 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3422) |c_~#gl_list~0.base|) .cse3))) (or (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3421))) (let ((.cse7 (select (select .cse8 |c_~#gl_list~0.base|) .cse3))) (= .cse7 (select (select .cse8 .cse7) (+ .cse9 8))))) (= |c_~#gl_list~0.offset| .cse9)))) (forall ((v_ArrVal_3421 (Array Int Int)) (v_ArrVal_3422 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3421))) (let ((.cse10 (select (select .cse11 |c_~#gl_list~0.base|) .cse3))) (or (= .cse10 |c_~#gl_list~0.base|) (= .cse10 (select (select .cse11 .cse10) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3422) |c_~#gl_list~0.base|) .cse3) 8))))))))) is different from false [2023-02-14 10:54:36,681 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (let ((.cse8 (select |c_#memory_$Pointer$.offset| .cse5)) (.cse9 (+ |c_ULTIMATE.start_gl_insert_~node~1#1.offset| 4)) (.cse6 (select |c_#memory_$Pointer$.base| .cse5)) (.cse3 (+ |c_~#gl_list~0.offset| 4)) (.cse10 (select (select |c_#memory_$Pointer$.offset| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (and (forall ((|v_list_add___list_add_~next#1.offset_20| Int)) (or (forall ((v_ArrVal_3450 (Array Int Int)) (v_ArrVal_3451 (Array Int Int)) (v_ArrVal_3452 (Array Int Int)) (v_ArrVal_3447 Int) (v_ArrVal_3421 (Array Int Int)) (v_ArrVal_3422 (Array Int Int)) (v_ArrVal_3448 (Array Int Int)) (v_ArrVal_3449 (Array Int Int))) (let ((.cse7 (+ |v_list_add___list_add_~next#1.offset_20| 4))) (let ((.cse2 (select (select (store (store (store (store |c_#memory_$Pointer$.offset| .cse5 (store .cse8 .cse7 .cse9)) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3450) |c_~#gl_list~0.base| (store (select (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_3451) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3449) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| .cse9)) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3422) |c_~#gl_list~0.base|) .cse3))) (or (let ((.cse1 (store (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse5 (store .cse6 .cse7 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)))) (store (store .cse4 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3448) |c_~#gl_list~0.base| (store (select (store .cse4 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3452) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_3447))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3421))) (let ((.cse0 (select (select .cse1 |c_~#gl_list~0.base|) .cse3))) (= .cse0 (select (select .cse1 .cse0) (+ .cse2 8))))) (= |c_~#gl_list~0.offset| .cse2))))) (< .cse10 |v_list_add___list_add_~next#1.offset_20|))) (forall ((|v_list_add___list_add_~next#1.offset_20| Int)) (or (forall ((v_ArrVal_3450 (Array Int Int)) (v_ArrVal_3451 (Array Int Int)) (v_ArrVal_3452 (Array Int Int)) (v_ArrVal_3447 Int) (v_ArrVal_3421 (Array Int Int)) (v_ArrVal_3422 (Array Int Int)) (v_ArrVal_3448 (Array Int Int)) (v_ArrVal_3449 (Array Int Int))) (let ((.cse13 (+ |v_list_add___list_add_~next#1.offset_20| 4))) (let ((.cse12 (store (let ((.cse14 (store |c_#memory_$Pointer$.base| .cse5 (store .cse6 .cse13 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)))) (store (store .cse14 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3448) |c_~#gl_list~0.base| (store (select (store .cse14 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3452) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_3447))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3421))) (let ((.cse11 (select (select .cse12 |c_~#gl_list~0.base|) .cse3))) (or (= .cse11 (select (select .cse12 .cse11) (+ (select (select (store (store (store (store |c_#memory_$Pointer$.offset| .cse5 (store .cse8 .cse13 .cse9)) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3450) |c_~#gl_list~0.base| (store (select (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_3451) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3449) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| .cse9)) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3422) |c_~#gl_list~0.base|) .cse3) 8))) (= .cse11 |c_~#gl_list~0.base|)))))) (< .cse10 |v_list_add___list_add_~next#1.offset_20|))) (forall ((|v_list_add___list_add_~next#1.offset_20| Int)) (or (forall ((v_ArrVal_3450 (Array Int Int)) (v_ArrVal_3451 (Array Int Int)) (v_ArrVal_3452 (Array Int Int)) (v_ArrVal_3447 Int) (v_ArrVal_3421 (Array Int Int)) (v_ArrVal_3422 (Array Int Int)) (v_ArrVal_3448 (Array Int Int)) (v_ArrVal_3449 (Array Int Int))) (let ((.cse17 (+ |v_list_add___list_add_~next#1.offset_20| 4))) (let ((.cse15 (store (store (store (store |c_#memory_$Pointer$.offset| .cse5 (store .cse8 .cse17 .cse9)) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3450) |c_~#gl_list~0.base| (store (select (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_3451) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3449) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| .cse9)) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3422))) (let ((.cse19 (select (select .cse15 |c_~#gl_list~0.base|) .cse3))) (or (let ((.cse18 (+ .cse19 8))) (= (select (select .cse15 (select (select (store (let ((.cse16 (store |c_#memory_$Pointer$.base| .cse5 (store .cse6 .cse17 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)))) (store (store .cse16 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3448) |c_~#gl_list~0.base| (store (select (store .cse16 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3452) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_3447))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3421) |c_~#gl_list~0.base|) .cse3)) .cse18) .cse18)) (= |c_~#gl_list~0.offset| .cse19)))))) (< .cse10 |v_list_add___list_add_~next#1.offset_20|))) (forall ((|v_list_add___list_add_~next#1.offset_20| Int)) (or (forall ((v_ArrVal_3450 (Array Int Int)) (v_ArrVal_3451 (Array Int Int)) (v_ArrVal_3452 (Array Int Int)) (v_ArrVal_3447 Int) (v_ArrVal_3421 (Array Int Int)) (v_ArrVal_3422 (Array Int Int)) (v_ArrVal_3448 (Array Int Int)) (v_ArrVal_3449 (Array Int Int))) (let ((.cse23 (+ |v_list_add___list_add_~next#1.offset_20| 4))) (let ((.cse21 (select (select (store (let ((.cse24 (store |c_#memory_$Pointer$.base| .cse5 (store .cse6 .cse23 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)))) (store (store .cse24 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3448) |c_~#gl_list~0.base| (store (select (store .cse24 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3452) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_3447))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3421) |c_~#gl_list~0.base|) .cse3))) (or (let ((.cse20 (store (store (store (store |c_#memory_$Pointer$.offset| .cse5 (store .cse8 .cse23 .cse9)) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3450) |c_~#gl_list~0.base| (store (select (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_3451) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3449) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| .cse9)) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3422))) (let ((.cse22 (+ (select (select .cse20 |c_~#gl_list~0.base|) .cse3) 8))) (= (select (select .cse20 .cse21) .cse22) .cse22))) (= .cse21 |c_~#gl_list~0.base|))))) (< .cse10 |v_list_add___list_add_~next#1.offset_20|)))))) is different from false [2023-02-14 10:54:36,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908041225] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 10:54:36,686 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 10:54:36,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 34 [2023-02-14 10:54:36,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111923486] [2023-02-14 10:54:36,686 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 10:54:36,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-02-14 10:54:36,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 10:54:36,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-02-14 10:54:36,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1370, Unknown=4, NotChecked=150, Total=1640 [2023-02-14 10:54:36,687 INFO L87 Difference]: Start difference. First operand 394 states and 448 transitions. Second operand has 35 states, 35 states have (on average 2.7714285714285714) internal successors, (97), 25 states have internal predecessors, (97), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-14 10:54:43,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:54:43,002 INFO L93 Difference]: Finished difference Result 444 states and 500 transitions. [2023-02-14 10:54:43,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-02-14 10:54:43,002 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.7714285714285714) internal successors, (97), 25 states have internal predecessors, (97), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 55 [2023-02-14 10:54:43,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:54:43,004 INFO L225 Difference]: With dead ends: 444 [2023-02-14 10:54:43,004 INFO L226 Difference]: Without dead ends: 435 [2023-02-14 10:54:43,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 755 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=461, Invalid=3830, Unknown=7, NotChecked=258, Total=4556 [2023-02-14 10:54:43,005 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 988 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 4113 mSolverCounterSat, 108 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 988 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 4239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 4113 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2023-02-14 10:54:43,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [988 Valid, 937 Invalid, 4239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 4113 Invalid, 18 Unknown, 0 Unchecked, 3.5s Time] [2023-02-14 10:54:43,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2023-02-14 10:54:43,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 421. [2023-02-14 10:54:43,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 378 states have (on average 1.1322751322751323) internal successors, (428), 391 states have internal predecessors, (428), 32 states have call successors, (32), 14 states have call predecessors, (32), 10 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-02-14 10:54:43,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 475 transitions. [2023-02-14 10:54:43,090 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 475 transitions. Word has length 55 [2023-02-14 10:54:43,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:54:43,091 INFO L495 AbstractCegarLoop]: Abstraction has 421 states and 475 transitions. [2023-02-14 10:54:43,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.7714285714285714) internal successors, (97), 25 states have internal predecessors, (97), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-14 10:54:43,091 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 475 transitions. [2023-02-14 10:54:43,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-14 10:54:43,095 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:54:43,095 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:54:43,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-14 10:54:43,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 10:54:43,302 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:54:43,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:54:43,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1129884476, now seen corresponding path program 1 times [2023-02-14 10:54:43,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:54:43,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143012398] [2023-02-14 10:54:43,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:54:43,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:54:43,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:54:45,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-14 10:54:45,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:54:45,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-14 10:54:45,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:54:45,662 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 10:54:45,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 10:54:45,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143012398] [2023-02-14 10:54:45,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143012398] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 10:54:45,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851707089] [2023-02-14 10:54:45,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:54:45,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 10:54:45,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 10:54:45,663 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) [2023-02-14 10:54:45,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-14 10:54:45,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:54:45,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 201 conjunts are in the unsatisfiable core [2023-02-14 10:54:45,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 10:54:45,971 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-14 10:54:45,972 INFO L350 Elim1Store]: Elim1 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 17 treesize of output 21 [2023-02-14 10:54:46,028 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-14 10:54:46,032 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2023-02-14 10:54:46,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:46,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 17 treesize of output 7 [2023-02-14 10:54:46,056 INFO L350 Elim1Store]: Elim1 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 9 treesize of output 3 [2023-02-14 10:54:46,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:46,227 INFO L321 Elim1Store]: treesize reduction 44, result has 38.0 percent of original size [2023-02-14 10:54:46,228 INFO L350 Elim1Store]: Elim1 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 114 treesize of output 94 [2023-02-14 10:54:46,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 42 treesize of output 56 [2023-02-14 10:54:46,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:46,236 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 43 [2023-02-14 10:54:46,252 INFO L321 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2023-02-14 10:54:46,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 60 [2023-02-14 10:54:46,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:46,266 INFO L321 Elim1Store]: treesize reduction 30, result has 40.0 percent of original size [2023-02-14 10:54:46,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 55 [2023-02-14 10:54:48,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:48,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:48,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:48,478 INFO L321 Elim1Store]: treesize reduction 77, result has 10.5 percent of original size [2023-02-14 10:54:48,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 191 treesize of output 149 [2023-02-14 10:54:48,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:48,485 INFO L350 Elim1Store]: Elim1 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 104 treesize of output 98 [2023-02-14 10:54:48,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:48,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2023-02-14 10:54:48,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:48,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:48,510 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-14 10:54:48,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 38 [2023-02-14 10:54:48,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 23 [2023-02-14 10:54:48,705 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-02-14 10:54:48,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-02-14 10:54:48,790 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-14 10:54:48,790 INFO L350 Elim1Store]: Elim1 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 106 treesize of output 100 [2023-02-14 10:54:48,795 INFO L350 Elim1Store]: Elim1 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 75 treesize of output 74 [2023-02-14 10:54:48,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:48,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:48,820 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 10:54:48,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 92 treesize of output 59 [2023-02-14 10:54:48,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:48,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 25 [2023-02-14 10:54:48,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:49,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:49,020 INFO L321 Elim1Store]: treesize reduction 70, result has 25.5 percent of original size [2023-02-14 10:54:49,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 206 treesize of output 149 [2023-02-14 10:54:49,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:49,033 INFO L321 Elim1Store]: treesize reduction 42, result has 10.6 percent of original size [2023-02-14 10:54:49,034 INFO L350 Elim1Store]: Elim1 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 180 treesize of output 155 [2023-02-14 10:54:49,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:49,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 148 treesize of output 126 [2023-02-14 10:54:49,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:49,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:49,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 89 [2023-02-14 10:54:49,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:49,065 INFO L350 Elim1Store]: Elim1 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 91 treesize of output 81 [2023-02-14 10:54:49,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:49,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 59 treesize of output 53 [2023-02-14 10:54:49,218 INFO L321 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2023-02-14 10:54:49,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 165 treesize of output 158 [2023-02-14 10:54:49,237 INFO L321 Elim1Store]: treesize reduction 78, result has 21.2 percent of original size [2023-02-14 10:54:49,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 5 case distinctions, treesize of input 168 treesize of output 166 [2023-02-14 10:54:50,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:50,596 INFO L321 Elim1Store]: treesize reduction 16, result has 15.8 percent of original size [2023-02-14 10:54:50,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 24 [2023-02-14 10:54:50,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:50,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:50,602 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 10:54:50,606 INFO L321 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2023-02-14 10:54:50,606 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 28 [2023-02-14 10:54:50,649 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:54:50,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 10:54:50,942 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#gl_list~0.offset| 4))) (and (forall ((v_ArrVal_3816 (Array Int Int)) (v_ArrVal_3817 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3817))) (let ((.cse0 (select (select .cse1 |c_~#gl_list~0.base|) .cse2))) (or (= (+ .cse0 8) (select (select .cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3816) |c_~#gl_list~0.base|) .cse2)) (+ .cse0 12))) (= |c_~#gl_list~0.offset| .cse0))))) (forall ((v_ArrVal_3816 (Array Int Int)) (v_ArrVal_3817 (Array Int Int))) (let ((.cse5 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3816) |c_~#gl_list~0.base|) .cse2))) (or (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3817))) (let ((.cse3 (select (select .cse4 |c_~#gl_list~0.base|) .cse2))) (= (+ .cse3 8) (select (select .cse4 .cse5) (+ .cse3 12))))) (= .cse5 |c_~#gl_list~0.base|)))) (forall ((v_ArrVal_3816 (Array Int Int)) (v_ArrVal_3817 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3816))) (let ((.cse7 (select (select .cse6 |c_~#gl_list~0.base|) .cse2))) (or (= (select (select .cse6 .cse7) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3817) |c_~#gl_list~0.base|) .cse2) 12)) .cse7) (= .cse7 |c_~#gl_list~0.base|))))) (forall ((v_ArrVal_3816 (Array Int Int)) (v_ArrVal_3817 (Array Int Int))) (let ((.cse10 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3817) |c_~#gl_list~0.base|) .cse2))) (or (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3816))) (let ((.cse9 (select (select .cse8 |c_~#gl_list~0.base|) .cse2))) (= (select (select .cse8 .cse9) (+ .cse10 12)) .cse9))) (= |c_~#gl_list~0.offset| .cse10)))))) is different from false [2023-02-14 10:54:51,233 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)) (.cse10 (select |c_#memory_$Pointer$.base| .cse5)) (.cse6 (select |c_#memory_$Pointer$.offset| .cse5)) (.cse4 (+ |c_ULTIMATE.start_gl_insert_~node~1#1.offset| 4)) (.cse8 (+ |c_~#gl_list~0.offset| 4))) (and (forall ((|v_list_add___list_add_~next#1.offset_23| Int)) (or (< .cse0 |v_list_add___list_add_~next#1.offset_23|) (forall ((v_ArrVal_3816 (Array Int Int)) (v_ArrVal_3817 (Array Int Int)) (v_ArrVal_3844 Int) (v_ArrVal_3845 (Array Int Int)) (v_ArrVal_3846 (Array Int Int)) (v_ArrVal_3847 (Array Int Int)) (v_ArrVal_3848 (Array Int Int))) (let ((.cse7 (+ |v_list_add___list_add_~next#1.offset_23| 4))) (let ((.cse1 (store (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse5 (store .cse10 .cse7 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)))) (store (store .cse9 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3845) |c_~#gl_list~0.base| (store (select (store .cse9 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3848) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_3844))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3816))) (let ((.cse2 (select (select .cse1 |c_~#gl_list~0.base|) .cse8))) (or (= (select (select .cse1 .cse2) (+ (select (select (store (let ((.cse3 (store |c_#memory_$Pointer$.offset| .cse5 (store .cse6 .cse7 .cse4)))) (store (store .cse3 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3846) |c_~#gl_list~0.base| (store (select (store .cse3 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3847) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| .cse4))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3817) |c_~#gl_list~0.base|) .cse8) 12)) .cse2) (= .cse2 |c_~#gl_list~0.base|)))))))) (forall ((|v_list_add___list_add_~next#1.offset_23| Int)) (or (< .cse0 |v_list_add___list_add_~next#1.offset_23|) (forall ((v_ArrVal_3816 (Array Int Int)) (v_ArrVal_3817 (Array Int Int)) (v_ArrVal_3844 Int) (v_ArrVal_3845 (Array Int Int)) (v_ArrVal_3846 (Array Int Int)) (v_ArrVal_3847 (Array Int Int)) (v_ArrVal_3848 (Array Int Int))) (let ((.cse14 (+ |v_list_add___list_add_~next#1.offset_23| 4))) (let ((.cse12 (store (let ((.cse15 (store |c_#memory_$Pointer$.offset| .cse5 (store .cse6 .cse14 .cse4)))) (store (store .cse15 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3846) |c_~#gl_list~0.base| (store (select (store .cse15 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3847) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| .cse4))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3817))) (let ((.cse11 (select (select .cse12 |c_~#gl_list~0.base|) .cse8))) (or (= |c_~#gl_list~0.offset| .cse11) (= (select (select .cse12 (select (select (store (let ((.cse13 (store |c_#memory_$Pointer$.base| .cse5 (store .cse10 .cse14 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)))) (store (store .cse13 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3845) |c_~#gl_list~0.base| (store (select (store .cse13 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3848) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_3844))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3816) |c_~#gl_list~0.base|) .cse8)) (+ .cse11 12)) (+ .cse11 8))))))))) (forall ((|v_list_add___list_add_~next#1.offset_23| Int)) (or (< .cse0 |v_list_add___list_add_~next#1.offset_23|) (forall ((v_ArrVal_3816 (Array Int Int)) (v_ArrVal_3817 (Array Int Int)) (v_ArrVal_3844 Int) (v_ArrVal_3845 (Array Int Int)) (v_ArrVal_3846 (Array Int Int)) (v_ArrVal_3847 (Array Int Int)) (v_ArrVal_3848 (Array Int Int))) (let ((.cse20 (+ |v_list_add___list_add_~next#1.offset_23| 4))) (let ((.cse16 (select (select (store (let ((.cse21 (store |c_#memory_$Pointer$.base| .cse5 (store .cse10 .cse20 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)))) (store (store .cse21 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3845) |c_~#gl_list~0.base| (store (select (store .cse21 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3848) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_3844))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3816) |c_~#gl_list~0.base|) .cse8))) (or (= .cse16 |c_~#gl_list~0.base|) (let ((.cse17 (store (let ((.cse19 (store |c_#memory_$Pointer$.offset| .cse5 (store .cse6 .cse20 .cse4)))) (store (store .cse19 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3846) |c_~#gl_list~0.base| (store (select (store .cse19 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3847) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| .cse4))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3817))) (let ((.cse18 (select (select .cse17 |c_~#gl_list~0.base|) .cse8))) (= (select (select .cse17 .cse16) (+ .cse18 12)) (+ .cse18 8)))))))))) (forall ((|v_list_add___list_add_~next#1.offset_23| Int)) (or (< .cse0 |v_list_add___list_add_~next#1.offset_23|) (forall ((v_ArrVal_3816 (Array Int Int)) (v_ArrVal_3817 (Array Int Int)) (v_ArrVal_3844 Int) (v_ArrVal_3845 (Array Int Int)) (v_ArrVal_3846 (Array Int Int)) (v_ArrVal_3847 (Array Int Int)) (v_ArrVal_3848 (Array Int Int))) (let ((.cse26 (+ |v_list_add___list_add_~next#1.offset_23| 4))) (let ((.cse24 (select (select (store (let ((.cse27 (store |c_#memory_$Pointer$.offset| .cse5 (store .cse6 .cse26 .cse4)))) (store (store .cse27 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3846) |c_~#gl_list~0.base| (store (select (store .cse27 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3847) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| .cse4))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3817) |c_~#gl_list~0.base|) .cse8))) (or (let ((.cse22 (store (let ((.cse25 (store |c_#memory_$Pointer$.base| .cse5 (store .cse10 .cse26 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)))) (store (store .cse25 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3845) |c_~#gl_list~0.base| (store (select (store .cse25 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3848) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_3844))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3816))) (let ((.cse23 (select (select .cse22 |c_~#gl_list~0.base|) .cse8))) (= (select (select .cse22 .cse23) (+ .cse24 12)) .cse23))) (= |c_~#gl_list~0.offset| .cse24)))))))))) is different from false [2023-02-14 10:54:51,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851707089] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 10:54:51,239 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 10:54:51,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 34 [2023-02-14 10:54:51,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854300852] [2023-02-14 10:54:51,239 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 10:54:51,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-02-14 10:54:51,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 10:54:51,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-02-14 10:54:51,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1370, Unknown=4, NotChecked=150, Total=1640 [2023-02-14 10:54:51,241 INFO L87 Difference]: Start difference. First operand 421 states and 475 transitions. Second operand has 35 states, 35 states have (on average 2.942857142857143) internal successors, (103), 25 states have internal predecessors, (103), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-14 10:54:58,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:54:58,572 INFO L93 Difference]: Finished difference Result 437 states and 488 transitions. [2023-02-14 10:54:58,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-02-14 10:54:58,572 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.942857142857143) internal successors, (103), 25 states have internal predecessors, (103), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 58 [2023-02-14 10:54:58,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:54:58,573 INFO L225 Difference]: With dead ends: 437 [2023-02-14 10:54:58,573 INFO L226 Difference]: Without dead ends: 434 [2023-02-14 10:54:58,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 755 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=461, Invalid=3830, Unknown=7, NotChecked=258, Total=4556 [2023-02-14 10:54:58,579 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 1063 mSDsluCounter, 943 mSDsCounter, 0 mSdLazyCounter, 4406 mSolverCounterSat, 105 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1063 SdHoareTripleChecker+Valid, 997 SdHoareTripleChecker+Invalid, 4529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 4406 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2023-02-14 10:54:58,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1063 Valid, 997 Invalid, 4529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 4406 Invalid, 18 Unknown, 0 Unchecked, 4.1s Time] [2023-02-14 10:54:58,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2023-02-14 10:54:58,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 421. [2023-02-14 10:54:58,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 378 states have (on average 1.126984126984127) internal successors, (426), 391 states have internal predecessors, (426), 32 states have call successors, (32), 14 states have call predecessors, (32), 10 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-02-14 10:54:58,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 473 transitions. [2023-02-14 10:54:58,668 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 473 transitions. Word has length 58 [2023-02-14 10:54:58,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:54:58,669 INFO L495 AbstractCegarLoop]: Abstraction has 421 states and 473 transitions. [2023-02-14 10:54:58,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.942857142857143) internal successors, (103), 25 states have internal predecessors, (103), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-14 10:54:58,669 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 473 transitions. [2023-02-14 10:54:58,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-02-14 10:54:58,669 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:54:58,669 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:54:58,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-02-14 10:54:58,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 10:54:58,873 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:54:58,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:54:58,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1691144517, now seen corresponding path program 2 times [2023-02-14 10:54:58,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:54:58,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519686521] [2023-02-14 10:54:58,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:54:58,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:54:58,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:55:01,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-14 10:55:01,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:55:01,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-14 10:55:01,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:55:01,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-14 10:55:01,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:55:01,977 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 10:55:01,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 10:55:01,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519686521] [2023-02-14 10:55:01,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519686521] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 10:55:01,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102032293] [2023-02-14 10:55:01,977 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 10:55:01,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 10:55:01,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 10:55:01,981 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) [2023-02-14 10:55:01,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-14 10:55:02,416 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 10:55:02,416 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 10:55:02,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 613 conjuncts, 274 conjunts are in the unsatisfiable core [2023-02-14 10:55:02,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 10:55:02,511 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-14 10:55:02,512 INFO L350 Elim1Store]: Elim1 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 17 treesize of output 21 [2023-02-14 10:55:02,571 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2023-02-14 10:55:02,579 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-14 10:55:02,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:55:02,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 17 treesize of output 7 [2023-02-14 10:55:02,596 INFO L350 Elim1Store]: Elim1 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 9 treesize of output 3 [2023-02-14 10:55:02,816 INFO L321 Elim1Store]: treesize reduction 87, result has 3.3 percent of original size [2023-02-14 10:55:02,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 137 treesize of output 123 [2023-02-14 10:55:02,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:55:02,856 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2023-02-14 10:55:02,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 104 treesize of output 108 [2023-02-14 10:55:02,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 42 treesize of output 56 [2023-02-14 10:55:02,883 INFO L321 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2023-02-14 10:55:02,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 60 [2023-02-14 10:55:02,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:55:02,891 INFO L350 Elim1Store]: Elim1 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 81 treesize of output 53 [2023-02-14 10:55:02,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 [2023-02-14 10:55:02,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:55:02,916 INFO L321 Elim1Store]: treesize reduction 30, result has 40.0 percent of original size [2023-02-14 10:55:02,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 55 [2023-02-14 10:55:03,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:55:03,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:55:03,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:55:03,133 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 10:55:03,149 INFO L321 Elim1Store]: treesize reduction 97, result has 8.5 percent of original size [2023-02-14 10:55:03,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 186 treesize of output 151 [2023-02-14 10:55:03,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:55:03,158 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 92 [2023-02-14 10:55:03,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:55:03,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2023-02-14 10:55:03,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:55:03,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:55:03,187 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-14 10:55:03,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 38 [2023-02-14 10:55:03,375 INFO L321 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2023-02-14 10:55:03,376 INFO L350 Elim1Store]: Elim1 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 26 treesize of output 41 [2023-02-14 10:55:03,528 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-14 10:55:03,529 INFO L350 Elim1Store]: Elim1 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 100 treesize of output 96 [2023-02-14 10:55:03,534 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 60 [2023-02-14 10:55:03,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:55:03,563 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 10:55:03,577 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-14 10:55:03,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 61 [2023-02-14 10:55:03,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:55:03,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 41 treesize of output 21 [2023-02-14 10:55:03,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:55:03,826 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 10:55:03,851 INFO L321 Elim1Store]: treesize reduction 78, result has 23.5 percent of original size [2023-02-14 10:55:03,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 200 treesize of output 147 [2023-02-14 10:55:03,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:55:03,867 INFO L321 Elim1Store]: treesize reduction 42, result has 10.6 percent of original size [2023-02-14 10:55:03,867 INFO L350 Elim1Store]: Elim1 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 174 treesize of output 151 [2023-02-14 10:55:03,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:55:03,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 124 [2023-02-14 10:55:03,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:55:03,878 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 79 [2023-02-14 10:55:03,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:55:03,883 INFO L350 Elim1Store]: Elim1 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 84 treesize of output 76 [2023-02-14 10:55:03,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:55:03,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 59 treesize of output 53 [2023-02-14 10:55:04,114 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2023-02-14 10:55:04,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 202 treesize of output 184 [2023-02-14 10:55:04,140 INFO L321 Elim1Store]: treesize reduction 90, result has 21.7 percent of original size [2023-02-14 10:55:04,140 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 5 case distinctions, treesize of input 178 treesize of output 190 [2023-02-14 10:55:04,648 INFO L321 Elim1Store]: treesize reduction 41, result has 62.4 percent of original size [2023-02-14 10:55:04,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 184 treesize of output 231 [2023-02-14 10:55:04,961 INFO L321 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2023-02-14 10:55:04,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 185 treesize of output 168 [2023-02-14 10:55:04,987 INFO L321 Elim1Store]: treesize reduction 47, result has 16.1 percent of original size [2023-02-14 10:55:04,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 162 treesize of output 170 [2023-02-14 10:55:05,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:55:05,184 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 10:55:05,246 INFO L321 Elim1Store]: treesize reduction 52, result has 59.7 percent of original size [2023-02-14 10:55:05,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 179 treesize of output 172 [2023-02-14 10:55:05,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:55:05,298 INFO L321 Elim1Store]: treesize reduction 8, result has 87.7 percent of original size [2023-02-14 10:55:05,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 88 treesize of output 116 [2023-02-14 10:55:06,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:55:06,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:55:06,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:55:06,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:55:06,881 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 10:55:06,938 INFO L321 Elim1Store]: treesize reduction 184, result has 14.4 percent of original size [2023-02-14 10:55:06,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 16 case distinctions, treesize of input 286 treesize of output 223 [2023-02-14 10:55:06,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:55:07,007 INFO L321 Elim1Store]: treesize reduction 120, result has 26.4 percent of original size [2023-02-14 10:55:07,007 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 275 treesize of output 272 [2023-02-14 10:55:07,057 INFO L321 Elim1Store]: treesize reduction 247, result has 11.2 percent of original size [2023-02-14 10:55:07,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 196 treesize of output 234 [2023-02-14 10:55:07,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:55:07,117 INFO L321 Elim1Store]: treesize reduction 135, result has 32.5 percent of original size [2023-02-14 10:55:07,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 213 treesize of output 229 [2023-02-14 10:55:08,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:55:08,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 124 treesize of output 120 [2023-02-14 10:55:08,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:55:08,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 393 treesize of output 373 [2023-02-14 10:55:08,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:55:08,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 69 [2023-02-14 10:55:08,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:55:08,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 101 [2023-02-14 10:55:08,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:55:08,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 110 treesize of output 84 [2023-02-14 10:55:08,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:55:08,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 62 treesize of output 52 [2023-02-14 10:55:09,291 INFO L321 Elim1Store]: treesize reduction 116, result has 26.1 percent of original size [2023-02-14 10:55:09,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 14 case distinctions, treesize of input 245 treesize of output 234 [2023-02-14 10:55:09,319 INFO L321 Elim1Store]: treesize reduction 78, result has 21.2 percent of original size [2023-02-14 10:55:09,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 5 case distinctions, treesize of input 215 treesize of output 225 [2023-02-14 10:55:09,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 338 treesize of output 334 [2023-02-14 10:55:09,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 8 [2023-02-14 10:55:09,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 8 [2023-02-14 10:55:09,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 7 [2023-02-14 10:55:09,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 7 [2023-02-14 10:55:10,701 INFO L321 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2023-02-14 10:55:10,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 266 treesize of output 274 [2023-02-14 10:55:11,312 INFO L321 Elim1Store]: treesize reduction 136, result has 52.3 percent of original size [2023-02-14 10:55:11,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 3 disjoint index pairs (out of 36 index pairs), introduced 12 new quantified variables, introduced 35 case distinctions, treesize of input 247 treesize of output 242 [2023-02-14 10:55:12,685 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 1 proven. 35 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:55:12,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 10:55:12,712 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4396 (Array Int Int)) (v_ArrVal_4397 (Array Int Int))) (not (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_4396)) (.cse2 (+ |c_~#gl_list~0.offset| 4))) (let ((.cse0 (select (select .cse1 |c_~#gl_list~0.base|) .cse2))) (= .cse0 (select (select .cse1 .cse0) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_4397) |c_~#gl_list~0.base|) .cse2))))))) is different from false [2023-02-14 10:55:13,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102032293] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 10:55:13,126 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 10:55:13,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 39 [2023-02-14 10:55:13,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442110701] [2023-02-14 10:55:13,126 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 10:55:13,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-02-14 10:55:13,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 10:55:13,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-02-14 10:55:13,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1488, Unknown=19, NotChecked=78, Total=1722 [2023-02-14 10:55:13,128 INFO L87 Difference]: Start difference. First operand 421 states and 473 transitions. Second operand has 40 states, 40 states have (on average 2.525) internal successors, (101), 27 states have internal predecessors, (101), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-14 10:55:23,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:55:23,754 INFO L93 Difference]: Finished difference Result 628 states and 701 transitions. [2023-02-14 10:55:23,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-02-14 10:55:23,755 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.525) internal successors, (101), 27 states have internal predecessors, (101), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 59 [2023-02-14 10:55:23,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:55:23,757 INFO L225 Difference]: With dead ends: 628 [2023-02-14 10:55:23,757 INFO L226 Difference]: Without dead ends: 625 [2023-02-14 10:55:23,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1479 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=545, Invalid=5138, Unknown=21, NotChecked=148, Total=5852 [2023-02-14 10:55:23,758 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 1722 mSDsluCounter, 1079 mSDsCounter, 0 mSdLazyCounter, 4681 mSolverCounterSat, 211 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1725 SdHoareTripleChecker+Valid, 1153 SdHoareTripleChecker+Invalid, 4901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 4681 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2023-02-14 10:55:23,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1725 Valid, 1153 Invalid, 4901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 4681 Invalid, 9 Unknown, 0 Unchecked, 5.0s Time] [2023-02-14 10:55:23,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2023-02-14 10:55:23,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 425. [2023-02-14 10:55:23,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 381 states have (on average 1.120734908136483) internal successors, (427), 394 states have internal predecessors, (427), 32 states have call successors, (32), 15 states have call predecessors, (32), 11 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-02-14 10:55:23,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 474 transitions. [2023-02-14 10:55:23,860 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 474 transitions. Word has length 59 [2023-02-14 10:55:23,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:55:23,860 INFO L495 AbstractCegarLoop]: Abstraction has 425 states and 474 transitions. [2023-02-14 10:55:23,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.525) internal successors, (101), 27 states have internal predecessors, (101), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-14 10:55:23,860 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 474 transitions. [2023-02-14 10:55:23,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-02-14 10:55:23,861 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:55:23,861 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:55:23,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-14 10:55:24,067 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,SelfDestructingSolverStorable20 [2023-02-14 10:55:24,067 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:55:24,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:55:24,068 INFO L85 PathProgramCache]: Analyzing trace with hash -678154033, now seen corresponding path program 1 times [2023-02-14 10:55:24,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:55:24,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932690612] [2023-02-14 10:55:24,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:55:24,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:55:24,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:55:24,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-14 10:55:24,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:55:25,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:55:25,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 10:55:25,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932690612] [2023-02-14 10:55:25,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932690612] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 10:55:25,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 10:55:25,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-02-14 10:55:25,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113023021] [2023-02-14 10:55:25,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 10:55:25,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-14 10:55:25,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 10:55:25,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-14 10:55:25,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2023-02-14 10:55:25,114 INFO L87 Difference]: Start difference. First operand 425 states and 474 transitions. Second operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 10:55:26,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:55:26,005 INFO L93 Difference]: Finished difference Result 439 states and 488 transitions. [2023-02-14 10:55:26,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-14 10:55:26,006 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2023-02-14 10:55:26,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:55:26,007 INFO L225 Difference]: With dead ends: 439 [2023-02-14 10:55:26,007 INFO L226 Difference]: Without dead ends: 436 [2023-02-14 10:55:26,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2023-02-14 10:55:26,008 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 304 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 1121 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 1149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-14 10:55:26,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 288 Invalid, 1149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1121 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-14 10:55:26,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2023-02-14 10:55:26,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 425. [2023-02-14 10:55:26,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 381 states have (on average 1.1181102362204725) internal successors, (426), 394 states have internal predecessors, (426), 32 states have call successors, (32), 15 states have call predecessors, (32), 11 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-02-14 10:55:26,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 473 transitions. [2023-02-14 10:55:26,113 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 473 transitions. Word has length 60 [2023-02-14 10:55:26,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:55:26,113 INFO L495 AbstractCegarLoop]: Abstraction has 425 states and 473 transitions. [2023-02-14 10:55:26,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 10:55:26,114 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 473 transitions. [2023-02-14 10:55:26,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-02-14 10:55:26,114 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:55:26,114 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:55:26,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-02-14 10:55:26,114 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:55:26,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:55:26,115 INFO L85 PathProgramCache]: Analyzing trace with hash 697431940, now seen corresponding path program 2 times [2023-02-14 10:55:26,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:55:26,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758395769] [2023-02-14 10:55:26,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:55:26,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:55:26,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:55:28,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-14 10:55:28,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:55:28,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-14 10:55:28,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:55:29,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-14 10:55:29,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:55:29,565 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 10:55:29,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 10:55:29,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758395769] [2023-02-14 10:55:29,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758395769] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 10:55:29,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679901215] [2023-02-14 10:55:29,566 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 10:55:29,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 10:55:29,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 10:55:29,567 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) [2023-02-14 10:55:29,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-14 10:55:30,090 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 10:55:30,090 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 10:55:30,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 619 conjuncts, 258 conjunts are in the unsatisfiable core [2023-02-14 10:55:30,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 10:55:30,140 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-14 10:55:30,140 INFO L350 Elim1Store]: Elim1 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 17 treesize of output 21 [2023-02-14 10:55:30,203 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2023-02-14 10:55:30,208 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-14 10:55:30,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:55:30,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 17 treesize of output 7 [2023-02-14 10:55:30,228 INFO L350 Elim1Store]: Elim1 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 9 treesize of output 3 [2023-02-14 10:55:30,386 INFO L321 Elim1Store]: treesize reduction 73, result has 3.9 percent of original size [2023-02-14 10:55:30,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 101 treesize of output 107 [2023-02-14 10:55:30,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:55:30,410 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2023-02-14 10:55:30,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 83 treesize of output 89 [2023-02-14 10:55:30,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 40 treesize of output 54 [2023-02-14 10:55:30,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:55:30,419 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 38 [2023-02-14 10:55:30,432 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-14 10:55:30,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 58 [2023-02-14 10:55:30,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:55:30,451 INFO L321 Elim1Store]: treesize reduction 30, result has 40.0 percent of original size [2023-02-14 10:55:30,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 55 [2023-02-14 10:55:30,599 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 10:55:30,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 157 treesize of output 138 [2023-02-14 10:55:30,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:55:30,605 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 86 [2023-02-14 10:55:30,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:55:30,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2023-02-14 10:55:30,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:55:30,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:55:30,623 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2023-02-14 10:55:30,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 32 [2023-02-14 10:55:30,786 INFO L321 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2023-02-14 10:55:30,786 INFO L350 Elim1Store]: Elim1 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 26 treesize of output 41 [2023-02-14 10:55:30,920 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 81 [2023-02-14 10:55:30,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 60 [2023-02-14 10:55:30,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:55:30,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 83 treesize of output 55 [2023-02-14 10:55:30,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:55:30,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 41 treesize of output 21 [2023-02-14 10:55:31,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:55:31,244 INFO L321 Elim1Store]: treesize reduction 32, result has 13.5 percent of original size [2023-02-14 10:55:31,244 INFO L350 Elim1Store]: Elim1 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 236 treesize of output 190 [2023-02-14 10:55:31,262 INFO L321 Elim1Store]: treesize reduction 80, result has 5.9 percent of original size [2023-02-14 10:55:31,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 210 treesize of output 219 [2023-02-14 10:55:31,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:55:31,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 150 [2023-02-14 10:55:31,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:55:31,274 INFO L350 Elim1Store]: Elim1 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 91 [2023-02-14 10:55:31,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:55:31,280 INFO L350 Elim1Store]: Elim1 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 97 treesize of output 87 [2023-02-14 10:55:31,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:55:31,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 79 treesize of output 71 [2023-02-14 10:55:31,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2023-02-14 10:55:31,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-02-14 10:55:31,631 INFO L321 Elim1Store]: treesize reduction 96, result has 22.6 percent of original size [2023-02-14 10:55:31,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 5914 treesize of output 4698 [2023-02-14 10:55:31,723 INFO L321 Elim1Store]: treesize reduction 90, result has 21.7 percent of original size [2023-02-14 10:55:31,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 5 case distinctions, treesize of input 5843 treesize of output 5857 [2023-02-14 10:55:31,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 7 [2023-02-14 10:55:31,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 7 [2023-02-14 10:55:31,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 23 [2023-02-14 10:55:32,078 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-14 10:55:32,437 INFO L321 Elim1Store]: treesize reduction 41, result has 62.4 percent of original size [2023-02-14 10:55:32,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 150 treesize of output 197 [2023-02-14 10:55:32,643 INFO L321 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2023-02-14 10:55:32,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 151 treesize of output 144 [2023-02-14 10:55:32,660 INFO L321 Elim1Store]: treesize reduction 47, result has 16.1 percent of original size [2023-02-14 10:55:32,660 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 123 treesize of output 133 [2023-02-14 10:55:32,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:55:32,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:55:32,731 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 10:55:32,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 145 treesize of output 88 [2023-02-14 10:55:32,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:55:32,740 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 10:55:32,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 53 [2023-02-14 10:55:32,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:55:32,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:55:32,999 INFO L321 Elim1Store]: treesize reduction 102, result has 27.7 percent of original size [2023-02-14 10:55:32,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 229 treesize of output 170 [2023-02-14 10:55:33,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:55:33,056 INFO L321 Elim1Store]: treesize reduction 120, result has 26.4 percent of original size [2023-02-14 10:55:33,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 218 treesize of output 227 [2023-02-14 10:55:33,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:55:33,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:55:33,100 INFO L321 Elim1Store]: treesize reduction 113, result has 32.7 percent of original size [2023-02-14 10:55:33,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 110 treesize of output 153 [2023-02-14 10:55:33,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:55:33,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 105 [2023-02-14 10:55:33,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:55:33,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 140 treesize of output 110 [2023-02-14 10:55:33,563 INFO L321 Elim1Store]: treesize reduction 116, result has 26.1 percent of original size [2023-02-14 10:55:33,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 14 case distinctions, treesize of input 189 treesize of output 192 [2023-02-14 10:55:33,577 INFO L321 Elim1Store]: treesize reduction 47, result has 16.1 percent of original size [2023-02-14 10:55:33,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 162 treesize of output 170 [2023-02-14 10:55:33,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 56 treesize of output 48 [2023-02-14 10:55:34,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 20 [2023-02-14 10:55:34,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 20 [2023-02-14 10:55:37,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2023-02-14 10:55:37,344 INFO L321 Elim1Store]: treesize reduction 42, result has 6.7 percent of original size [2023-02-14 10:55:37,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 117 treesize of output 40 [2023-02-14 10:55:37,381 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 1 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:55:37,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 10:55:37,708 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_~#gl_list~0.offset| 4))) (and (forall ((v_ArrVal_5066 (Array Int Int)) (v_ArrVal_5067 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_5066) |c_~#gl_list~0.base|) .cse3))) (or (not (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_5067))) (let ((.cse1 (select (select .cse0 |c_~#gl_list~0.base|) .cse3))) (= (select (select .cse0 .cse1) (+ .cse2 4)) .cse1)))) (= |c_~#gl_list~0.offset| .cse2)))) (forall ((v_ArrVal_5066 (Array Int Int)) (v_ArrVal_5067 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_5067))) (let ((.cse5 (select (select .cse4 |c_~#gl_list~0.base|) .cse3))) (or (not (= (select (select .cse4 .cse5) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_5066) |c_~#gl_list~0.base|) .cse3) 4)) .cse5)) (= .cse5 |c_~#gl_list~0.base|))))))) is different from false [2023-02-14 10:55:38,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679901215] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 10:55:38,183 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 10:55:38,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 23] total 41 [2023-02-14 10:55:38,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426426767] [2023-02-14 10:55:38,183 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 10:55:38,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-02-14 10:55:38,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 10:55:38,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-02-14 10:55:38,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=2252, Unknown=34, NotChecked=96, Total=2550 [2023-02-14 10:55:38,185 INFO L87 Difference]: Start difference. First operand 425 states and 473 transitions. Second operand has 42 states, 42 states have (on average 2.5476190476190474) internal successors, (107), 29 states have internal predecessors, (107), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-14 10:55:44,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 10:55:49,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 10:55:55,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:55:55,436 INFO L93 Difference]: Finished difference Result 736 states and 820 transitions. [2023-02-14 10:55:55,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-02-14 10:55:55,437 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.5476190476190474) internal successors, (107), 29 states have internal predecessors, (107), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 62 [2023-02-14 10:55:55,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:55:55,439 INFO L225 Difference]: With dead ends: 736 [2023-02-14 10:55:55,439 INFO L226 Difference]: Without dead ends: 733 [2023-02-14 10:55:55,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1411 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=595, Invalid=6012, Unknown=39, NotChecked=160, Total=6806 [2023-02-14 10:55:55,440 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 1645 mSDsluCounter, 1581 mSDsCounter, 0 mSdLazyCounter, 7523 mSolverCounterSat, 210 mSolverCounterUnsat, 53 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1651 SdHoareTripleChecker+Valid, 1656 SdHoareTripleChecker+Invalid, 7786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 7523 IncrementalHoareTripleChecker+Invalid, 53 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.7s IncrementalHoareTripleChecker+Time [2023-02-14 10:55:55,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1651 Valid, 1656 Invalid, 7786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 7523 Invalid, 53 Unknown, 0 Unchecked, 11.7s Time] [2023-02-14 10:55:55,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2023-02-14 10:55:55,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 545. [2023-02-14 10:55:55,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 491 states have (on average 1.1181262729124237) internal successors, (549), 505 states have internal predecessors, (549), 39 states have call successors, (39), 19 states have call predecessors, (39), 14 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-02-14 10:55:55,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 608 transitions. [2023-02-14 10:55:55,577 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 608 transitions. Word has length 62 [2023-02-14 10:55:55,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:55:55,578 INFO L495 AbstractCegarLoop]: Abstraction has 545 states and 608 transitions. [2023-02-14 10:55:55,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.5476190476190474) internal successors, (107), 29 states have internal predecessors, (107), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-14 10:55:55,578 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 608 transitions. [2023-02-14 10:55:55,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-02-14 10:55:55,582 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:55:55,582 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:55:55,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-14 10:55:55,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 10:55:55,790 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:55:55,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:55:55,791 INFO L85 PathProgramCache]: Analyzing trace with hash 558719418, now seen corresponding path program 1 times [2023-02-14 10:55:55,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:55:55,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709081503] [2023-02-14 10:55:55,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:55:55,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:55:55,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:55:56,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-14 10:55:56,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:55:56,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:55:56,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 10:55:56,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709081503] [2023-02-14 10:55:56,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709081503] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 10:55:56,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 10:55:56,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-02-14 10:55:56,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781302536] [2023-02-14 10:55:56,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 10:55:56,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-14 10:55:56,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 10:55:56,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-14 10:55:56,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2023-02-14 10:55:56,856 INFO L87 Difference]: Start difference. First operand 545 states and 608 transitions. Second operand has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 9 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 10:55:57,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:55:57,937 INFO L93 Difference]: Finished difference Result 551 states and 612 transitions. [2023-02-14 10:55:57,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-14 10:55:57,937 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 9 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2023-02-14 10:55:57,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:55:57,939 INFO L225 Difference]: With dead ends: 551 [2023-02-14 10:55:57,939 INFO L226 Difference]: Without dead ends: 548 [2023-02-14 10:55:57,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2023-02-14 10:55:57,939 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 295 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 1125 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-14 10:55:57,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 295 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1125 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-14 10:55:57,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2023-02-14 10:55:58,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 545. [2023-02-14 10:55:58,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 491 states have (on average 1.1160896130346232) internal successors, (548), 505 states have internal predecessors, (548), 39 states have call successors, (39), 19 states have call predecessors, (39), 14 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-02-14 10:55:58,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 607 transitions. [2023-02-14 10:55:58,074 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 607 transitions. Word has length 63 [2023-02-14 10:55:58,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:55:58,074 INFO L495 AbstractCegarLoop]: Abstraction has 545 states and 607 transitions. [2023-02-14 10:55:58,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 9 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 10:55:58,074 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 607 transitions. [2023-02-14 10:55:58,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-02-14 10:55:58,075 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:55:58,075 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:55:58,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-02-14 10:55:58,075 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:55:58,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:55:58,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1657846127, now seen corresponding path program 2 times [2023-02-14 10:55:58,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:55:58,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535226842] [2023-02-14 10:55:58,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:55:58,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:55:58,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:56:01,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-14 10:56:01,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:56:01,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-14 10:56:01,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:56:02,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-14 10:56:02,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:56:03,088 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 10:56:03,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 10:56:03,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535226842] [2023-02-14 10:56:03,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535226842] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 10:56:03,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043922632] [2023-02-14 10:56:03,089 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 10:56:03,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 10:56:03,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 10:56:03,090 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) [2023-02-14 10:56:03,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-14 10:56:03,566 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 10:56:03,566 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 10:56:03,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 271 conjunts are in the unsatisfiable core [2023-02-14 10:56:03,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 10:56:03,638 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-14 10:56:03,638 INFO L350 Elim1Store]: Elim1 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 17 treesize of output 21 [2023-02-14 10:56:03,700 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2023-02-14 10:56:03,710 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-14 10:56:03,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:56:03,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 17 treesize of output 7 [2023-02-14 10:56:03,725 INFO L350 Elim1Store]: Elim1 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 9 treesize of output 3 [2023-02-14 10:56:03,950 INFO L321 Elim1Store]: treesize reduction 73, result has 3.9 percent of original size [2023-02-14 10:56:03,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 118 treesize of output 131 [2023-02-14 10:56:03,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:56:03,990 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2023-02-14 10:56:03,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 107 treesize of output 107 [2023-02-14 10:56:04,014 INFO L321 Elim1Store]: treesize reduction 17, result has 43.3 percent of original size [2023-02-14 10:56:04,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 47 [2023-02-14 10:56:04,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:56:04,019 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2023-02-14 10:56:04,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:56:04,033 INFO L321 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2023-02-14 10:56:04,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 31 treesize of output 40 [2023-02-14 10:56:04,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:56:04,261 INFO L350 Elim1Store]: Elim1 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 76 treesize of output 74 [2023-02-14 10:56:04,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:56:04,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 61 treesize of output 65 [2023-02-14 10:56:04,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:56:04,270 INFO L350 Elim1Store]: Elim1 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 88 treesize of output 88 [2023-02-14 10:56:04,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:56:04,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 62 treesize of output 66 [2023-02-14 10:56:04,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2023-02-14 10:56:04,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 treesize of output 5 [2023-02-14 10:56:04,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 43 treesize of output 31 [2023-02-14 10:56:04,532 INFO L321 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2023-02-14 10:56:04,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 146 treesize of output 155 [2023-02-14 10:56:04,671 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-14 10:56:04,671 INFO L350 Elim1Store]: Elim1 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 144 treesize of output 122 [2023-02-14 10:56:04,679 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-14 10:56:04,680 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 143 treesize of output 138 [2023-02-14 10:56:04,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:56:04,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:56:04,729 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 10:56:04,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 129 treesize of output 69 [2023-02-14 10:56:04,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:56:04,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:56:04,734 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 10:56:04,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 49 [2023-02-14 10:56:04,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:56:04,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:56:04,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:56:04,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:56:04,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:56:04,923 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 10:56:04,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 245 treesize of output 160 [2023-02-14 10:56:04,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:56:04,935 INFO L321 Elim1Store]: treesize reduction 42, result has 10.6 percent of original size [2023-02-14 10:56:04,936 INFO L350 Elim1Store]: Elim1 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 215 treesize of output 176 [2023-02-14 10:56:04,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:56:04,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 141 [2023-02-14 10:56:04,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:56:04,953 INFO L321 Elim1Store]: treesize reduction 30, result has 14.3 percent of original size [2023-02-14 10:56:04,953 INFO L350 Elim1Store]: Elim1 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 170 treesize of output 145 [2023-02-14 10:56:04,965 INFO L321 Elim1Store]: treesize reduction 48, result has 9.4 percent of original size [2023-02-14 10:56:04,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 152 treesize of output 174 [2023-02-14 10:56:04,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:56:04,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 114 treesize of output 108 [2023-02-14 10:56:04,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 92 [2023-02-14 10:56:04,983 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 10:56:04,989 INFO L350 Elim1Store]: Elim1 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 42 treesize of output 15 [2023-02-14 10:56:04,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 7 [2023-02-14 10:56:05,196 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2023-02-14 10:56:05,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 205 treesize of output 185 [2023-02-14 10:56:05,221 INFO L321 Elim1Store]: treesize reduction 90, result has 21.7 percent of original size [2023-02-14 10:56:05,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 5 case distinctions, treesize of input 183 treesize of output 187 [2023-02-14 10:56:05,614 INFO L321 Elim1Store]: treesize reduction 19, result has 71.6 percent of original size [2023-02-14 10:56:05,614 INFO L350 Elim1Store]: Elim1 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 187 treesize of output 220 [2023-02-14 10:56:05,857 INFO L321 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2023-02-14 10:56:05,859 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 189 treesize of output 170 [2023-02-14 10:56:05,878 INFO L321 Elim1Store]: treesize reduction 47, result has 16.1 percent of original size [2023-02-14 10:56:05,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 167 treesize of output 167 [2023-02-14 10:56:05,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:56:05,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:56:05,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:56:05,991 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 10:56:05,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 183 treesize of output 112 [2023-02-14 10:56:05,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:56:05,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:56:06,005 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 10:56:06,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 84 treesize of output 73 [2023-02-14 10:56:06,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:56:06,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:56:06,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:56:06,502 INFO L321 Elim1Store]: treesize reduction 150, result has 28.9 percent of original size [2023-02-14 10:56:06,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 20 case distinctions, treesize of input 289 treesize of output 222 [2023-02-14 10:56:06,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:56:06,578 INFO L321 Elim1Store]: treesize reduction 108, result has 33.7 percent of original size [2023-02-14 10:56:06,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 293 treesize of output 296 [2023-02-14 10:56:06,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:56:06,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:56:06,634 INFO L321 Elim1Store]: treesize reduction 140, result has 28.9 percent of original size [2023-02-14 10:56:06,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 166 treesize of output 178 [2023-02-14 10:56:06,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:56:06,697 INFO L321 Elim1Store]: treesize reduction 87, result has 45.6 percent of original size [2023-02-14 10:56:06,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 172 treesize of output 219 [2023-02-14 10:56:06,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 treesize of output 3 [2023-02-14 10:56:07,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 treesize of output 3 [2023-02-14 10:56:07,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:56:07,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 137 [2023-02-14 10:56:07,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:56:07,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2023-02-14 10:56:07,556 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 10:56:07,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 335 treesize of output 343 [2023-02-14 10:56:08,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:56:08,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2023-02-14 10:56:08,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:56:08,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2023-02-14 10:56:08,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:56:08,570 INFO L321 Elim1Store]: treesize reduction 86, result has 1.1 percent of original size [2023-02-14 10:56:08,570 INFO L350 Elim1Store]: Elim1 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 5 case distinctions, treesize of input 49 treesize of output 45 [2023-02-14 10:56:08,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:56:08,601 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2023-02-14 10:56:08,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:56:08,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1379 treesize of output 1015 [2023-02-14 10:56:09,946 INFO L321 Elim1Store]: treesize reduction 126, result has 41.7 percent of original size [2023-02-14 10:56:09,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 20 case distinctions, treesize of input 445 treesize of output 445 [2023-02-14 10:56:10,040 INFO L321 Elim1Store]: treesize reduction 190, result has 43.3 percent of original size [2023-02-14 10:56:10,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 19 case distinctions, treesize of input 405 treesize of output 462