./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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/list-ext2-properties/list_and_tree_cnstr-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 2971ec3e9ef2eef1d2151174358645d6ce0c6d4fe66ae89c00ded0f196979d8a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 21:59:20,748 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 21:59:20,822 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 21:59:20,826 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 21:59:20,827 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 21:59:20,863 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 21:59:20,863 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 21:59:20,864 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 21:59:20,864 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 21:59:20,866 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 21:59:20,866 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 21:59:20,866 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 21:59:20,867 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 21:59:20,867 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 21:59:20,867 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 21:59:20,867 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 21:59:20,868 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 21:59:20,868 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 21:59:20,868 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 21:59:20,868 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 21:59:20,868 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 21:59:20,869 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 21:59:20,869 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 21:59:20,869 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 21:59:20,869 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 21:59:20,869 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 21:59:20,869 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 21:59:20,870 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 21:59:20,870 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 21:59:20,870 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 21:59:20,870 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 21:59:20,870 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 21:59:20,870 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 21:59:20,870 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 21:59:20,871 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 21:59:20,871 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 21:59:20,871 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 21:59:20,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 21:59:20,871 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 21:59:20,871 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 21:59:20,871 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 21:59:20,873 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 21:59:20,873 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 -> 2971ec3e9ef2eef1d2151174358645d6ce0c6d4fe66ae89c00ded0f196979d8a [2024-11-09 21:59:21,073 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 21:59:21,098 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 21:59:21,100 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 21:59:21,103 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 21:59:21,103 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 21:59:21,104 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i [2024-11-09 21:59:22,399 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 21:59:22,620 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 21:59:22,620 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i [2024-11-09 21:59:22,633 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccf50625b/ce53494d0ecb40e1ab4ba2fe2d6ab763/FLAG36723a429 [2024-11-09 21:59:22,981 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccf50625b/ce53494d0ecb40e1ab4ba2fe2d6ab763 [2024-11-09 21:59:22,983 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 21:59:22,984 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 21:59:22,989 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 21:59:22,989 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 21:59:22,993 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 21:59:22,993 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 09:59:22" (1/1) ... [2024-11-09 21:59:22,994 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c6482ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:59:22, skipping insertion in model container [2024-11-09 21:59:22,994 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 09:59:22" (1/1) ... [2024-11-09 21:59:23,030 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 21:59:23,262 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/list-ext2-properties/list_and_tree_cnstr-1.i[24291,24304] [2024-11-09 21:59:23,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 21:59:23,282 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 21:59:23,341 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/list-ext2-properties/list_and_tree_cnstr-1.i[24291,24304] [2024-11-09 21:59:23,343 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 21:59:23,371 INFO L204 MainTranslator]: Completed translation [2024-11-09 21:59:23,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:59:23 WrapperNode [2024-11-09 21:59:23,372 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 21:59:23,373 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 21:59:23,373 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 21:59:23,373 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 21:59:23,379 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:59:23" (1/1) ... [2024-11-09 21:59:23,391 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:59:23" (1/1) ... [2024-11-09 21:59:23,425 INFO L138 Inliner]: procedures = 122, calls = 54, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 196 [2024-11-09 21:59:23,425 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 21:59:23,426 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 21:59:23,426 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 21:59:23,426 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 21:59:23,434 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:59:23" (1/1) ... [2024-11-09 21:59:23,434 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:59:23" (1/1) ... [2024-11-09 21:59:23,441 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:59:23" (1/1) ... [2024-11-09 21:59:23,466 INFO L175 MemorySlicer]: Split 40 memory accesses to 3 slices as follows [2, 12, 26]. 65 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 15 writes are split as follows [0, 5, 10]. [2024-11-09 21:59:23,466 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:59:23" (1/1) ... [2024-11-09 21:59:23,466 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:59:23" (1/1) ... [2024-11-09 21:59:23,473 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:59:23" (1/1) ... [2024-11-09 21:59:23,474 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:59:23" (1/1) ... [2024-11-09 21:59:23,475 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:59:23" (1/1) ... [2024-11-09 21:59:23,476 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:59:23" (1/1) ... [2024-11-09 21:59:23,479 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 21:59:23,479 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 21:59:23,480 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 21:59:23,480 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 21:59:23,481 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:59:23" (1/1) ... [2024-11-09 21:59:23,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 21:59:23,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 21:59:23,527 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-09 21:59:23,531 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-09 21:59:23,574 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-09 21:59:23,574 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-09 21:59:23,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 21:59:23,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 21:59:23,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 21:59:23,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 21:59:23,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 21:59:23,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 21:59:23,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 21:59:23,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 21:59:23,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 21:59:23,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 21:59:23,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 21:59:23,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 21:59:23,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 21:59:23,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 21:59:23,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 21:59:23,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 21:59:23,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 21:59:23,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 21:59:23,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 21:59:23,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 21:59:23,672 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 21:59:23,674 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 21:59:23,702 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-09 21:59:23,931 INFO L? ?]: Removed 52 outVars from TransFormulas that were not future-live. [2024-11-09 21:59:23,931 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 21:59:23,940 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 21:59:23,940 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 21:59:23,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 09:59:23 BoogieIcfgContainer [2024-11-09 21:59:23,941 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 21:59:23,942 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 21:59:23,943 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 21:59:23,945 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 21:59:23,945 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 09:59:22" (1/3) ... [2024-11-09 21:59:23,945 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34092d10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 09:59:23, skipping insertion in model container [2024-11-09 21:59:23,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:59:23" (2/3) ... [2024-11-09 21:59:23,946 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34092d10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 09:59:23, skipping insertion in model container [2024-11-09 21:59:23,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 09:59:23" (3/3) ... [2024-11-09 21:59:23,947 INFO L112 eAbstractionObserver]: Analyzing ICFG list_and_tree_cnstr-1.i [2024-11-09 21:59:23,959 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 21:59:23,959 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 21:59:24,013 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 21:59:24,018 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;@2bd7824d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 21:59:24,018 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 21:59:24,022 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 50 states have (on average 1.62) internal successors, (81), 53 states have internal predecessors, (81), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 21:59:24,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 21:59:24,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:59:24,029 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:59:24,029 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:59:24,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:59:24,035 INFO L85 PathProgramCache]: Analyzing trace with hash 857828685, now seen corresponding path program 1 times [2024-11-09 21:59:24,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:59:24,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014008537] [2024-11-09 21:59:24,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:59:24,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:59:24,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:59:24,230 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-09 21:59:24,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:59:24,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014008537] [2024-11-09 21:59:24,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014008537] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 21:59:24,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 21:59:24,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 21:59:24,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965611063] [2024-11-09 21:59:24,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 21:59:24,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 21:59:24,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:59:24,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 21:59:24,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 21:59:24,264 INFO L87 Difference]: Start difference. First operand has 55 states, 50 states have (on average 1.62) internal successors, (81), 53 states have internal predecessors, (81), 3 states have call successors, (3), 1 states have call predecessors, (3), 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 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 21:59:24,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:59:24,285 INFO L93 Difference]: Finished difference Result 107 states and 165 transitions. [2024-11-09 21:59:24,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 21:59:24,287 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-09 21:59:24,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:59:24,292 INFO L225 Difference]: With dead ends: 107 [2024-11-09 21:59:24,292 INFO L226 Difference]: Without dead ends: 45 [2024-11-09 21:59:24,295 INFO L431 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-09 21:59:24,300 INFO L432 NwaCegarLoop]: 74 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, 74 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-09 21:59:24,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 21:59:24,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-09 21:59:24,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-11-09 21:59:24,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.4090909090909092) internal successors, (62), 44 states have internal predecessors, (62), 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-09 21:59:24,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 62 transitions. [2024-11-09 21:59:24,377 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 62 transitions. Word has length 17 [2024-11-09 21:59:24,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:59:24,377 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 62 transitions. [2024-11-09 21:59:24,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 21:59:24,378 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2024-11-09 21:59:24,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 21:59:24,379 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:59:24,415 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:59:24,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 21:59:24,416 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:59:24,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:59:24,417 INFO L85 PathProgramCache]: Analyzing trace with hash 2019286128, now seen corresponding path program 1 times [2024-11-09 21:59:24,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:59:24,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685096617] [2024-11-09 21:59:24,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:59:24,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:59:24,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:59:24,521 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-09 21:59:24,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:59:24,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685096617] [2024-11-09 21:59:24,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685096617] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 21:59:24,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 21:59:24,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 21:59:24,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783592913] [2024-11-09 21:59:24,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 21:59:24,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 21:59:24,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:59:24,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 21:59:24,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 21:59:24,526 INFO L87 Difference]: Start difference. First operand 45 states and 62 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 21:59:24,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:59:24,547 INFO L93 Difference]: Finished difference Result 75 states and 101 transitions. [2024-11-09 21:59:24,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 21:59:24,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-09 21:59:24,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:59:24,549 INFO L225 Difference]: With dead ends: 75 [2024-11-09 21:59:24,549 INFO L226 Difference]: Without dead ends: 54 [2024-11-09 21:59:24,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 21:59:24,550 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 30 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 21:59:24,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 98 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 21:59:24,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-09 21:59:24,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-09 21:59:24,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 53 states have internal predecessors, (76), 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-09 21:59:24,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 76 transitions. [2024-11-09 21:59:24,562 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 76 transitions. Word has length 23 [2024-11-09 21:59:24,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:59:24,563 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 76 transitions. [2024-11-09 21:59:24,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 21:59:24,563 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 76 transitions. [2024-11-09 21:59:24,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 21:59:24,564 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:59:24,565 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:59:24,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 21:59:24,565 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:59:24,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:59:24,567 INFO L85 PathProgramCache]: Analyzing trace with hash 627002898, now seen corresponding path program 1 times [2024-11-09 21:59:24,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:59:24,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115193895] [2024-11-09 21:59:24,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:59:24,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:59:24,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:59:24,630 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-09 21:59:24,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:59:24,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115193895] [2024-11-09 21:59:24,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115193895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 21:59:24,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 21:59:24,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 21:59:24,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227177795] [2024-11-09 21:59:24,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 21:59:24,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 21:59:24,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:59:24,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 21:59:24,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 21:59:24,633 INFO L87 Difference]: Start difference. First operand 54 states and 76 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 21:59:24,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:59:24,655 INFO L93 Difference]: Finished difference Result 95 states and 133 transitions. [2024-11-09 21:59:24,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 21:59:24,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-09 21:59:24,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:59:24,657 INFO L225 Difference]: With dead ends: 95 [2024-11-09 21:59:24,658 INFO L226 Difference]: Without dead ends: 56 [2024-11-09 21:59:24,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 21:59:24,659 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 21:59:24,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 21:59:24,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-09 21:59:24,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-09 21:59:24,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 55 states have internal predecessors, (78), 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-09 21:59:24,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 78 transitions. [2024-11-09 21:59:24,666 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 78 transitions. Word has length 30 [2024-11-09 21:59:24,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:59:24,666 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 78 transitions. [2024-11-09 21:59:24,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 21:59:24,667 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 78 transitions. [2024-11-09 21:59:24,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 21:59:24,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:59:24,668 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:59:24,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 21:59:24,668 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:59:24,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:59:24,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1629908109, now seen corresponding path program 1 times [2024-11-09 21:59:24,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:59:24,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096736530] [2024-11-09 21:59:24,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:59:24,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:59:24,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:59:24,878 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 21:59:24,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:59:24,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096736530] [2024-11-09 21:59:24,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096736530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 21:59:24,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 21:59:24,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 21:59:24,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921609470] [2024-11-09 21:59:24,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 21:59:24,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 21:59:24,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:59:24,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 21:59:24,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 21:59:24,882 INFO L87 Difference]: Start difference. First operand 56 states and 78 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-09 21:59:24,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:59:24,947 INFO L93 Difference]: Finished difference Result 74 states and 99 transitions. [2024-11-09 21:59:24,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 21:59:24,947 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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 30 [2024-11-09 21:59:24,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:59:24,948 INFO L225 Difference]: With dead ends: 74 [2024-11-09 21:59:24,948 INFO L226 Difference]: Without dead ends: 69 [2024-11-09 21:59:24,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 21:59:24,949 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 4 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 21:59:24,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 200 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 21:59:24,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-09 21:59:24,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2024-11-09 21:59:24,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.40625) internal successors, (90), 64 states have internal predecessors, (90), 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-09 21:59:24,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 90 transitions. [2024-11-09 21:59:24,961 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 90 transitions. Word has length 30 [2024-11-09 21:59:24,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:59:24,961 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 90 transitions. [2024-11-09 21:59:24,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-09 21:59:24,963 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 90 transitions. [2024-11-09 21:59:24,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 21:59:24,964 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:59:24,964 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:59:24,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 21:59:24,964 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:59:24,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:59:24,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1051658190, now seen corresponding path program 1 times [2024-11-09 21:59:24,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:59:24,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231696470] [2024-11-09 21:59:24,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:59:24,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:59:24,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:59:25,100 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 21:59:25,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:59:25,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231696470] [2024-11-09 21:59:25,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231696470] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 21:59:25,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 21:59:25,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 21:59:25,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613256411] [2024-11-09 21:59:25,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 21:59:25,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 21:59:25,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:59:25,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 21:59:25,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 21:59:25,103 INFO L87 Difference]: Start difference. First operand 65 states and 90 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 21:59:25,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:59:25,162 INFO L93 Difference]: Finished difference Result 76 states and 101 transitions. [2024-11-09 21:59:25,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 21:59:25,164 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-09 21:59:25,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:59:25,164 INFO L225 Difference]: With dead ends: 76 [2024-11-09 21:59:25,164 INFO L226 Difference]: Without dead ends: 67 [2024-11-09 21:59:25,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 21:59:25,165 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 5 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 21:59:25,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 203 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 21:59:25,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-09 21:59:25,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2024-11-09 21:59:25,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.403225806451613) internal successors, (87), 62 states have internal predecessors, (87), 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-09 21:59:25,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 87 transitions. [2024-11-09 21:59:25,178 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 87 transitions. Word has length 32 [2024-11-09 21:59:25,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:59:25,178 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 87 transitions. [2024-11-09 21:59:25,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 21:59:25,178 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 87 transitions. [2024-11-09 21:59:25,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 21:59:25,179 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:59:25,179 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:59:25,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 21:59:25,179 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:59:25,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:59:25,180 INFO L85 PathProgramCache]: Analyzing trace with hash 750375026, now seen corresponding path program 1 times [2024-11-09 21:59:25,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:59:25,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100415623] [2024-11-09 21:59:25,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:59:25,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:59:25,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:59:25,282 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 21:59:25,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:59:25,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100415623] [2024-11-09 21:59:25,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100415623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 21:59:25,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 21:59:25,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 21:59:25,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335436399] [2024-11-09 21:59:25,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 21:59:25,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 21:59:25,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:59:25,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 21:59:25,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 21:59:25,286 INFO L87 Difference]: Start difference. First operand 63 states and 87 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 21:59:25,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:59:25,367 INFO L93 Difference]: Finished difference Result 76 states and 101 transitions. [2024-11-09 21:59:25,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 21:59:25,368 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-09 21:59:25,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:59:25,368 INFO L225 Difference]: With dead ends: 76 [2024-11-09 21:59:25,368 INFO L226 Difference]: Without dead ends: 64 [2024-11-09 21:59:25,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 21:59:25,370 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 5 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 21:59:25,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 207 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 21:59:25,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-09 21:59:25,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2024-11-09 21:59:25,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 59 states have internal predecessors, (83), 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-09 21:59:25,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 83 transitions. [2024-11-09 21:59:25,394 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 83 transitions. Word has length 32 [2024-11-09 21:59:25,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:59:25,394 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 83 transitions. [2024-11-09 21:59:25,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 21:59:25,395 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 83 transitions. [2024-11-09 21:59:25,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 21:59:25,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:59:25,395 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:59:25,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 21:59:25,398 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:59:25,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:59:25,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1305698793, now seen corresponding path program 1 times [2024-11-09 21:59:25,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:59:25,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279571920] [2024-11-09 21:59:25,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:59:25,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:59:25,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:59:25,773 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 21:59:25,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:59:25,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279571920] [2024-11-09 21:59:25,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279571920] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 21:59:25,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755508790] [2024-11-09 21:59:25,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:59:25,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 21:59:25,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 21:59:25,781 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-09 21:59:25,786 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-09 21:59:25,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:59:25,910 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 21:59:25,915 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 21:59:25,958 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 6 treesize of output 5 [2024-11-09 21:59:26,025 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 21:59:26,026 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 11 treesize of output 11 [2024-11-09 21:59:26,032 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-09 21:59:26,075 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 27 treesize of output 11 [2024-11-09 21:59:26,088 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 16 treesize of output 11 [2024-11-09 21:59:26,101 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 21:59:26,101 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 21:59:26,158 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_199 (Array Int Int)) (v_ArrVal_198 (Array Int Int))) (or (= 2 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_198) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (= v_ArrVal_198 (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_198 .cse0))))))) is different from false [2024-11-09 21:59:26,189 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 21:59:26,190 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 70 treesize of output 74 [2024-11-09 21:59:26,199 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 50 treesize of output 46 [2024-11-09 21:59:26,248 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 5 treesize of output 3 [2024-11-09 21:59:26,263 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 102 treesize of output 98 [2024-11-09 21:59:26,389 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 21:59:26,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755508790] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 21:59:26,390 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 21:59:26,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2024-11-09 21:59:26,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992005560] [2024-11-09 21:59:26,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 21:59:26,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 21:59:26,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:59:26,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 21:59:26,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=101, Unknown=3, NotChecked=20, Total=156 [2024-11-09 21:59:26,393 INFO L87 Difference]: Start difference. First operand 60 states and 83 transitions. Second operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 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-09 21:59:26,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:59:26,549 INFO L93 Difference]: Finished difference Result 78 states and 103 transitions. [2024-11-09 21:59:26,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 21:59:26,549 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 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) Word has length 34 [2024-11-09 21:59:26,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:59:26,550 INFO L225 Difference]: With dead ends: 78 [2024-11-09 21:59:26,550 INFO L226 Difference]: Without dead ends: 71 [2024-11-09 21:59:26,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=180, Unknown=3, NotChecked=28, Total=272 [2024-11-09 21:59:26,551 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 35 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 21:59:26,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 393 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 112 Invalid, 0 Unknown, 35 Unchecked, 0.1s Time] [2024-11-09 21:59:26,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-09 21:59:26,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67. [2024-11-09 21:59:26,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.378787878787879) internal successors, (91), 66 states have internal predecessors, (91), 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-09 21:59:26,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 91 transitions. [2024-11-09 21:59:26,557 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 91 transitions. Word has length 34 [2024-11-09 21:59:26,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:59:26,558 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 91 transitions. [2024-11-09 21:59:26,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 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-09 21:59:26,558 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 91 transitions. [2024-11-09 21:59:26,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 21:59:26,558 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:59:26,559 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:59:26,573 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-09 21:59:26,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 21:59:26,760 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:59:26,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:59:26,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1229511703, now seen corresponding path program 1 times [2024-11-09 21:59:26,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:59:26,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341767525] [2024-11-09 21:59:26,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:59:26,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:59:26,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:59:27,008 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 21:59:27,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:59:27,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341767525] [2024-11-09 21:59:27,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341767525] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 21:59:27,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711794241] [2024-11-09 21:59:27,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:59:27,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 21:59:27,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 21:59:27,011 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-09 21:59:27,012 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-09 21:59:27,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:59:27,104 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 21:59:27,106 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 21:59:27,113 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 6 treesize of output 5 [2024-11-09 21:59:27,130 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-09 21:59:27,139 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 21:59:27,140 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 11 treesize of output 11 [2024-11-09 21:59:27,159 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 27 treesize of output 11 [2024-11-09 21:59:27,183 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 16 treesize of output 11 [2024-11-09 21:59:27,189 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 21:59:27,190 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 21:59:27,199 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_277 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_277) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2024-11-09 21:59:27,233 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 21:59:27,233 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 2 case distinctions, treesize of input 23 treesize of output 29 [2024-11-09 21:59:27,240 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 21:59:27,240 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 30 treesize of output 33 [2024-11-09 21:59:27,245 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 9 treesize of output 7 [2024-11-09 21:59:27,292 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2024-11-09 21:59:27,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711794241] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 21:59:27,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 21:59:27,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2024-11-09 21:59:27,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274452966] [2024-11-09 21:59:27,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 21:59:27,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 21:59:27,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:59:27,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 21:59:27,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=4, NotChecked=18, Total=132 [2024-11-09 21:59:27,294 INFO L87 Difference]: Start difference. First operand 67 states and 91 transitions. Second operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 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-09 21:59:28,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:59:28,694 INFO L93 Difference]: Finished difference Result 83 states and 109 transitions. [2024-11-09 21:59:28,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 21:59:28,695 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 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 34 [2024-11-09 21:59:28,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:59:28,696 INFO L225 Difference]: With dead ends: 83 [2024-11-09 21:59:28,696 INFO L226 Difference]: Without dead ends: 78 [2024-11-09 21:59:28,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=62, Invalid=177, Unknown=5, NotChecked=28, Total=272 [2024-11-09 21:59:28,696 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 37 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 34 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 21:59:28,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 356 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 128 Invalid, 0 Unknown, 34 Unchecked, 0.3s Time] [2024-11-09 21:59:28,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-09 21:59:28,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2024-11-09 21:59:28,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.36) internal successors, (102), 75 states have internal predecessors, (102), 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-09 21:59:28,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 102 transitions. [2024-11-09 21:59:28,708 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 102 transitions. Word has length 34 [2024-11-09 21:59:28,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:59:28,708 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 102 transitions. [2024-11-09 21:59:28,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 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-09 21:59:28,708 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 102 transitions. [2024-11-09 21:59:28,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 21:59:28,709 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:59:28,709 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:59:28,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 21:59:28,909 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,SelfDestructingSolverStorable7 [2024-11-09 21:59:28,910 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:59:28,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:59:28,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1217084906, now seen corresponding path program 1 times [2024-11-09 21:59:28,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:59:28,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250172647] [2024-11-09 21:59:28,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:59:28,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:59:28,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:59:29,341 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 21:59:29,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:59:29,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250172647] [2024-11-09 21:59:29,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250172647] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 21:59:29,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680965409] [2024-11-09 21:59:29,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:59:29,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 21:59:29,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 21:59:29,345 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-09 21:59:29,348 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-09 21:59:29,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:59:29,434 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-09 21:59:29,436 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 21:59:29,505 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-09 21:59:29,510 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-09 21:59:29,563 INFO L349 Elim1Store]: treesize reduction 15, result has 37.5 percent of original size [2024-11-09 21:59:29,564 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 51 [2024-11-09 21:59:29,575 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-09 21:59:29,576 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 20 treesize of output 17 [2024-11-09 21:59:29,579 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 9 [2024-11-09 21:59:29,591 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 15 treesize of output 11 [2024-11-09 21:59:29,645 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 19 treesize of output 11 [2024-11-09 21:59:29,647 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 7 treesize of output 3 [2024-11-09 21:59:29,689 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 21:59:29,689 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 21:59:29,744 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 21:59:29,745 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 94 treesize of output 97 [2024-11-09 21:59:29,805 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 21:59:29,806 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 45 treesize of output 46 [2024-11-09 21:59:29,812 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 21:59:29,812 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 35 treesize of output 36 [2024-11-09 21:59:29,820 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 21:59:29,820 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 83 treesize of output 52 [2024-11-09 21:59:29,831 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 21:59:29,831 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 58 treesize of output 57 [2024-11-09 21:59:29,838 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 41 treesize of output 37 [2024-11-09 21:59:29,841 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 37 treesize of output 33 [2024-11-09 21:59:29,910 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 21:59:29,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [680965409] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 21:59:29,913 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 21:59:29,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2024-11-09 21:59:29,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152362179] [2024-11-09 21:59:29,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 21:59:29,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-09 21:59:29,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:59:29,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 21:59:29,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2024-11-09 21:59:29,914 INFO L87 Difference]: Start difference. First operand 76 states and 102 transitions. Second operand has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 21 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 21:59:30,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:59:30,260 INFO L93 Difference]: Finished difference Result 111 states and 144 transitions. [2024-11-09 21:59:30,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 21:59:30,261 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 21 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-09 21:59:30,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:59:30,262 INFO L225 Difference]: With dead ends: 111 [2024-11-09 21:59:30,262 INFO L226 Difference]: Without dead ends: 99 [2024-11-09 21:59:30,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=677, Unknown=0, NotChecked=0, Total=812 [2024-11-09 21:59:30,263 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 68 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 21:59:30,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 694 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 21:59:30,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-09 21:59:30,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 89. [2024-11-09 21:59:30,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 1.3409090909090908) internal successors, (118), 88 states have internal predecessors, (118), 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-09 21:59:30,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 118 transitions. [2024-11-09 21:59:30,268 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 118 transitions. Word has length 36 [2024-11-09 21:59:30,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:59:30,268 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 118 transitions. [2024-11-09 21:59:30,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 21 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 21:59:30,268 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 118 transitions. [2024-11-09 21:59:30,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 21:59:30,269 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:59:30,269 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:59:30,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 21:59:30,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 21:59:30,470 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:59:30,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:59:30,470 INFO L85 PathProgramCache]: Analyzing trace with hash 534448661, now seen corresponding path program 1 times [2024-11-09 21:59:30,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:59:30,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106990028] [2024-11-09 21:59:30,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:59:30,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:59:30,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:59:30,899 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 21:59:30,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:59:30,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106990028] [2024-11-09 21:59:30,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106990028] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 21:59:30,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442376240] [2024-11-09 21:59:30,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:59:30,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 21:59:30,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 21:59:30,904 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-09 21:59:30,905 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-09 21:59:30,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:59:31,004 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-09 21:59:31,006 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 21:59:31,008 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 6 treesize of output 5 [2024-11-09 21:59:31,051 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 21:59:31,051 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 11 treesize of output 11 [2024-11-09 21:59:31,071 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 19 treesize of output 1 [2024-11-09 21:59:31,075 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 19 treesize of output 1 [2024-11-09 21:59:31,108 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 21:59:31,108 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 73 [2024-11-09 21:59:31,111 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 29 treesize of output 19 [2024-11-09 21:59:31,113 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 40 treesize of output 23 [2024-11-09 21:59:31,133 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 39 treesize of output 21 [2024-11-09 21:59:31,136 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 23 treesize of output 11 [2024-11-09 21:59:31,141 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 21:59:31,142 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 21:59:31,182 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 52 treesize of output 30 [2024-11-09 21:59:31,187 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_426 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_426) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|)) (forall ((v_ArrVal_427 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_427) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)))) is different from false [2024-11-09 21:59:31,199 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 21:59:31,199 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 22 treesize of output 23 [2024-11-09 21:59:31,204 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 21:59:31,204 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 36 treesize of output 35 [2024-11-09 21:59:31,212 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 3 [2024-11-09 21:59:31,217 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 21:59:31,217 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 22 treesize of output 1 [2024-11-09 21:59:31,286 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2024-11-09 21:59:31,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442376240] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 21:59:31,287 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 21:59:31,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 21 [2024-11-09 21:59:31,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911753629] [2024-11-09 21:59:31,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 21:59:31,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-09 21:59:31,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:59:31,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 21:59:31,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=326, Unknown=1, NotChecked=36, Total=420 [2024-11-09 21:59:31,288 INFO L87 Difference]: Start difference. First operand 89 states and 118 transitions. Second operand has 21 states, 21 states have (on average 3.5238095238095237) internal successors, (74), 21 states have internal predecessors, (74), 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-09 21:59:31,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:59:31,608 INFO L93 Difference]: Finished difference Result 104 states and 133 transitions. [2024-11-09 21:59:31,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 21:59:31,609 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.5238095238095237) internal successors, (74), 21 states have internal predecessors, (74), 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 38 [2024-11-09 21:59:31,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:59:31,609 INFO L225 Difference]: With dead ends: 104 [2024-11-09 21:59:31,609 INFO L226 Difference]: Without dead ends: 85 [2024-11-09 21:59:31,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=591, Unknown=1, NotChecked=50, Total=756 [2024-11-09 21:59:31,610 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 75 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 81 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 21:59:31,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 580 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 273 Invalid, 0 Unknown, 81 Unchecked, 0.2s Time] [2024-11-09 21:59:31,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-09 21:59:31,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 79. [2024-11-09 21:59:31,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.3461538461538463) internal successors, (105), 78 states have internal predecessors, (105), 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-09 21:59:31,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 105 transitions. [2024-11-09 21:59:31,617 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 105 transitions. Word has length 38 [2024-11-09 21:59:31,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:59:31,617 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 105 transitions. [2024-11-09 21:59:31,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.5238095238095237) internal successors, (74), 21 states have internal predecessors, (74), 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-09 21:59:31,618 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 105 transitions. [2024-11-09 21:59:31,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 21:59:31,618 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:59:31,618 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:59:31,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-09 21:59:31,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 21:59:31,819 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:59:31,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:59:31,820 INFO L85 PathProgramCache]: Analyzing trace with hash 2045884091, now seen corresponding path program 2 times [2024-11-09 21:59:31,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:59:31,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023242269] [2024-11-09 21:59:31,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:59:31,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:59:31,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:59:32,110 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 21:59:32,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:59:32,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023242269] [2024-11-09 21:59:32,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023242269] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 21:59:32,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525051846] [2024-11-09 21:59:32,111 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 21:59:32,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 21:59:32,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 21:59:32,115 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 21:59:32,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 21:59:32,215 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 21:59:32,216 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 21:59:32,217 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-09 21:59:32,222 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 21:59:32,259 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 6 treesize of output 5 [2024-11-09 21:59:32,288 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-09 21:59:32,295 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 21:59:32,295 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 11 treesize of output 11 [2024-11-09 21:59:32,312 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 23 treesize of output 11 [2024-11-09 21:59:32,326 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 16 treesize of output 11 [2024-11-09 21:59:32,351 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 16 treesize of output 11 [2024-11-09 21:59:32,383 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-09 21:59:32,384 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 19 treesize of output 22 [2024-11-09 21:59:32,458 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 21:59:32,458 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 21:59:32,544 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_532 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_532))) (or (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2) (= 3 (select (select (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_50|) |c_ULTIMATE.start_main_~t~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))))) is different from false [2024-11-09 21:59:32,556 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_532 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_532))) (or (= 3 (select (select (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)))) is different from false [2024-11-09 21:59:32,571 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_530 (Array Int Int)) (v_ArrVal_532 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_530) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_532))) (or (not (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_530 .cse0))) v_ArrVal_530)) (= 3 (select (select (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)))) is different from false [2024-11-09 21:59:32,600 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 21:59:32,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2803 treesize of output 2719 [2024-11-09 21:59:32,626 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 615 treesize of output 579 [2024-11-09 21:59:33,307 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 541 treesize of output 521 [2024-11-09 21:59:33,445 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 6 not checked. [2024-11-09 21:59:33,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525051846] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 21:59:33,446 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 21:59:33,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 24 [2024-11-09 21:59:33,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674278023] [2024-11-09 21:59:33,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 21:59:33,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-09 21:59:33,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:59:33,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-09 21:59:33,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=354, Unknown=3, NotChecked=120, Total=552 [2024-11-09 21:59:33,447 INFO L87 Difference]: Start difference. First operand 79 states and 105 transitions. Second operand has 24 states, 24 states have (on average 2.9166666666666665) internal successors, (70), 24 states have internal predecessors, (70), 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-09 21:59:33,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:59:33,816 INFO L93 Difference]: Finished difference Result 105 states and 136 transitions. [2024-11-09 21:59:33,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 21:59:33,817 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.9166666666666665) internal successors, (70), 24 states have internal predecessors, (70), 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 38 [2024-11-09 21:59:33,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:59:33,818 INFO L225 Difference]: With dead ends: 105 [2024-11-09 21:59:33,818 INFO L226 Difference]: Without dead ends: 99 [2024-11-09 21:59:33,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=158, Invalid=721, Unknown=3, NotChecked=174, Total=1056 [2024-11-09 21:59:33,819 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 53 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 279 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 21:59:33,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 531 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 264 Invalid, 0 Unknown, 279 Unchecked, 0.2s Time] [2024-11-09 21:59:33,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-09 21:59:33,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 87. [2024-11-09 21:59:33,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 1.3372093023255813) internal successors, (115), 86 states have internal predecessors, (115), 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-09 21:59:33,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 115 transitions. [2024-11-09 21:59:33,824 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 115 transitions. Word has length 38 [2024-11-09 21:59:33,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:59:33,824 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 115 transitions. [2024-11-09 21:59:33,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.9166666666666665) internal successors, (70), 24 states have internal predecessors, (70), 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-09 21:59:33,825 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 115 transitions. [2024-11-09 21:59:33,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 21:59:33,825 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:59:33,825 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:59:33,840 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 21:59:34,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-09 21:59:34,027 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:59:34,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:59:34,027 INFO L85 PathProgramCache]: Analyzing trace with hash 921528698, now seen corresponding path program 1 times [2024-11-09 21:59:34,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:59:34,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495305720] [2024-11-09 21:59:34,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:59:34,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:59:34,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:59:34,352 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 21:59:34,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:59:34,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495305720] [2024-11-09 21:59:34,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495305720] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 21:59:34,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302133943] [2024-11-09 21:59:34,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:59:34,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 21:59:34,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 21:59:34,354 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 21:59:34,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 21:59:34,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:59:34,453 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-09 21:59:34,455 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 21:59:34,460 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 6 treesize of output 5 [2024-11-09 21:59:34,492 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 21:59:34,492 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 11 treesize of output 11 [2024-11-09 21:59:34,497 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-09 21:59:34,514 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 23 treesize of output 11 [2024-11-09 21:59:34,525 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 16 treesize of output 11 [2024-11-09 21:59:34,555 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 16 treesize of output 11 [2024-11-09 21:59:34,601 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-09 21:59:34,601 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 19 treesize of output 22 [2024-11-09 21:59:34,639 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 21:59:34,640 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 31 treesize of output 23 [2024-11-09 21:59:34,654 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 21:59:34,655 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 21:59:34,708 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_638 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_58| Int)) (not (= (select (select (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_638))) (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_58| (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_58|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) is different from false [2024-11-09 21:59:34,716 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_638 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_58| Int)) (not (= (select (select (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_638))) (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_58| (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_58|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) is different from false [2024-11-09 21:59:34,726 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_636 (Array Int Int)) (v_ArrVal_638 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_58| Int)) (or (not (= (select (select (let ((.cse0 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_636) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_638))) (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_58| (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_58|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (not (= v_ArrVal_636 (let ((.cse1 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|) .cse1 (select v_ArrVal_636 .cse1))))))) is different from false [2024-11-09 21:59:34,755 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 21:59:34,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2013 treesize of output 1991 [2024-11-09 21:59:34,775 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 550 treesize of output 518 [2024-11-09 21:59:35,034 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 6 treesize of output 4 [2024-11-09 21:59:35,044 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 53 treesize of output 51 [2024-11-09 21:59:35,055 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 6 treesize of output 4 [2024-11-09 21:59:35,059 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 44 treesize of output 42 [2024-11-09 21:59:35,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 21:59:35,145 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 6 not checked. [2024-11-09 21:59:35,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302133943] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 21:59:35,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 21:59:35,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 24 [2024-11-09 21:59:35,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632152930] [2024-11-09 21:59:35,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 21:59:35,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-09 21:59:35,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:59:35,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-09 21:59:35,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=354, Unknown=3, NotChecked=120, Total=552 [2024-11-09 21:59:35,146 INFO L87 Difference]: Start difference. First operand 87 states and 115 transitions. Second operand has 24 states, 24 states have (on average 2.875) internal successors, (69), 24 states have internal predecessors, (69), 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-09 21:59:35,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:59:35,503 INFO L93 Difference]: Finished difference Result 106 states and 136 transitions. [2024-11-09 21:59:35,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 21:59:35,504 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.875) internal successors, (69), 24 states have internal predecessors, (69), 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 40 [2024-11-09 21:59:35,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:59:35,504 INFO L225 Difference]: With dead ends: 106 [2024-11-09 21:59:35,504 INFO L226 Difference]: Without dead ends: 95 [2024-11-09 21:59:35,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=187, Invalid=878, Unknown=3, NotChecked=192, Total=1260 [2024-11-09 21:59:35,505 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 40 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 153 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 21:59:35,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 676 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 218 Invalid, 0 Unknown, 153 Unchecked, 0.2s Time] [2024-11-09 21:59:35,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-09 21:59:35,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 90. [2024-11-09 21:59:35,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 89 states have (on average 1.3258426966292134) internal successors, (118), 89 states have internal predecessors, (118), 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-09 21:59:35,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 118 transitions. [2024-11-09 21:59:35,513 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 118 transitions. Word has length 40 [2024-11-09 21:59:35,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:59:35,513 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 118 transitions. [2024-11-09 21:59:35,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.875) internal successors, (69), 24 states have internal predecessors, (69), 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-09 21:59:35,513 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 118 transitions. [2024-11-09 21:59:35,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 21:59:35,514 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:59:35,514 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:59:35,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 21:59:35,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 21:59:35,715 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:59:35,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:59:35,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1571405382, now seen corresponding path program 2 times [2024-11-09 21:59:35,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:59:35,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113699745] [2024-11-09 21:59:35,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:59:35,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:59:35,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:59:36,201 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 21:59:36,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:59:36,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113699745] [2024-11-09 21:59:36,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113699745] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 21:59:36,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898568416] [2024-11-09 21:59:36,202 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 21:59:36,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 21:59:36,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 21:59:36,203 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 21:59:36,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 21:59:36,306 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 21:59:36,306 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 21:59:36,310 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-09 21:59:36,312 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 21:59:36,315 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 6 treesize of output 5 [2024-11-09 21:59:36,361 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 21:59:36,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-09 21:59:36,408 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-09 21:59:36,420 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 15 treesize of output 1 [2024-11-09 21:59:36,468 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 21:59:36,469 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 33 treesize of output 24 [2024-11-09 21:59:36,480 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-09 21:59:36,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-09 21:59:36,490 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-09 21:59:36,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 21:59:36,494 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 16 treesize of output 11 [2024-11-09 21:59:36,548 INFO L349 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2024-11-09 21:59:36,548 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 175 treesize of output 125 [2024-11-09 21:59:36,552 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 128 treesize of output 105 [2024-11-09 21:59:36,559 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 55 treesize of output 19 [2024-11-09 21:59:36,625 INFO L349 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2024-11-09 21:59:36,626 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 172 treesize of output 135 [2024-11-09 21:59:36,640 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-09 21:59:36,641 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 121 [2024-11-09 21:59:36,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 19 [2024-11-09 21:59:36,683 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-11-09 21:59:36,684 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 30 [2024-11-09 21:59:36,686 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 19 treesize of output 11 [2024-11-09 21:59:36,704 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 21:59:36,704 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 21:59:36,731 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_749 (Array Int Int)) (v_ArrVal_751 (Array Int Int)) (v_ArrVal_750 (Array Int Int))) (= 2 (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_751) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_750) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_749) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))) is different from false [2024-11-09 21:59:36,751 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_748 (Array Int Int)) (v_ArrVal_747 (Array Int Int)) (v_ArrVal_749 (Array Int Int)) (v_ArrVal_751 (Array Int Int)) (v_ArrVal_750 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (not (= v_ArrVal_747 (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_747 .cse0)))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_747) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_751) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_750) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_748) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_749) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) 2)))) is different from false [2024-11-09 21:59:36,766 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 21:59:36,766 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 46 [2024-11-09 21:59:36,777 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 21:59:36,777 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 540 treesize of output 526 [2024-11-09 21:59:36,792 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 108 treesize of output 72 [2024-11-09 21:59:36,832 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 21 treesize of output 3 [2024-11-09 21:59:36,837 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 181 treesize of output 145 [2024-11-09 21:59:36,863 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 160 treesize of output 142 [2024-11-09 21:59:36,889 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 30 treesize of output 22 [2024-11-09 21:59:36,969 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 21:59:36,970 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 29 treesize of output 30 [2024-11-09 21:59:36,977 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 21:59:36,977 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 164 treesize of output 157 [2024-11-09 21:59:36,983 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 32 treesize of output 24 [2024-11-09 21:59:36,993 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 21:59:36,993 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 64 treesize of output 56 [2024-11-09 21:59:37,026 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 21:59:37,027 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 25 treesize of output 26 [2024-11-09 21:59:37,029 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 21:59:37,034 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 21:59:37,034 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 38 treesize of output 31 [2024-11-09 21:59:37,037 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 11 treesize of output 7 [2024-11-09 21:59:37,050 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 21:59:37,050 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 34 treesize of output 35 [2024-11-09 21:59:37,052 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 21:59:37,058 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 21:59:37,058 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 47 treesize of output 46 [2024-11-09 21:59:37,066 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 21:59:37,066 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 41 treesize of output 33 [2024-11-09 21:59:37,545 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 6 not checked. [2024-11-09 21:59:37,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898568416] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 21:59:37,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 21:59:37,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 26 [2024-11-09 21:59:37,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125681592] [2024-11-09 21:59:37,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 21:59:37,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-09 21:59:37,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:59:37,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 21:59:37,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=478, Unknown=3, NotChecked=90, Total=650 [2024-11-09 21:59:37,548 INFO L87 Difference]: Start difference. First operand 90 states and 118 transitions. Second operand has 26 states, 26 states have (on average 2.9615384615384617) internal successors, (77), 26 states have internal predecessors, (77), 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-09 21:59:37,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:59:37,980 INFO L93 Difference]: Finished difference Result 118 states and 150 transitions. [2024-11-09 21:59:37,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 21:59:37,981 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.9615384615384617) internal successors, (77), 26 states have internal predecessors, (77), 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 40 [2024-11-09 21:59:37,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:59:37,982 INFO L225 Difference]: With dead ends: 118 [2024-11-09 21:59:37,982 INFO L226 Difference]: Without dead ends: 111 [2024-11-09 21:59:37,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=122, Invalid=695, Unknown=3, NotChecked=110, Total=930 [2024-11-09 21:59:37,982 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 86 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 177 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 21:59:37,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 583 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 378 Invalid, 0 Unknown, 177 Unchecked, 0.3s Time] [2024-11-09 21:59:37,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-09 21:59:37,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 100. [2024-11-09 21:59:37,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 1.3131313131313131) internal successors, (130), 99 states have internal predecessors, (130), 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-09 21:59:37,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 130 transitions. [2024-11-09 21:59:37,987 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 130 transitions. Word has length 40 [2024-11-09 21:59:37,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:59:37,987 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 130 transitions. [2024-11-09 21:59:37,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.9615384615384617) internal successors, (77), 26 states have internal predecessors, (77), 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-09 21:59:37,987 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 130 transitions. [2024-11-09 21:59:37,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 21:59:37,988 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:59:37,988 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:59:38,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-09 21:59:38,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 21:59:38,189 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:59:38,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:59:38,190 INFO L85 PathProgramCache]: Analyzing trace with hash -882694278, now seen corresponding path program 1 times [2024-11-09 21:59:38,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:59:38,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788018512] [2024-11-09 21:59:38,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:59:38,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:59:38,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 21:59:38,207 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 21:59:38,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 21:59:38,241 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 21:59:38,245 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 21:59:38,246 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 21:59:38,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 21:59:38,254 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:59:38,286 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 21:59:38,289 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 09:59:38 BoogieIcfgContainer [2024-11-09 21:59:38,289 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 21:59:38,290 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 21:59:38,290 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 21:59:38,290 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 21:59:38,290 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 09:59:23" (3/4) ... [2024-11-09 21:59:38,291 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 21:59:38,336 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 21:59:38,336 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 21:59:38,337 INFO L158 Benchmark]: Toolchain (without parser) took 15352.70ms. Allocated memory was 176.2MB in the beginning and 488.6MB in the end (delta: 312.5MB). Free memory was 119.4MB in the beginning and 190.1MB in the end (delta: -70.7MB). Peak memory consumption was 244.9MB. Max. memory is 16.1GB. [2024-11-09 21:59:38,338 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 176.2MB. Free memory is still 139.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 21:59:38,338 INFO L158 Benchmark]: CACSL2BoogieTranslator took 383.40ms. Allocated memory is still 176.2MB. Free memory was 119.4MB in the beginning and 99.0MB in the end (delta: 20.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-09 21:59:38,338 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.60ms. Allocated memory is still 176.2MB. Free memory was 99.0MB in the beginning and 96.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 21:59:38,338 INFO L158 Benchmark]: Boogie Preprocessor took 53.18ms. Allocated memory is still 176.2MB. Free memory was 96.9MB in the beginning and 93.5MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 21:59:38,338 INFO L158 Benchmark]: IcfgBuilder took 461.24ms. Allocated memory is still 176.2MB. Free memory was 93.5MB in the beginning and 69.0MB in the end (delta: 24.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-09 21:59:38,339 INFO L158 Benchmark]: TraceAbstraction took 14346.74ms. Allocated memory was 176.2MB in the beginning and 488.6MB in the end (delta: 312.5MB). Free memory was 68.3MB in the beginning and 192.2MB in the end (delta: -123.9MB). Peak memory consumption was 190.4MB. Max. memory is 16.1GB. [2024-11-09 21:59:38,339 INFO L158 Benchmark]: Witness Printer took 46.78ms. Allocated memory is still 488.6MB. Free memory was 192.2MB in the beginning and 190.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 21:59:38,340 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 176.2MB. Free memory is still 139.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 383.40ms. Allocated memory is still 176.2MB. Free memory was 119.4MB in the beginning and 99.0MB in the end (delta: 20.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.60ms. Allocated memory is still 176.2MB. Free memory was 99.0MB in the beginning and 96.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.18ms. Allocated memory is still 176.2MB. Free memory was 96.9MB in the beginning and 93.5MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 461.24ms. Allocated memory is still 176.2MB. Free memory was 93.5MB in the beginning and 69.0MB in the end (delta: 24.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 14346.74ms. Allocated memory was 176.2MB in the beginning and 488.6MB in the end (delta: 312.5MB). Free memory was 68.3MB in the beginning and 192.2MB in the end (delta: -123.9MB). Peak memory consumption was 190.4MB. Max. memory is 16.1GB. * Witness Printer took 46.78ms. Allocated memory is still 488.6MB. Free memory was 192.2MB in the beginning and 190.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 620]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L552] struct TreeNode* root = malloc(sizeof(*root)), *n; [L552] struct TreeNode* root = malloc(sizeof(*root)), *n; [L553] root->left = ((void *)0) [L554] root->right = ((void *)0) [L555] COND FALSE !(__VERIFIER_nondet_int()) [L574] n = ((void *)0) [L575] struct TreeNode* pred; VAL [root={-1:0}] [L576] COND TRUE \read(*root) [L577] pred = ((void *)0) [L578] n = root VAL [n={-1:0}, pred={0:0}, root={-1:0}] [L579] EXPR n->left [L579] n->left || n->right VAL [n={-1:0}, pred={0:0}, root={-1:0}] [L579] n->left || n->right [L579] EXPR n->right [L579] n->left || n->right VAL [n={-1:0}, pred={0:0}, root={-1:0}] [L579] COND FALSE !(n->left || n->right) [L586] COND FALSE !(\read(*pred)) [L592] root = ((void *)0) VAL [n={-1:0}, root={0:0}] [L576] COND FALSE !(\read(*root)) [L595] List a = (List) malloc(sizeof(struct node)); [L596] COND FALSE !(a == 0) VAL [a={-2:0}] [L597] List t; [L598] List p = a; VAL [a={-2:0}, p={-2:0}] [L599] COND TRUE __VERIFIER_nondet_int() [L600] p->h = 1 [L601] t = (List) malloc(sizeof(struct node)) [L602] COND FALSE !(t == 0) VAL [a={-2:0}, p={-2:0}, t={-3:0}] [L603] p->n = t [L604] EXPR p->n [L604] p = p->n [L599] COND FALSE !(__VERIFIER_nondet_int()) [L606] COND TRUE __VERIFIER_nondet_int() [L607] p->h = 2 [L608] t = (List) malloc(sizeof(struct node)) [L609] COND FALSE !(t == 0) VAL [a={-2:0}, p={-3:0}, t={-4:0}] [L610] p->n = t [L611] EXPR p->n [L611] p = p->n [L606] COND FALSE !(__VERIFIER_nondet_int()) [L613] p->h = 3 [L614] p = a VAL [p={-2:0}] [L615] EXPR p->h [L615] COND FALSE !(p->h == 2) [L617] EXPR p->h [L617] COND TRUE p->h == 1 [L618] EXPR p->n [L618] p = p->n VAL [p={-3:0}] [L617] EXPR p->h [L617] COND FALSE !(p->h == 1) [L619] EXPR p->h [L619] COND TRUE p->h != 3 [L620] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 56 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.3s, OverallIterations: 14, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 438 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 438 mSDsluCounter, 4712 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 759 IncrementalHoareTripleChecker+Unchecked, 3993 mSDsCounter, 131 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1908 IncrementalHoareTripleChecker+Invalid, 2798 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 131 mSolverCounterUnsat, 719 mSDtfsCounter, 1908 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 659 GetRequests, 466 SyntacticMatches, 3 SemanticMatches, 190 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 765 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=100occurred in iteration=13, InterpolantAutomatonStates: 125, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 62 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.6s InterpolantComputationTime, 724 NumberOfCodeBlocks, 724 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 917 ConstructedInterpolants, 79 QuantifiedInterpolants, 8143 SizeOfPredicates, 46 NumberOfNonLiveVariables, 1529 ConjunctsInSsa, 271 ConjunctsInUnsatCore, 27 InterpolantComputations, 6 PerfectInterpolantSequences, 60/180 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-09 21:59:38,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE