./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-data/hash_fun.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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-data/hash_fun.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 --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 0abab60f5c601fd8191c1a2aa712d4ab55460e987c7d41ca7527c2934792cc0b --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 19:28:56,250 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 19:28:56,353 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 19:28:56,359 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 19:28:56,360 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 19:28:56,379 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 19:28:56,379 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 19:28:56,380 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 19:28:56,380 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 19:28:56,381 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 19:28:56,381 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 19:28:56,381 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 19:28:56,382 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 19:28:56,382 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 19:28:56,382 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 19:28:56,383 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 19:28:56,383 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 19:28:56,384 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 19:28:56,384 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 19:28:56,384 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 19:28:56,385 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 19:28:56,385 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 19:28:56,385 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 19:28:56,386 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 19:28:56,386 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 19:28:56,386 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 19:28:56,387 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 19:28:56,387 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 19:28:56,387 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 19:28:56,387 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 19:28:56,388 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 19:28:56,388 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 19:28:56,388 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 19:28:56,388 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 19:28:56,389 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 19:28:56,389 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 19:28:56,389 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 19:28:56,390 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 19:28:56,390 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 19:28:56,392 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 19:28:56,392 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 19:28:56,393 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 19:28:56,393 INFO L153 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 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 -> 0abab60f5c601fd8191c1a2aa712d4ab55460e987c7d41ca7527c2934792cc0b [2024-11-11 19:28:56,624 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 19:28:56,648 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 19:28:56,650 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 19:28:56,651 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 19:28:56,652 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 19:28:56,652 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-data/hash_fun.i [2024-11-11 19:28:58,036 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 19:28:58,274 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 19:28:58,274 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/hash_fun.i [2024-11-11 19:28:58,285 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e26664962/b2bc8cad17014936b94f8f80d37dff45/FLAG8019f8cb9 [2024-11-11 19:28:58,296 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e26664962/b2bc8cad17014936b94f8f80d37dff45 [2024-11-11 19:28:58,299 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 19:28:58,300 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 19:28:58,301 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 19:28:58,301 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 19:28:58,306 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 19:28:58,307 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 07:28:58" (1/1) ... [2024-11-11 19:28:58,308 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4228851a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:28:58, skipping insertion in model container [2024-11-11 19:28:58,309 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 07:28:58" (1/1) ... [2024-11-11 19:28:58,348 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 19:28:58,713 WARN L250 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-data/hash_fun.i[23732,23745] [2024-11-11 19:28:58,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 19:28:58,728 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 19:28:58,778 WARN L250 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-data/hash_fun.i[23732,23745] [2024-11-11 19:28:58,783 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 19:28:58,814 INFO L204 MainTranslator]: Completed translation [2024-11-11 19:28:58,814 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:28:58 WrapperNode [2024-11-11 19:28:58,815 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 19:28:58,816 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 19:28:58,816 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 19:28:58,816 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 19:28:58,823 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:28:58" (1/1) ... [2024-11-11 19:28:58,839 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:28:58" (1/1) ... [2024-11-11 19:28:58,861 INFO L138 Inliner]: procedures = 125, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 80 [2024-11-11 19:28:58,863 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 19:28:58,863 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 19:28:58,863 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 19:28:58,864 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 19:28:58,873 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:28:58" (1/1) ... [2024-11-11 19:28:58,873 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:28:58" (1/1) ... [2024-11-11 19:28:58,880 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:28:58" (1/1) ... [2024-11-11 19:28:58,898 INFO L175 MemorySlicer]: Split 15 memory accesses to 3 slices as follows [2, 5, 8]. 53 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 4 writes are split as follows [0, 2, 2]. [2024-11-11 19:28:58,901 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:28:58" (1/1) ... [2024-11-11 19:28:58,901 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:28:58" (1/1) ... [2024-11-11 19:28:58,910 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:28:58" (1/1) ... [2024-11-11 19:28:58,914 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:28:58" (1/1) ... [2024-11-11 19:28:58,916 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:28:58" (1/1) ... [2024-11-11 19:28:58,921 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:28:58" (1/1) ... [2024-11-11 19:28:58,923 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 19:28:58,924 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 19:28:58,924 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 19:28:58,924 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 19:28:58,925 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:28:58" (1/1) ... [2024-11-11 19:28:58,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 19:28:58,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:28:58,956 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 19:28:58,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 19:28:59,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-11 19:28:59,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-11 19:28:59,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-11 19:28:59,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-11 19:28:59,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-11 19:28:59,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-11 19:28:59,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-11 19:28:59,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 19:28:59,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-11 19:28:59,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-11 19:28:59,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-11 19:28:59,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-11 19:28:59,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-11 19:28:59,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-11 19:28:59,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-11 19:28:59,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-11 19:28:59,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-11 19:28:59,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-11 19:28:59,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-11 19:28:59,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 19:28:59,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-11 19:28:59,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-11 19:28:59,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 19:28:59,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 19:28:59,159 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 19:28:59,162 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 19:28:59,331 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-11 19:28:59,331 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 19:28:59,346 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 19:28:59,347 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-11 19:28:59,348 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 07:28:59 BoogieIcfgContainer [2024-11-11 19:28:59,348 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 19:28:59,351 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 19:28:59,351 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 19:28:59,353 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 19:28:59,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 07:28:58" (1/3) ... [2024-11-11 19:28:59,354 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31901045 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 07:28:59, skipping insertion in model container [2024-11-11 19:28:59,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:28:58" (2/3) ... [2024-11-11 19:28:59,354 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31901045 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 07:28:59, skipping insertion in model container [2024-11-11 19:28:59,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 07:28:59" (3/3) ... [2024-11-11 19:28:59,355 INFO L112 eAbstractionObserver]: Analyzing ICFG hash_fun.i [2024-11-11 19:28:59,368 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 19:28:59,368 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 19:28:59,422 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 19:28:59,429 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@2b98b60, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 19:28:59,429 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 19:28:59,432 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 18 states have (on average 1.5) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:28:59,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-11 19:28:59,437 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:28:59,438 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:28:59,438 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:28:59,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:28:59,443 INFO L85 PathProgramCache]: Analyzing trace with hash 889568652, now seen corresponding path program 1 times [2024-11-11 19:28:59,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:28:59,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410993471] [2024-11-11 19:28:59,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:28:59,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:28:59,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:28:59,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:28:59,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:28:59,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410993471] [2024-11-11 19:28:59,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410993471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:28:59,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:28:59,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 19:28:59,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789437784] [2024-11-11 19:28:59,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:28:59,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 19:28:59,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:28:59,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 19:28:59,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 19:28:59,622 INFO L87 Difference]: Start difference. First operand has 20 states, 18 states have (on average 1.5) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:28:59,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:28:59,632 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2024-11-11 19:28:59,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 19:28:59,633 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-11 19:28:59,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:28:59,638 INFO L225 Difference]: With dead ends: 31 [2024-11-11 19:28:59,638 INFO L226 Difference]: Without dead ends: 16 [2024-11-11 19:28:59,641 INFO L434 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 [2024-11-11 19:28:59,644 INFO L435 NwaCegarLoop]: 24 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, 24 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 [2024-11-11 19:28:59,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:28:59,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-11 19:28:59,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-11-11 19:28:59,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:28:59,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2024-11-11 19:28:59,675 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 8 [2024-11-11 19:28:59,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:28:59,676 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2024-11-11 19:28:59,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:28:59,677 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2024-11-11 19:28:59,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-11 19:28:59,677 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:28:59,678 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:28:59,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 19:28:59,678 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:28:59,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:28:59,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1232501922, now seen corresponding path program 1 times [2024-11-11 19:28:59,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:28:59,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16550308] [2024-11-11 19:28:59,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:28:59,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:28:59,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:28:59,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:28:59,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:28:59,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16550308] [2024-11-11 19:28:59,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16550308] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:28:59,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:28:59,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 19:28:59,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916367926] [2024-11-11 19:28:59,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:28:59,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 19:28:59,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:28:59,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 19:28:59,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 19:28:59,923 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:28:59,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:28:59,980 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2024-11-11 19:28:59,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 19:28:59,980 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-11 19:28:59,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:28:59,981 INFO L225 Difference]: With dead ends: 31 [2024-11-11 19:28:59,982 INFO L226 Difference]: Without dead ends: 22 [2024-11-11 19:28:59,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 19:28:59,984 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 7 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:28:59,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 48 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:28:59,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-11 19:28:59,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-11 19:28:59,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:28:59,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2024-11-11 19:28:59,991 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 9 [2024-11-11 19:28:59,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:28:59,991 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2024-11-11 19:28:59,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:28:59,992 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2024-11-11 19:28:59,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-11 19:28:59,993 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:28:59,993 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:28:59,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 19:28:59,994 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:28:59,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:28:59,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1676299209, now seen corresponding path program 1 times [2024-11-11 19:28:59,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:28:59,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208674392] [2024-11-11 19:28:59,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:28:59,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:29:00,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:29:00,477 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:29:00,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:29:00,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208674392] [2024-11-11 19:29:00,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208674392] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:29:00,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:29:00,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 19:29:00,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510644923] [2024-11-11 19:29:00,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:29:00,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 19:29:00,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:29:00,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 19:29:00,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 19:29:00,482 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:29:00,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:29:00,540 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2024-11-11 19:29:00,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 19:29:00,541 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-11 19:29:00,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:29:00,541 INFO L225 Difference]: With dead ends: 32 [2024-11-11 19:29:00,541 INFO L226 Difference]: Without dead ends: 30 [2024-11-11 19:29:00,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 19:29:00,544 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 10 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:29:00,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 44 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:29:00,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-11 19:29:00,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2024-11-11 19:29:00,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:29:00,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2024-11-11 19:29:00,553 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 16 [2024-11-11 19:29:00,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:29:00,554 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2024-11-11 19:29:00,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:29:00,554 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2024-11-11 19:29:00,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-11 19:29:00,555 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:29:00,556 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:29:00,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 19:29:00,556 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:29:00,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:29:00,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1676297287, now seen corresponding path program 1 times [2024-11-11 19:29:00,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:29:00,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424331619] [2024-11-11 19:29:00,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:29:00,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:29:00,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:29:00,853 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:29:00,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:29:00,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424331619] [2024-11-11 19:29:00,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424331619] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:29:00,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:29:00,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 19:29:00,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151211183] [2024-11-11 19:29:00,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:29:00,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 19:29:00,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:29:00,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 19:29:00,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 19:29:00,855 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:29:00,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:29:00,916 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2024-11-11 19:29:00,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 19:29:00,916 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-11 19:29:00,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:29:00,918 INFO L225 Difference]: With dead ends: 34 [2024-11-11 19:29:00,918 INFO L226 Difference]: Without dead ends: 27 [2024-11-11 19:29:00,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 19:29:00,921 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 7 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:29:00,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 45 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:29:00,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-11 19:29:00,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2024-11-11 19:29:00,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:29:00,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2024-11-11 19:29:00,927 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 16 [2024-11-11 19:29:00,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:29:00,928 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2024-11-11 19:29:00,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:29:00,929 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2024-11-11 19:29:00,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-11 19:29:00,931 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:29:00,931 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:29:00,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 19:29:00,932 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:29:00,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:29:00,932 INFO L85 PathProgramCache]: Analyzing trace with hash 224729872, now seen corresponding path program 1 times [2024-11-11 19:29:00,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:29:00,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349871742] [2024-11-11 19:29:00,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:29:00,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:29:00,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:29:01,452 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:29:01,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:29:01,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349871742] [2024-11-11 19:29:01,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349871742] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:29:01,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401523332] [2024-11-11 19:29:01,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:29:01,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:29:01,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:29:01,457 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) [2024-11-11 19:29:01,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 19:29:01,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:29:01,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-11 19:29:01,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:29:01,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 15 [2024-11-11 19:29:01,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 15 [2024-11-11 19:29:01,771 INFO L349 Elim1Store]: treesize reduction 16, result has 55.6 percent of original size [2024-11-11 19:29:01,772 INFO L378 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 34 [2024-11-11 19:29:01,802 INFO L349 Elim1Store]: treesize reduction 16, result has 50.0 percent of original size [2024-11-11 19:29:01,802 INFO L378 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 37 [2024-11-11 19:29:02,468 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-11 19:29:02,474 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26 [2024-11-11 19:29:02,485 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:29:02,485 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:29:02,664 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:29:02,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 111 [2024-11-11 19:29:02,679 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:29:02,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 133 treesize of output 137 [2024-11-11 19:29:02,795 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:29:02,796 INFO L378 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 269 treesize of output 258 [2024-11-11 19:29:03,011 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:29:03,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401523332] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:29:03,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:29:03,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 11 [2024-11-11 19:29:03,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366537507] [2024-11-11 19:29:03,013 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:29:03,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-11 19:29:03,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:29:03,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-11 19:29:03,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-11 19:29:03,015 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:29:03,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:29:03,153 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2024-11-11 19:29:03,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 19:29:03,154 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-11 19:29:03,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:29:03,154 INFO L225 Difference]: With dead ends: 47 [2024-11-11 19:29:03,154 INFO L226 Difference]: Without dead ends: 33 [2024-11-11 19:29:03,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-11-11 19:29:03,156 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 32 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 19:29:03,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 105 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 19:29:03,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-11 19:29:03,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-11 19:29:03,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:29:03,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2024-11-11 19:29:03,160 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 21 [2024-11-11 19:29:03,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:29:03,160 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2024-11-11 19:29:03,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:29:03,161 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2024-11-11 19:29:03,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-11 19:29:03,161 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:29:03,161 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:29:03,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-11 19:29:03,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:29:03,362 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:29:03,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:29:03,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1647090469, now seen corresponding path program 2 times [2024-11-11 19:29:03,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:29:03,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211155460] [2024-11-11 19:29:03,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:29:03,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:29:03,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:29:04,111 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:29:04,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:29:04,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211155460] [2024-11-11 19:29:04,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211155460] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:29:04,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041807541] [2024-11-11 19:29:04,112 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 19:29:04,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:29:04,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:29:04,113 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) [2024-11-11 19:29:04,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 19:29:04,232 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-11 19:29:04,232 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 19:29:04,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 74 conjuncts are in the unsatisfiable core [2024-11-11 19:29:04,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:29:04,260 INFO L378 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 10 treesize of output 9 [2024-11-11 19:29:04,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-11 19:29:04,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-11 19:29:04,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 1 [2024-11-11 19:29:04,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2024-11-11 19:29:04,338 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-11 19:29:04,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 15 [2024-11-11 19:29:04,374 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 26 [2024-11-11 19:29:04,392 INFO L349 Elim1Store]: treesize reduction 37, result has 43.9 percent of original size [2024-11-11 19:29:04,393 INFO L378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2024-11-11 19:29:04,397 INFO L378 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 [2024-11-11 19:29:04,412 INFO L349 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2024-11-11 19:29:04,412 INFO L378 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 23 treesize of output 23 [2024-11-11 19:29:04,521 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-11 19:29:04,527 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 40 [2024-11-11 19:29:04,531 INFO L378 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 21 [2024-11-11 19:29:04,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2024-11-11 19:29:04,565 INFO L378 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 [2024-11-11 19:29:04,570 INFO L378 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 17 treesize of output 9 [2024-11-11 19:29:04,574 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:29:04,574 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:29:04,746 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:29:04,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041807541] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:29:04,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:29:04,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 11 [2024-11-11 19:29:04,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798370914] [2024-11-11 19:29:04,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:29:04,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-11 19:29:04,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:29:04,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-11 19:29:04,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-11 19:29:04,748 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:29:04,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:29:04,947 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2024-11-11 19:29:04,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 19:29:04,948 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-11 19:29:04,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:29:04,949 INFO L225 Difference]: With dead ends: 44 [2024-11-11 19:29:04,949 INFO L226 Difference]: Without dead ends: 42 [2024-11-11 19:29:04,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2024-11-11 19:29:04,950 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 17 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 19:29:04,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 122 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 19:29:04,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-11 19:29:04,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2024-11-11 19:29:04,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 37 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:29:04,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2024-11-11 19:29:04,958 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 28 [2024-11-11 19:29:04,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:29:04,958 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2024-11-11 19:29:04,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:29:04,958 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2024-11-11 19:29:04,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-11 19:29:04,959 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:29:04,959 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:29:04,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 19:29:05,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-11 19:29:05,164 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:29:05,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:29:05,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1647092391, now seen corresponding path program 1 times [2024-11-11 19:29:05,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:29:05,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419436101] [2024-11-11 19:29:05,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:29:05,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:29:05,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:29:05,774 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:29:05,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:29:05,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419436101] [2024-11-11 19:29:05,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419436101] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:29:05,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427008763] [2024-11-11 19:29:05,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:29:05,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:29:05,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:29:05,777 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) [2024-11-11 19:29:05,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 19:29:05,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:29:05,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 86 conjuncts are in the unsatisfiable core [2024-11-11 19:29:05,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:29:05,942 INFO L378 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 10 treesize of output 9 [2024-11-11 19:29:05,948 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-11-11 19:29:05,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2024-11-11 19:29:05,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 1 [2024-11-11 19:29:05,963 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-11 19:29:05,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2024-11-11 19:29:06,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:29:06,094 INFO L378 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 46 treesize of output 30 [2024-11-11 19:29:06,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:29:06,108 INFO L378 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 46 treesize of output 30 [2024-11-11 19:29:06,135 INFO L349 Elim1Store]: treesize reduction 16, result has 55.6 percent of original size [2024-11-11 19:29:06,136 INFO L378 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 59 [2024-11-11 19:29:06,164 INFO L349 Elim1Store]: treesize reduction 16, result has 50.0 percent of original size [2024-11-11 19:29:06,164 INFO L378 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 37 [2024-11-11 19:29:06,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:29:06,197 INFO L378 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 13 [2024-11-11 19:29:06,210 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-11 19:29:06,211 INFO L378 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 15 treesize of output 15 [2024-11-11 19:29:07,368 INFO L349 Elim1Store]: treesize reduction 72, result has 44.6 percent of original size [2024-11-11 19:29:07,369 INFO L378 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 4 new quantified variables, introduced 9 case distinctions, treesize of input 353 treesize of output 294 [2024-11-11 19:29:07,433 INFO L349 Elim1Store]: treesize reduction 108, result has 16.9 percent of original size [2024-11-11 19:29:07,434 INFO L378 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 4 new quantified variables, introduced 9 case distinctions, treesize of input 233 treesize of output 234 [2024-11-11 19:29:07,526 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:29:07,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 15 case distinctions, treesize of input 222 treesize of output 275 [2024-11-11 19:29:07,609 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:29:07,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 166 treesize of output 230 [2024-11-11 19:29:16,436 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:29:16,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 23 select indices, 23 select index equivalence classes, 0 disjoint index pairs (out of 253 index pairs), introduced 23 new quantified variables, introduced 253 case distinctions, treesize of input 678 treesize of output 2522 [2024-11-11 19:29:17,986 INFO L349 Elim1Store]: treesize reduction 201, result has 75.8 percent of original size [2024-11-11 19:29:17,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 91 case distinctions, treesize of input 485 treesize of output 1052 [2024-11-11 19:29:19,211 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:29:19,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 78 case distinctions, treesize of input 435 treesize of output 955 [2024-11-11 19:29:44,611 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:29:44,612 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:29:45,116 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#list~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (and (forall ((|v_ULTIMATE.start_append_to_list_~node~0#1.base_24| Int) (v_ArrVal_309 (Array Int Int)) (|v_ULTIMATE.start_append_to_list_~list#1.offset_24| Int) (v_ArrVal_313 (Array Int Int)) (v_ArrVal_312 (Array Int Int))) (let ((.cse2 (select (store .cse0 |v_ULTIMATE.start_append_to_list_~list#1.offset_24| |v_ULTIMATE.start_append_to_list_~node~0#1.base_24|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) (.cse3 (+ (select (store .cse4 |v_ULTIMATE.start_append_to_list_~list#1.offset_24| 0) |c_ULTIMATE.start_main_~#list~0#1.offset|) 4))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_to_list_~node~0#1.base_24| v_ArrVal_312) .cse2) .cse3))) (or (not (= v_ArrVal_312 (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_to_list_~node~0#1.base_24|) 4 (select .cse0 |v_ULTIMATE.start_append_to_list_~list#1.offset_24|)) 0 (select v_ArrVal_312 0)))) (< |c_ULTIMATE.start_main_~base~0#1| (+ (select (select (store |c_#memory_int#1| |v_ULTIMATE.start_append_to_list_~node~0#1.base_24| v_ArrVal_309) .cse1) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_to_list_~node~0#1.base_24| v_ArrVal_313) .cse2) .cse3)) 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_to_list_~node~0#1.base_24|) 0)) (not (= v_ArrVal_313 (store (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_to_list_~node~0#1.base_24|) 4 (select .cse4 |v_ULTIMATE.start_append_to_list_~list#1.offset_24|)) 0 (select v_ArrVal_313 0)))) (= .cse1 0))))) (forall ((|v_ULTIMATE.start_append_to_list_~node~0#1.base_24| Int) (v_ArrVal_309 (Array Int Int)) (|v_ULTIMATE.start_append_to_list_~list#1.offset_24| Int) (v_ArrVal_313 (Array Int Int)) (v_ArrVal_312 (Array Int Int))) (let ((.cse5 (select (store .cse0 |v_ULTIMATE.start_append_to_list_~list#1.offset_24| |v_ULTIMATE.start_append_to_list_~node~0#1.base_24|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) (.cse6 (+ (select (store .cse4 |v_ULTIMATE.start_append_to_list_~list#1.offset_24| 0) |c_ULTIMATE.start_main_~#list~0#1.offset|) 4))) (let ((.cse7 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_to_list_~node~0#1.base_24| v_ArrVal_313) .cse5) .cse6))) (or (not (= v_ArrVal_312 (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_to_list_~node~0#1.base_24|) 4 (select .cse0 |v_ULTIMATE.start_append_to_list_~list#1.offset_24|)) 0 (select v_ArrVal_312 0)))) (< |c_ULTIMATE.start_main_~base~0#1| (+ (select (select (store |c_#memory_int#1| |v_ULTIMATE.start_append_to_list_~node~0#1.base_24| v_ArrVal_309) (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_to_list_~node~0#1.base_24| v_ArrVal_312) .cse5) .cse6)) .cse7) 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_to_list_~node~0#1.base_24|) 0)) (= .cse7 0) (not (= v_ArrVal_313 (store (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_to_list_~node~0#1.base_24|) 4 (select .cse4 |v_ULTIMATE.start_append_to_list_~list#1.offset_24|)) 0 (select v_ArrVal_313 0)))))))))) is different from false [2024-11-11 19:29:45,471 INFO L349 Elim1Store]: treesize reduction 80, result has 50.3 percent of original size [2024-11-11 19:29:45,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 1698 treesize of output 1724 [2024-11-11 19:29:45,499 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:29:45,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 1179 treesize of output 1124 [2024-11-11 19:29:45,531 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:29:45,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 1115 treesize of output 971 [2024-11-11 19:29:45,637 INFO L349 Elim1Store]: treesize reduction 80, result has 50.3 percent of original size [2024-11-11 19:29:45,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 1526 treesize of output 1492 [2024-11-11 19:29:46,059 INFO L349 Elim1Store]: treesize reduction 205, result has 84.2 percent of original size [2024-11-11 19:29:46,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 1369 treesize of output 2181 [2024-11-11 19:29:46,114 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:29:46,115 INFO L378 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 1083 treesize of output 1056 [2024-11-11 19:29:46,182 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:29:46,183 INFO L378 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 1019 treesize of output 1024 [2024-11-11 19:29:46,253 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:29:46,254 INFO L378 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 957 treesize of output 930 [2024-11-11 19:29:47,460 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-11 19:29:47,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:29:47,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:29:47,601 INFO L349 Elim1Store]: treesize reduction 14, result has 22.2 percent of original size [2024-11-11 19:29:47,601 INFO L378 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 28 treesize of output 16 [2024-11-11 19:29:47,649 INFO L378 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 101 treesize of output 87 [2024-11-11 19:29:47,738 INFO L349 Elim1Store]: treesize reduction 126, result has 9.4 percent of original size [2024-11-11 19:29:47,738 INFO L378 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 207 treesize of output 175 [2024-11-11 19:29:47,824 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-11-11 19:29:47,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427008763] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:29:47,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:29:47,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 16 [2024-11-11 19:29:47,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571455644] [2024-11-11 19:29:47,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:29:47,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-11 19:29:47,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:29:47,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-11 19:29:47,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=165, Unknown=1, NotChecked=26, Total=240 [2024-11-11 19:29:47,829 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. Second operand has 16 states, 16 states have (on average 4.4375) internal successors, (71), 16 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:29:50,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:29:50,475 INFO L93 Difference]: Finished difference Result 72 states and 88 transitions. [2024-11-11 19:29:50,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-11 19:29:50,476 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.4375) internal successors, (71), 16 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-11 19:29:50,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:29:50,477 INFO L225 Difference]: With dead ends: 72 [2024-11-11 19:29:50,477 INFO L226 Difference]: Without dead ends: 65 [2024-11-11 19:29:50,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=213, Invalid=546, Unknown=1, NotChecked=52, Total=812 [2024-11-11 19:29:50,478 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 122 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 17 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 69 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-11 19:29:50,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 157 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 137 Invalid, 1 Unknown, 69 Unchecked, 0.9s Time] [2024-11-11 19:29:50,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-11 19:29:50,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 38. [2024-11-11 19:29:50,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:29:50,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2024-11-11 19:29:50,488 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 28 [2024-11-11 19:29:50,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:29:50,489 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2024-11-11 19:29:50,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.4375) internal successors, (71), 16 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:29:50,489 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2024-11-11 19:29:50,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-11 19:29:50,490 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:29:50,490 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-11-11 19:29:50,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-11 19:29:50,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:29:50,691 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:29:50,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:29:50,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1244702494, now seen corresponding path program 3 times [2024-11-11 19:29:50,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:29:50,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650613727] [2024-11-11 19:29:50,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:29:50,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:29:50,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:29:51,522 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:29:51,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:29:51,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650613727] [2024-11-11 19:29:51,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650613727] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:29:51,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69899074] [2024-11-11 19:29:51,523 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-11 19:29:51,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:29:51,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:29:51,526 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) [2024-11-11 19:29:51,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-11 19:29:51,676 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-11 19:29:51,676 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 19:29:51,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 79 conjuncts are in the unsatisfiable core [2024-11-11 19:29:51,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:29:51,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 15 [2024-11-11 19:29:51,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 15 [2024-11-11 19:29:51,765 INFO L349 Elim1Store]: treesize reduction 16, result has 50.0 percent of original size [2024-11-11 19:29:51,765 INFO L378 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 37 [2024-11-11 19:29:51,793 INFO L349 Elim1Store]: treesize reduction 16, result has 55.6 percent of original size [2024-11-11 19:29:51,793 INFO L378 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 34 [2024-11-11 19:29:51,800 INFO L378 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 10 treesize of output 9 [2024-11-11 19:29:52,306 INFO L349 Elim1Store]: treesize reduction 72, result has 44.6 percent of original size [2024-11-11 19:29:52,307 INFO L378 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 4 new quantified variables, introduced 9 case distinctions, treesize of input 167 treesize of output 177 [2024-11-11 19:29:52,357 INFO L349 Elim1Store]: treesize reduction 96, result has 18.6 percent of original size [2024-11-11 19:29:52,357 INFO L378 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 4 new quantified variables, introduced 9 case distinctions, treesize of input 140 treesize of output 141 [2024-11-11 19:29:52,410 INFO L349 Elim1Store]: treesize reduction 48, result has 56.8 percent of original size [2024-11-11 19:29:52,410 INFO L378 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 3 case distinctions, treesize of input 152 treesize of output 179 [2024-11-11 19:29:52,478 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:29:52,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 115 treesize of output 221 [2024-11-11 19:29:52,535 INFO L349 Elim1Store]: treesize reduction 64, result has 49.6 percent of original size [2024-11-11 19:29:52,535 INFO L378 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 3 case distinctions, treesize of input 128 treesize of output 136