./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test4-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows 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/uthash-2.0.2/uthash_FNV_test4-3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash efaea2320311f06fbd3071893d75fb70222c33e449b43348105f12b548a90ab4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 21:56:17,049 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 21:56:17,128 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-10 21:56:17,133 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 21:56:17,134 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 21:56:17,158 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 21:56:17,158 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 21:56:17,159 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 21:56:17,159 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 21:56:17,160 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 21:56:17,160 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 21:56:17,160 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 21:56:17,161 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 21:56:17,161 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 21:56:17,162 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 21:56:17,162 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 21:56:17,162 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 21:56:17,163 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 21:56:17,163 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 21:56:17,163 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 21:56:17,164 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 21:56:17,164 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 21:56:17,165 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 21:56:17,165 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 21:56:17,165 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 21:56:17,166 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-10 21:56:17,166 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 21:56:17,166 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 21:56:17,167 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 21:56:17,167 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 21:56:17,167 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 21:56:17,168 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 21:56:17,168 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 21:56:17,172 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 21:56:17,173 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 21:56:17,173 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 21:56:17,173 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 21:56:17,173 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 21:56:17,173 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 21:56:17,173 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 21:56:17,174 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 21:56:17,174 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 21:56:17,174 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 21:56:17,174 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 21:56:17,175 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 ! overflow) ) 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 -> efaea2320311f06fbd3071893d75fb70222c33e449b43348105f12b548a90ab4 [2024-11-10 21:56:17,398 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 21:56:17,428 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 21:56:17,431 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 21:56:17,432 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 21:56:17,433 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 21:56:17,434 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test4-3.i [2024-11-10 21:56:18,891 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 21:56:18,905 ERROR L? ?]: Error during toolchain job processing: java.lang.NullPointerException at org.eclipse.cdt.internal.core.model.PathEntry.kindFromString(PathEntry.java:80) at org.eclipse.cdt.internal.core.model.DefaultPathEntryStore.decodePathEntry(DefaultPathEntryStore.java:127) at org.eclipse.cdt.internal.core.model.DefaultPathEntryStore.getRawPathEntries(DefaultPathEntryStore.java:97) at org.eclipse.cdt.internal.core.model.PathEntryStoreProxy.getRawPathEntries(PathEntryStoreProxy.java:102) at org.eclipse.cdt.internal.core.model.PathEntryManager.getRawPathEntries(PathEntryManager.java:666) at org.eclipse.cdt.core.model.CoreModel.getRawPathEntries(CoreModel.java:937) at org.eclipse.cdt.core.model.CoreModel.oldIsScannerInformationEmpty(CoreModel.java:1307) at org.eclipse.cdt.core.model.CoreModel.isScannerInformationEmpty(CoreModel.java:1252) at org.eclipse.cdt.internal.core.pdom.indexer.ProjectIndexerInputAdapter.isFileBuildConfigured(ProjectIndexerInputAdapter.java:267) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.isRequiredInIndex(AbstractIndexerTask.java:748) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.extractFiles(AbstractIndexerTask.java:667) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.runTask(AbstractIndexerTask.java:558) at org.eclipse.cdt.internal.core.pdom.indexer.PDOMIndexerTask.run(PDOMIndexerTask.java:164) at org.eclipse.cdt.internal.core.pdom.PDOMIndexerJob.run(PDOMIndexerJob.java:160) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-10 21:56:19,194 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 21:56:19,195 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test4-3.i [2024-11-10 21:56:19,210 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dab37670/52537dbda4df4a5783e2b14f29090fa9/FLAGefda6b5a8 [2024-11-10 21:56:19,225 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dab37670/52537dbda4df4a5783e2b14f29090fa9 [2024-11-10 21:56:19,228 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 21:56:19,229 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 21:56:19,230 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 21:56:19,230 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 21:56:19,238 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 21:56:19,239 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:56:19" (1/1) ... [2024-11-10 21:56:19,240 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@519a1ee2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:56:19, skipping insertion in model container [2024-11-10 21:56:19,240 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:56:19" (1/1) ... [2024-11-10 21:56:19,293 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 21:56:19,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 21:56:19,825 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 21:56:19,921 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 21:56:19,958 INFO L204 MainTranslator]: Completed translation [2024-11-10 21:56:19,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:56:19 WrapperNode [2024-11-10 21:56:19,959 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 21:56:19,960 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 21:56:19,960 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 21:56:19,961 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 21:56:19,967 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:56:19" (1/1) ... [2024-11-10 21:56:20,002 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:56:19" (1/1) ... [2024-11-10 21:56:20,076 INFO L138 Inliner]: procedures = 176, calls = 435, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1869 [2024-11-10 21:56:20,077 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 21:56:20,077 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 21:56:20,077 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 21:56:20,078 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 21:56:20,089 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:56:19" (1/1) ... [2024-11-10 21:56:20,090 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:56:19" (1/1) ... [2024-11-10 21:56:20,104 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:56:19" (1/1) ... [2024-11-10 21:56:20,253 INFO L175 MemorySlicer]: Split 403 memory accesses to 2 slices as follows [401, 2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2]. The 98 writes are split as follows [98, 0]. [2024-11-10 21:56:20,253 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:56:19" (1/1) ... [2024-11-10 21:56:20,254 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:56:19" (1/1) ... [2024-11-10 21:56:20,303 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:56:19" (1/1) ... [2024-11-10 21:56:20,306 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:56:19" (1/1) ... [2024-11-10 21:56:20,310 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:56:19" (1/1) ... [2024-11-10 21:56:20,316 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:56:19" (1/1) ... [2024-11-10 21:56:20,326 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 21:56:20,327 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 21:56:20,327 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 21:56:20,328 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 21:56:20,328 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:56:19" (1/1) ... [2024-11-10 21:56:20,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 21:56:20,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:56:20,412 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-10 21:56:20,429 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-10 21:56:20,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 21:56:20,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 21:56:20,509 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-10 21:56:20,509 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-10 21:56:20,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 21:56:20,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 21:56:20,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-10 21:56:20,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-10 21:56:20,510 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-10 21:56:20,510 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-10 21:56:20,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 21:56:20,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 21:56:20,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 21:56:20,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 21:56:20,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 21:56:20,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-10 21:56:20,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 21:56:20,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 21:56:20,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 21:56:20,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 21:56:20,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 21:56:20,727 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 21:56:20,729 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 21:56:22,430 INFO L? ?]: Removed 435 outVars from TransFormulas that were not future-live. [2024-11-10 21:56:22,430 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 21:56:22,488 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 21:56:22,488 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-10 21:56:22,488 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:56:22 BoogieIcfgContainer [2024-11-10 21:56:22,488 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 21:56:22,490 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 21:56:22,491 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 21:56:22,494 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 21:56:22,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:56:19" (1/3) ... [2024-11-10 21:56:22,495 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31c0325c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:56:22, skipping insertion in model container [2024-11-10 21:56:22,495 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:56:19" (2/3) ... [2024-11-10 21:56:22,495 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31c0325c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:56:22, skipping insertion in model container [2024-11-10 21:56:22,495 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:56:22" (3/3) ... [2024-11-10 21:56:22,496 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test4-3.i [2024-11-10 21:56:22,510 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 21:56:22,511 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-10 21:56:22,583 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 21:56:22,588 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;@5326cade, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 21:56:22,589 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-10 21:56:22,593 INFO L276 IsEmpty]: Start isEmpty. Operand has 507 states, 482 states have (on average 1.6141078838174274) internal successors, (778), 498 states have internal predecessors, (778), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 21:56:22,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-10 21:56:22,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:56:22,599 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:56:22,599 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:56:22,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:56:22,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1186996086, now seen corresponding path program 1 times [2024-11-10 21:56:22,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:56:22,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266297766] [2024-11-10 21:56:22,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:56:22,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:56:22,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:22,751 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-10 21:56:22,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:56:22,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266297766] [2024-11-10 21:56:22,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266297766] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:56:22,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:56:22,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 21:56:22,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515445698] [2024-11-10 21:56:22,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:56:22,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 21:56:22,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:56:22,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 21:56:22,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 21:56:22,784 INFO L87 Difference]: Start difference. First operand has 507 states, 482 states have (on average 1.6141078838174274) internal successors, (778), 498 states have internal predecessors, (778), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-10 21:56:22,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:56:22,975 INFO L93 Difference]: Finished difference Result 1010 states and 1627 transitions. [2024-11-10 21:56:22,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 21:56:22,980 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2024-11-10 21:56:22,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:56:22,992 INFO L225 Difference]: With dead ends: 1010 [2024-11-10 21:56:22,993 INFO L226 Difference]: Without dead ends: 438 [2024-11-10 21:56:22,998 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-10 21:56:23,001 INFO L432 NwaCegarLoop]: 676 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 21:56:23,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 676 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 21:56:23,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2024-11-10 21:56:23,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2024-11-10 21:56:23,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 415 states have (on average 1.4457831325301205) internal successors, (600), 429 states have internal predecessors, (600), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 21:56:23,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 632 transitions. [2024-11-10 21:56:23,069 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 632 transitions. Word has length 7 [2024-11-10 21:56:23,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:56:23,069 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 632 transitions. [2024-11-10 21:56:23,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-10 21:56:23,069 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 632 transitions. [2024-11-10 21:56:23,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-10 21:56:23,070 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:56:23,070 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:56:23,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 21:56:23,070 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:56:23,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:56:23,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1830326153, now seen corresponding path program 1 times [2024-11-10 21:56:23,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:56:23,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858151553] [2024-11-10 21:56:23,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:56:23,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:56:23,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:23,171 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-10 21:56:23,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:56:23,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858151553] [2024-11-10 21:56:23,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858151553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:56:23,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:56:23,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 21:56:23,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196834301] [2024-11-10 21:56:23,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:56:23,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 21:56:23,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:56:23,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 21:56:23,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 21:56:23,178 INFO L87 Difference]: Start difference. First operand 438 states and 632 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 21:56:23,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:56:23,387 INFO L93 Difference]: Finished difference Result 865 states and 1253 transitions. [2024-11-10 21:56:23,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 21:56:23,388 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-10 21:56:23,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:56:23,395 INFO L225 Difference]: With dead ends: 865 [2024-11-10 21:56:23,395 INFO L226 Difference]: Without dead ends: 830 [2024-11-10 21:56:23,396 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-10 21:56:23,397 INFO L432 NwaCegarLoop]: 627 mSDtfsCounter, 552 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 1205 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 21:56:23,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 1205 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 21:56:23,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2024-11-10 21:56:23,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 444. [2024-11-10 21:56:23,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 421 states have (on average 1.4394299287410925) internal successors, (606), 435 states have internal predecessors, (606), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 21:56:23,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 638 transitions. [2024-11-10 21:56:23,437 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 638 transitions. Word has length 8 [2024-11-10 21:56:23,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:56:23,437 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 638 transitions. [2024-11-10 21:56:23,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 21:56:23,437 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 638 transitions. [2024-11-10 21:56:23,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-10 21:56:23,444 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:56:23,445 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 21:56:23,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 21:56:23,445 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:56:23,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:56:23,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1545794309, now seen corresponding path program 1 times [2024-11-10 21:56:23,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:56:23,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873185872] [2024-11-10 21:56:23,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:56:23,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:56:23,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:23,992 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-10 21:56:23,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:56:23,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873185872] [2024-11-10 21:56:23,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873185872] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:56:23,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:56:23,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 21:56:23,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352849891] [2024-11-10 21:56:23,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:56:23,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 21:56:23,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:56:23,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 21:56:23,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 21:56:23,998 INFO L87 Difference]: Start difference. First operand 444 states and 638 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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-10 21:56:24,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:56:24,176 INFO L93 Difference]: Finished difference Result 900 states and 1298 transitions. [2024-11-10 21:56:24,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 21:56:24,177 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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 155 [2024-11-10 21:56:24,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:56:24,180 INFO L225 Difference]: With dead ends: 900 [2024-11-10 21:56:24,180 INFO L226 Difference]: Without dead ends: 464 [2024-11-10 21:56:24,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-10 21:56:24,183 INFO L432 NwaCegarLoop]: 568 mSDtfsCounter, 8 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1121 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 21:56:24,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1121 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 21:56:24,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2024-11-10 21:56:24,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2024-11-10 21:56:24,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 441 states have (on average 1.4195011337868482) internal successors, (626), 455 states have internal predecessors, (626), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 21:56:24,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 658 transitions. [2024-11-10 21:56:24,204 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 658 transitions. Word has length 155 [2024-11-10 21:56:24,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:56:24,205 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 658 transitions. [2024-11-10 21:56:24,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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-10 21:56:24,205 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 658 transitions. [2024-11-10 21:56:24,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-10 21:56:24,212 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:56:24,213 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 21:56:24,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 21:56:24,213 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:56:24,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:56:24,214 INFO L85 PathProgramCache]: Analyzing trace with hash 264109276, now seen corresponding path program 1 times [2024-11-10 21:56:24,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:56:24,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265422998] [2024-11-10 21:56:24,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:56:24,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:56:24,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:24,540 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-10 21:56:24,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:56:24,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265422998] [2024-11-10 21:56:24,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265422998] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:56:24,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:56:24,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 21:56:24,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137229495] [2024-11-10 21:56:24,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:56:24,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 21:56:24,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:56:24,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 21:56:24,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 21:56:24,543 INFO L87 Difference]: Start difference. First operand 464 states and 658 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 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-10 21:56:24,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:56:24,710 INFO L93 Difference]: Finished difference Result 906 states and 1294 transitions. [2024-11-10 21:56:24,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 21:56:24,711 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 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 155 [2024-11-10 21:56:24,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:56:24,713 INFO L225 Difference]: With dead ends: 906 [2024-11-10 21:56:24,713 INFO L226 Difference]: Without dead ends: 450 [2024-11-10 21:56:24,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 21:56:24,717 INFO L432 NwaCegarLoop]: 560 mSDtfsCounter, 105 mSDsluCounter, 1035 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1595 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 21:56:24,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1595 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 21:56:24,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2024-11-10 21:56:24,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2024-11-10 21:56:24,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 427 states have (on average 1.4168618266978923) internal successors, (605), 441 states have internal predecessors, (605), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 21:56:24,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 637 transitions. [2024-11-10 21:56:24,732 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 637 transitions. Word has length 155 [2024-11-10 21:56:24,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:56:24,732 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 637 transitions. [2024-11-10 21:56:24,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 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-10 21:56:24,732 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 637 transitions. [2024-11-10 21:56:24,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-10 21:56:24,734 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:56:24,734 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 21:56:24,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 21:56:24,735 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:56:24,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:56:24,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1138784565, now seen corresponding path program 1 times [2024-11-10 21:56:24,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:56:24,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341822240] [2024-11-10 21:56:24,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:56:24,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:56:24,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:24,977 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-10 21:56:24,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:56:24,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341822240] [2024-11-10 21:56:24,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341822240] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:56:24,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:56:24,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 21:56:24,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630023663] [2024-11-10 21:56:24,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:56:24,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 21:56:24,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:56:24,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 21:56:24,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 21:56:24,980 INFO L87 Difference]: Start difference. First operand 450 states and 637 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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-10 21:56:25,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:56:25,125 INFO L93 Difference]: Finished difference Result 1027 states and 1461 transitions. [2024-11-10 21:56:25,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 21:56:25,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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 155 [2024-11-10 21:56:25,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:56:25,129 INFO L225 Difference]: With dead ends: 1027 [2024-11-10 21:56:25,129 INFO L226 Difference]: Without dead ends: 585 [2024-11-10 21:56:25,130 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-10 21:56:25,131 INFO L432 NwaCegarLoop]: 580 mSDtfsCounter, 134 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1153 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 21:56:25,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1153 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 21:56:25,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2024-11-10 21:56:25,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 585. [2024-11-10 21:56:25,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 562 states have (on average 1.4217081850533808) internal successors, (799), 576 states have internal predecessors, (799), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 21:56:25,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 831 transitions. [2024-11-10 21:56:25,145 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 831 transitions. Word has length 155 [2024-11-10 21:56:25,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:56:25,146 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 831 transitions. [2024-11-10 21:56:25,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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-10 21:56:25,146 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 831 transitions. [2024-11-10 21:56:25,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-10 21:56:25,148 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:56:25,148 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 21:56:25,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 21:56:25,149 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:56:25,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:56:25,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1344636894, now seen corresponding path program 1 times [2024-11-10 21:56:25,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:56:25,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247336304] [2024-11-10 21:56:25,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:56:25,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:56:25,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:25,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-10 21:56:25,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:25,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 21:56:25,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:25,573 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 21:56:25,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:56:25,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247336304] [2024-11-10 21:56:25,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247336304] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:56:25,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:56:25,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 21:56:25,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152141090] [2024-11-10 21:56:25,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:56:25,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 21:56:25,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:56:25,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 21:56:25,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 21:56:25,577 INFO L87 Difference]: Start difference. First operand 585 states and 831 transitions. Second operand has 5 states, 5 states have (on average 32.6) internal successors, (163), 4 states have internal predecessors, (163), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 21:56:26,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:56:26,056 INFO L93 Difference]: Finished difference Result 988 states and 1403 transitions. [2024-11-10 21:56:26,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 21:56:26,057 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 4 states have internal predecessors, (163), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 170 [2024-11-10 21:56:26,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:56:26,060 INFO L225 Difference]: With dead ends: 988 [2024-11-10 21:56:26,060 INFO L226 Difference]: Without dead ends: 546 [2024-11-10 21:56:26,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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-10 21:56:26,062 INFO L432 NwaCegarLoop]: 484 mSDtfsCounter, 36 mSDsluCounter, 1300 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1784 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 21:56:26,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1784 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 21:56:26,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2024-11-10 21:56:26,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 543. [2024-11-10 21:56:26,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 520 states have (on average 1.3884615384615384) internal successors, (722), 534 states have internal predecessors, (722), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 21:56:26,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 754 transitions. [2024-11-10 21:56:26,079 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 754 transitions. Word has length 170 [2024-11-10 21:56:26,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:56:26,079 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 754 transitions. [2024-11-10 21:56:26,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 4 states have internal predecessors, (163), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 21:56:26,080 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 754 transitions. [2024-11-10 21:56:26,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-10 21:56:26,082 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:56:26,082 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 21:56:26,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 21:56:26,082 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:56:26,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:56:26,083 INFO L85 PathProgramCache]: Analyzing trace with hash -799961508, now seen corresponding path program 1 times [2024-11-10 21:56:26,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:56:26,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871587397] [2024-11-10 21:56:26,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:56:26,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:56:26,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:26,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-10 21:56:26,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:26,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 21:56:26,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:26,399 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 21:56:26,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:56:26,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871587397] [2024-11-10 21:56:26,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871587397] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:56:26,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:56:26,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 21:56:26,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095454311] [2024-11-10 21:56:26,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:56:26,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 21:56:26,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:56:26,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 21:56:26,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 21:56:26,402 INFO L87 Difference]: Start difference. First operand 543 states and 754 transitions. Second operand has 4 states, 4 states have (on average 40.75) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 21:56:26,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:56:26,834 INFO L93 Difference]: Finished difference Result 1094 states and 1518 transitions. [2024-11-10 21:56:26,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 21:56:26,834 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 170 [2024-11-10 21:56:26,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:56:26,838 INFO L225 Difference]: With dead ends: 1094 [2024-11-10 21:56:26,839 INFO L226 Difference]: Without dead ends: 694 [2024-11-10 21:56:26,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 21:56:26,841 INFO L432 NwaCegarLoop]: 502 mSDtfsCounter, 250 mSDsluCounter, 875 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 1377 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 21:56:26,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 1377 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 21:56:26,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2024-11-10 21:56:26,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 691. [2024-11-10 21:56:26,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 665 states have (on average 1.3759398496240602) internal successors, (915), 679 states have internal predecessors, (915), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 10 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-10 21:56:26,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 953 transitions. [2024-11-10 21:56:26,865 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 953 transitions. Word has length 170 [2024-11-10 21:56:26,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:56:26,866 INFO L471 AbstractCegarLoop]: Abstraction has 691 states and 953 transitions. [2024-11-10 21:56:26,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 21:56:26,867 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 953 transitions. [2024-11-10 21:56:26,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-10 21:56:26,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:56:26,869 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 21:56:26,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 21:56:26,869 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:56:26,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:56:26,870 INFO L85 PathProgramCache]: Analyzing trace with hash 303948599, now seen corresponding path program 1 times [2024-11-10 21:56:26,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:56:26,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411402506] [2024-11-10 21:56:26,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:56:26,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:56:26,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:27,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-10 21:56:27,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:27,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 21:56:27,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:27,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 21:56:27,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:27,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-10 21:56:27,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:27,303 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 21:56:27,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:56:27,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411402506] [2024-11-10 21:56:27,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411402506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:56:27,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:56:27,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 21:56:27,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488132210] [2024-11-10 21:56:27,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:56:27,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 21:56:27,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:56:27,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 21:56:27,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 21:56:27,306 INFO L87 Difference]: Start difference. First operand 691 states and 953 transitions. Second operand has 5 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 21:56:27,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:56:27,843 INFO L93 Difference]: Finished difference Result 762 states and 1056 transitions. [2024-11-10 21:56:27,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 21:56:27,843 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 185 [2024-11-10 21:56:27,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:56:27,848 INFO L225 Difference]: With dead ends: 762 [2024-11-10 21:56:27,848 INFO L226 Difference]: Without dead ends: 760 [2024-11-10 21:56:27,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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-10 21:56:27,851 INFO L432 NwaCegarLoop]: 535 mSDtfsCounter, 304 mSDsluCounter, 1410 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 1945 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 21:56:27,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 1945 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 21:56:27,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2024-11-10 21:56:27,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 756. [2024-11-10 21:56:27,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 756 states, 727 states have (on average 1.3672627235213204) internal successors, (994), 741 states have internal predecessors, (994), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 13 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 21:56:27,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 1038 transitions. [2024-11-10 21:56:27,872 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 1038 transitions. Word has length 185 [2024-11-10 21:56:27,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:56:27,873 INFO L471 AbstractCegarLoop]: Abstraction has 756 states and 1038 transitions. [2024-11-10 21:56:27,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 21:56:27,874 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 1038 transitions. [2024-11-10 21:56:27,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-10 21:56:27,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:56:27,876 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 21:56:27,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 21:56:27,876 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:56:27,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:56:27,878 INFO L85 PathProgramCache]: Analyzing trace with hash -845686740, now seen corresponding path program 1 times [2024-11-10 21:56:27,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:56:27,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233222328] [2024-11-10 21:56:27,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:56:27,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:56:28,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:28,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-10 21:56:28,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:28,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 21:56:28,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:28,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 21:56:28,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:28,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-10 21:56:28,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:28,283 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 21:56:28,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:56:28,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233222328] [2024-11-10 21:56:28,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233222328] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 21:56:28,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674548369] [2024-11-10 21:56:28,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:56:28,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:56:28,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:56:28,287 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-10 21:56:28,289 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-10 21:56:28,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:28,779 INFO L255 TraceCheckSpWp]: Trace formula consists of 1019 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 21:56:28,791 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:56:29,081 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 21:56:29,082 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 21:56:29,388 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 21:56:29,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1674548369] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 21:56:29,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 21:56:29,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2024-11-10 21:56:29,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124086663] [2024-11-10 21:56:29,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 21:56:29,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 21:56:29,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:56:29,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 21:56:29,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-10 21:56:29,393 INFO L87 Difference]: Start difference. First operand 756 states and 1038 transitions. Second operand has 11 states, 11 states have (on average 46.45454545454545) internal successors, (511), 10 states have internal predecessors, (511), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-10 21:56:30,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:56:30,093 INFO L93 Difference]: Finished difference Result 1156 states and 1611 transitions. [2024-11-10 21:56:30,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 21:56:30,094 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 46.45454545454545) internal successors, (511), 10 states have internal predecessors, (511), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 193 [2024-11-10 21:56:30,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:56:30,099 INFO L225 Difference]: With dead ends: 1156 [2024-11-10 21:56:30,099 INFO L226 Difference]: Without dead ends: 1121 [2024-11-10 21:56:30,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-10 21:56:30,100 INFO L432 NwaCegarLoop]: 533 mSDtfsCounter, 1781 mSDsluCounter, 2298 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1809 SdHoareTripleChecker+Valid, 2831 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 21:56:30,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1809 Valid, 2831 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 21:56:30,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2024-11-10 21:56:30,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 1118. [2024-11-10 21:56:30,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1118 states, 1083 states have (on average 1.3647276084949216) internal successors, (1478), 1097 states have internal predecessors, (1478), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 19 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 21:56:30,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 1118 states and 1534 transitions. [2024-11-10 21:56:30,129 INFO L78 Accepts]: Start accepts. Automaton has 1118 states and 1534 transitions. Word has length 193 [2024-11-10 21:56:30,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:56:30,129 INFO L471 AbstractCegarLoop]: Abstraction has 1118 states and 1534 transitions. [2024-11-10 21:56:30,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 46.45454545454545) internal successors, (511), 10 states have internal predecessors, (511), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-10 21:56:30,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1534 transitions. [2024-11-10 21:56:30,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-10 21:56:30,132 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:56:30,132 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 21:56:30,153 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-10 21:56:30,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:56:30,333 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:56:30,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:56:30,334 INFO L85 PathProgramCache]: Analyzing trace with hash -822721903, now seen corresponding path program 1 times [2024-11-10 21:56:30,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:56:30,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136162404] [2024-11-10 21:56:30,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:56:30,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:56:31,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:31,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-10 21:56:31,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:31,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 21:56:31,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:31,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 21:56:31,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:31,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-10 21:56:31,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:31,321 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-10 21:56:31,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:56:31,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136162404] [2024-11-10 21:56:31,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136162404] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 21:56:31,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061574644] [2024-11-10 21:56:31,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:56:31,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:56:31,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:56:31,324 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-10 21:56:31,325 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-10 21:56:31,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:31,884 INFO L255 TraceCheckSpWp]: Trace formula consists of 1025 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-10 21:56:31,897 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:56:31,943 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-10 21:56:31,965 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-10 21:56:32,799 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 21:56:32,799 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 21:56:32,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061574644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:56:32,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 21:56:32,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2024-11-10 21:56:32,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549514261] [2024-11-10 21:56:32,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:56:32,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 21:56:32,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:56:32,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 21:56:32,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-10 21:56:32,802 INFO L87 Difference]: Start difference. First operand 1118 states and 1534 transitions. Second operand has 11 states, 11 states have (on average 16.0) internal successors, (176), 11 states have internal predecessors, (176), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 21:56:34,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:56:34,934 INFO L93 Difference]: Finished difference Result 2178 states and 2983 transitions. [2024-11-10 21:56:34,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 21:56:34,936 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 16.0) internal successors, (176), 11 states have internal predecessors, (176), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 193 [2024-11-10 21:56:34,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:56:34,942 INFO L225 Difference]: With dead ends: 2178 [2024-11-10 21:56:34,942 INFO L226 Difference]: Without dead ends: 1156 [2024-11-10 21:56:34,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2024-11-10 21:56:34,945 INFO L432 NwaCegarLoop]: 489 mSDtfsCounter, 735 mSDsluCounter, 2273 mSDsCounter, 0 mSdLazyCounter, 1068 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 740 SdHoareTripleChecker+Valid, 2762 SdHoareTripleChecker+Invalid, 1072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-10 21:56:34,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [740 Valid, 2762 Invalid, 1072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1068 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-10 21:56:34,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156 states. [2024-11-10 21:56:34,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 1151. [2024-11-10 21:56:34,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1151 states, 1116 states have (on average 1.3584229390681004) internal successors, (1516), 1130 states have internal predecessors, (1516), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 19 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 21:56:34,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1572 transitions. [2024-11-10 21:56:34,980 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 1572 transitions. Word has length 193 [2024-11-10 21:56:34,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:56:34,980 INFO L471 AbstractCegarLoop]: Abstraction has 1151 states and 1572 transitions. [2024-11-10 21:56:34,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.0) internal successors, (176), 11 states have internal predecessors, (176), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 21:56:34,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1572 transitions. [2024-11-10 21:56:34,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-10 21:56:34,983 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:56:34,983 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 21:56:35,005 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-10 21:56:35,184 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,SelfDestructingSolverStorable9 [2024-11-10 21:56:35,184 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:56:35,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:56:35,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1551129060, now seen corresponding path program 1 times [2024-11-10 21:56:35,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:56:35,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787893928] [2024-11-10 21:56:35,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:56:35,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:56:35,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:35,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-10 21:56:35,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:35,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 21:56:35,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:35,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-10 21:56:35,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:35,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-10 21:56:35,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:35,893 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-10 21:56:35,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:56:35,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787893928] [2024-11-10 21:56:35,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787893928] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 21:56:35,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773265420] [2024-11-10 21:56:35,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:56:35,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:56:35,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:56:35,896 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-10 21:56:35,897 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-10 21:56:36,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:36,482 INFO L255 TraceCheckSpWp]: Trace formula consists of 1026 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-10 21:56:36,487 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:56:36,534 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 21:56:36,535 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 21:56:36,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773265420] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:56:36,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 21:56:36,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2024-11-10 21:56:36,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756324370] [2024-11-10 21:56:36,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:56:36,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 21:56:36,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:56:36,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 21:56:36,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 21:56:36,537 INFO L87 Difference]: Start difference. First operand 1151 states and 1572 transitions. Second operand has 4 states, 4 states have (on average 44.25) internal successors, (177), 4 states have internal predecessors, (177), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 21:56:36,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:56:36,829 INFO L93 Difference]: Finished difference Result 2266 states and 3095 transitions. [2024-11-10 21:56:36,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 21:56:36,830 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 44.25) internal successors, (177), 4 states have internal predecessors, (177), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 194 [2024-11-10 21:56:36,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:56:36,835 INFO L225 Difference]: With dead ends: 2266 [2024-11-10 21:56:36,835 INFO L226 Difference]: Without dead ends: 1244 [2024-11-10 21:56:36,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 21:56:36,838 INFO L432 NwaCegarLoop]: 499 mSDtfsCounter, 17 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1331 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 21:56:36,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1331 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 21:56:36,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2024-11-10 21:56:36,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 1220. [2024-11-10 21:56:36,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1220 states, 1185 states have (on average 1.3476793248945147) internal successors, (1597), 1199 states have internal predecessors, (1597), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 19 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 21:56:36,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1220 states to 1220 states and 1653 transitions. [2024-11-10 21:56:36,873 INFO L78 Accepts]: Start accepts. Automaton has 1220 states and 1653 transitions. Word has length 194 [2024-11-10 21:56:36,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:56:36,873 INFO L471 AbstractCegarLoop]: Abstraction has 1220 states and 1653 transitions. [2024-11-10 21:56:36,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.25) internal successors, (177), 4 states have internal predecessors, (177), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 21:56:36,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1220 states and 1653 transitions. [2024-11-10 21:56:36,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-10 21:56:36,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:56:36,876 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 21:56:36,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 21:56:37,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:56:37,081 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:56:37,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:56:37,082 INFO L85 PathProgramCache]: Analyzing trace with hash -227637772, now seen corresponding path program 1 times [2024-11-10 21:56:37,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:56:37,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110428641] [2024-11-10 21:56:37,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:56:37,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:56:37,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:37,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 21:56:37,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:37,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 21:56:37,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:37,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-10 21:56:37,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:37,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-10 21:56:37,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:37,596 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 21:56:37,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:56:37,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110428641] [2024-11-10 21:56:37,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110428641] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:56:37,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:56:37,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 21:56:37,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650309399] [2024-11-10 21:56:37,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:56:37,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 21:56:37,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:56:37,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 21:56:37,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 21:56:37,599 INFO L87 Difference]: Start difference. First operand 1220 states and 1653 transitions. Second operand has 7 states, 7 states have (on average 25.428571428571427) internal successors, (178), 6 states have internal predecessors, (178), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 21:56:38,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:56:38,437 INFO L93 Difference]: Finished difference Result 2328 states and 3179 transitions. [2024-11-10 21:56:38,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 21:56:38,439 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.428571428571427) internal successors, (178), 6 states have internal predecessors, (178), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 195 [2024-11-10 21:56:38,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:56:38,444 INFO L225 Difference]: With dead ends: 2328 [2024-11-10 21:56:38,445 INFO L226 Difference]: Without dead ends: 1241 [2024-11-10 21:56:38,447 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 21:56:38,448 INFO L432 NwaCegarLoop]: 494 mSDtfsCounter, 14 mSDsluCounter, 1509 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2003 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 21:56:38,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2003 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 21:56:38,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2024-11-10 21:56:38,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1232. [2024-11-10 21:56:38,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1232 states, 1197 states have (on average 1.3467000835421887) internal successors, (1612), 1211 states have internal predecessors, (1612), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 19 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 21:56:38,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 1668 transitions. [2024-11-10 21:56:38,479 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 1668 transitions. Word has length 195 [2024-11-10 21:56:38,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:56:38,479 INFO L471 AbstractCegarLoop]: Abstraction has 1232 states and 1668 transitions. [2024-11-10 21:56:38,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.428571428571427) internal successors, (178), 6 states have internal predecessors, (178), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 21:56:38,480 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 1668 transitions. [2024-11-10 21:56:38,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-10 21:56:38,483 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:56:38,483 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 21:56:38,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 21:56:38,484 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:56:38,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:56:38,484 INFO L85 PathProgramCache]: Analyzing trace with hash -196738080, now seen corresponding path program 1 times [2024-11-10 21:56:38,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:56:38,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223111122] [2024-11-10 21:56:38,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:56:38,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:56:38,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:38,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 21:56:38,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:38,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 21:56:38,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:38,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 21:56:38,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:38,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 21:56:38,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:38,984 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 21:56:38,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:56:38,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223111122] [2024-11-10 21:56:38,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223111122] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:56:38,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:56:38,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 21:56:38,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512263217] [2024-11-10 21:56:38,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:56:38,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 21:56:38,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:56:38,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 21:56:38,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 21:56:38,989 INFO L87 Difference]: Start difference. First operand 1232 states and 1668 transitions. Second operand has 8 states, 8 states have (on average 22.375) internal successors, (179), 7 states have internal predecessors, (179), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 21:56:40,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:56:40,095 INFO L93 Difference]: Finished difference Result 2356 states and 3217 transitions. [2024-11-10 21:56:40,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 21:56:40,096 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 22.375) internal successors, (179), 7 states have internal predecessors, (179), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 196 [2024-11-10 21:56:40,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:56:40,101 INFO L225 Difference]: With dead ends: 2356 [2024-11-10 21:56:40,102 INFO L226 Difference]: Without dead ends: 1268 [2024-11-10 21:56:40,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 21:56:40,105 INFO L432 NwaCegarLoop]: 486 mSDtfsCounter, 18 mSDsluCounter, 2208 mSDsCounter, 0 mSdLazyCounter, 1085 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 2694 SdHoareTripleChecker+Invalid, 1102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 21:56:40,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 2694 Invalid, 1102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1085 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-10 21:56:40,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1268 states. [2024-11-10 21:56:40,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1268 to 1256. [2024-11-10 21:56:40,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1256 states, 1221 states have (on average 1.3472563472563472) internal successors, (1645), 1235 states have internal predecessors, (1645), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 19 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 21:56:40,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 1701 transitions. [2024-11-10 21:56:40,150 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 1701 transitions. Word has length 196 [2024-11-10 21:56:40,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:56:40,150 INFO L471 AbstractCegarLoop]: Abstraction has 1256 states and 1701 transitions. [2024-11-10 21:56:40,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 22.375) internal successors, (179), 7 states have internal predecessors, (179), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 21:56:40,150 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 1701 transitions. [2024-11-10 21:56:40,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-10 21:56:40,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:56:40,152 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 21:56:40,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 21:56:40,153 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:56:40,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:56:40,153 INFO L85 PathProgramCache]: Analyzing trace with hash 311429414, now seen corresponding path program 1 times [2024-11-10 21:56:40,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:56:40,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507378885] [2024-11-10 21:56:40,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:56:40,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:56:40,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:40,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 21:56:40,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:40,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 21:56:40,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:40,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 21:56:40,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:40,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 21:56:40,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:40,766 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-10 21:56:40,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:56:40,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507378885] [2024-11-10 21:56:40,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507378885] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 21:56:40,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849598769] [2024-11-10 21:56:40,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:56:40,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:56:40,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:56:40,769 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-10 21:56:40,770 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-10 21:56:41,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:41,386 INFO L255 TraceCheckSpWp]: Trace formula consists of 1025 conjuncts, 112 conjuncts are in the unsatisfiable core [2024-11-10 21:56:41,401 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:56:41,416 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-10 21:56:41,460 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-10 21:56:41,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 11 [2024-11-10 21:56:41,804 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 30 treesize of output 11 [2024-11-10 21:56:41,817 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-10 21:56:41,840 INFO L349 Elim1Store]: treesize reduction 32, result has 30.4 percent of original size [2024-11-10 21:56:41,840 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 31 treesize of output 20 [2024-11-10 21:56:41,847 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-10 21:56:41,850 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-10 21:56:41,910 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 8 treesize of output 4 [2024-11-10 21:56:41,915 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