./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test9-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test9-2.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 9c302c0a70f15041d912ede4a343504399632b0722d257e8570893a260b2b8dc --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 20:12:55,766 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 20:12:55,874 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-12 20:12:55,881 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 20:12:55,881 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 20:12:55,911 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 20:12:55,911 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 20:12:55,912 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 20:12:55,913 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 20:12:55,914 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 20:12:55,915 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 20:12:55,915 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 20:12:55,916 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 20:12:55,916 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 20:12:55,916 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 20:12:55,918 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 20:12:55,918 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 20:12:55,919 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 20:12:55,919 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 20:12:55,919 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 20:12:55,922 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 20:12:55,922 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 20:12:55,922 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 20:12:55,923 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 20:12:55,923 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 20:12:55,923 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-12 20:12:55,924 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 20:12:55,924 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 20:12:55,925 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 20:12:55,925 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 20:12:55,925 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 20:12:55,926 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 20:12:55,926 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 20:12:55,926 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 20:12:55,926 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 20:12:55,927 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 20:12:55,927 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 20:12:55,927 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 20:12:55,927 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 20:12:55,927 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 20:12:55,928 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 20:12:55,929 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 20:12:55,929 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 20:12:55,930 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 20:12:55,930 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 -> 9c302c0a70f15041d912ede4a343504399632b0722d257e8570893a260b2b8dc [2024-11-12 20:12:56,186 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 20:12:56,209 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 20:12:56,211 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 20:12:56,212 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 20:12:56,213 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 20:12:56,214 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_test9-2.i [2024-11-12 20:12:57,583 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 20:12:57,961 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 20:12:57,962 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test9-2.i [2024-11-12 20:12:57,986 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cea3320d1/8553eb8de4d84d959ed5c8e2b05744c6/FLAG8cf157f69 [2024-11-12 20:12:57,997 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cea3320d1/8553eb8de4d84d959ed5c8e2b05744c6 [2024-11-12 20:12:57,999 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 20:12:58,000 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 20:12:58,002 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 20:12:58,002 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 20:12:58,009 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 20:12:58,010 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:12:57" (1/1) ... [2024-11-12 20:12:58,011 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bd9d9a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:12:58, skipping insertion in model container [2024-11-12 20:12:58,011 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:12:57" (1/1) ... [2024-11-12 20:12:58,107 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 20:12:58,783 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 20:12:58,797 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 20:12:58,915 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 20:12:58,946 INFO L204 MainTranslator]: Completed translation [2024-11-12 20:12:58,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:12:58 WrapperNode [2024-11-12 20:12:58,946 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 20:12:58,947 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 20:12:58,947 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 20:12:58,947 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 20:12:58,953 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:12:58" (1/1) ... [2024-11-12 20:12:58,998 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:12:58" (1/1) ... [2024-11-12 20:12:59,108 INFO L138 Inliner]: procedures = 177, calls = 775, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3456 [2024-11-12 20:12:59,108 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 20:12:59,109 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 20:12:59,109 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 20:12:59,110 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 20:12:59,120 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:12:58" (1/1) ... [2024-11-12 20:12:59,120 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:12:58" (1/1) ... [2024-11-12 20:12:59,145 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:12:58" (1/1) ... [2024-11-12 20:12:59,294 INFO L175 MemorySlicer]: Split 256 memory accesses to 3 slices as follows [34, 2, 220]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0]. The 54 writes are split as follows [4, 0, 50]. [2024-11-12 20:12:59,295 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:12:58" (1/1) ... [2024-11-12 20:12:59,295 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:12:58" (1/1) ... [2024-11-12 20:12:59,350 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:12:58" (1/1) ... [2024-11-12 20:12:59,370 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:12:58" (1/1) ... [2024-11-12 20:12:59,386 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:12:58" (1/1) ... [2024-11-12 20:12:59,402 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:12:58" (1/1) ... [2024-11-12 20:12:59,415 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 20:12:59,416 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 20:12:59,417 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 20:12:59,417 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 20:12:59,418 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:12:58" (1/1) ... [2024-11-12 20:12:59,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 20:12:59,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:12:59,449 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-12 20:12:59,451 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-12 20:12:59,490 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-12 20:12:59,490 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-12 20:12:59,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-12 20:12:59,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-12 20:12:59,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-12 20:12:59,491 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-12 20:12:59,491 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-12 20:12:59,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 20:12:59,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-12 20:12:59,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-12 20:12:59,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-12 20:12:59,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-12 20:12:59,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-12 20:12:59,493 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-12 20:12:59,493 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-12 20:12:59,493 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-12 20:12:59,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 20:12:59,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 20:12:59,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-12 20:12:59,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-12 20:12:59,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-12 20:12:59,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-12 20:12:59,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-12 20:12:59,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-12 20:12:59,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-12 20:12:59,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 20:12:59,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 20:12:59,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-12 20:12:59,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-12 20:12:59,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 20:12:59,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 20:12:59,686 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 20:12:59,688 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 20:13:02,195 INFO L? ?]: Removed 835 outVars from TransFormulas that were not future-live. [2024-11-12 20:13:02,196 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 20:13:02,237 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 20:13:02,237 INFO L316 CfgBuilder]: Removed 63 assume(true) statements. [2024-11-12 20:13:02,238 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:13:02 BoogieIcfgContainer [2024-11-12 20:13:02,238 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 20:13:02,239 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 20:13:02,241 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 20:13:02,244 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 20:13:02,244 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 08:12:57" (1/3) ... [2024-11-12 20:13:02,245 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d7a283c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:13:02, skipping insertion in model container [2024-11-12 20:13:02,245 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:12:58" (2/3) ... [2024-11-12 20:13:02,245 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d7a283c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:13:02, skipping insertion in model container [2024-11-12 20:13:02,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:13:02" (3/3) ... [2024-11-12 20:13:02,247 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test9-2.i [2024-11-12 20:13:02,261 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 20:13:02,261 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-11-12 20:13:02,367 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 20:13:02,373 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;@6b92a61b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 20:13:02,373 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-12 20:13:02,381 INFO L276 IsEmpty]: Start isEmpty. Operand has 1423 states, 906 states have (on average 1.8311258278145695) internal successors, (1659), 1416 states have internal predecessors, (1659), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) [2024-11-12 20:13:02,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-12 20:13:02,386 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:13:02,386 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:13:02,387 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 20:13:02,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:13:02,391 INFO L85 PathProgramCache]: Analyzing trace with hash 170881670, now seen corresponding path program 1 times [2024-11-12 20:13:02,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:13:02,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516248415] [2024-11-12 20:13:02,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:13:02,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:13:02,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:13:02,553 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-12 20:13:02,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:13:02,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516248415] [2024-11-12 20:13:02,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516248415] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:13:02,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:13:02,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 20:13:02,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678541500] [2024-11-12 20:13:02,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:13:02,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 20:13:02,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:13:02,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 20:13:02,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 20:13:02,590 INFO L87 Difference]: Start difference. First operand has 1423 states, 906 states have (on average 1.8311258278145695) internal successors, (1659), 1416 states have internal predecessors, (1659), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) 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-12 20:13:02,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:13:02,788 INFO L93 Difference]: Finished difference Result 2842 states and 5835 transitions. [2024-11-12 20:13:02,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 20:13:02,790 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-12 20:13:02,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:13:02,829 INFO L225 Difference]: With dead ends: 2842 [2024-11-12 20:13:02,829 INFO L226 Difference]: Without dead ends: 1379 [2024-11-12 20:13:02,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 20:13:02,852 INFO L435 NwaCegarLoop]: 2597 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2597 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 20:13:02,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2597 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 20:13:02,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2024-11-12 20:13:03,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1379. [2024-11-12 20:13:03,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1379 states, 866 states have (on average 1.7725173210161662) internal successors, (1535), 1373 states have internal predecessors, (1535), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-12 20:13:03,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1379 states to 1379 states and 2541 transitions. [2024-11-12 20:13:03,270 INFO L78 Accepts]: Start accepts. Automaton has 1379 states and 2541 transitions. Word has length 7 [2024-11-12 20:13:03,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:13:03,270 INFO L471 AbstractCegarLoop]: Abstraction has 1379 states and 2541 transitions. [2024-11-12 20:13:03,271 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-12 20:13:03,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1379 states and 2541 transitions. [2024-11-12 20:13:03,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-12 20:13:03,271 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:13:03,272 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:13:03,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 20:13:03,272 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 20:13:03,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:13:03,273 INFO L85 PathProgramCache]: Analyzing trace with hash 170883592, now seen corresponding path program 1 times [2024-11-12 20:13:03,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:13:03,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341835978] [2024-11-12 20:13:03,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:13:03,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:13:03,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 20:13:03,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [71814153] [2024-11-12 20:13:03,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:13:03,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:13:03,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:13:03,318 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-12 20:13:03,320 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-12 20:13:03,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:13:03,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-12 20:13:03,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:13:03,516 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-12 20:13:03,557 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-12 20:13:03,557 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 20:13:03,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:13:03,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341835978] [2024-11-12 20:13:03,560 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 20:13:03,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71814153] [2024-11-12 20:13:03,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71814153] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:13:03,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:13:03,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 20:13:03,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305005522] [2024-11-12 20:13:03,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:13:03,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 20:13:03,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:13:03,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 20:13:03,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 20:13:03,564 INFO L87 Difference]: Start difference. First operand 1379 states and 2541 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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-12 20:13:04,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:13:04,479 INFO L93 Difference]: Finished difference Result 2748 states and 5073 transitions. [2024-11-12 20:13:04,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 20:13:04,480 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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-12 20:13:04,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:13:04,501 INFO L225 Difference]: With dead ends: 2748 [2024-11-12 20:13:04,501 INFO L226 Difference]: Without dead ends: 2746 [2024-11-12 20:13:04,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-12 20:13:04,503 INFO L435 NwaCegarLoop]: 2805 mSDtfsCounter, 1519 mSDsluCounter, 4818 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2022 SdHoareTripleChecker+Valid, 7623 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 20:13:04,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2022 Valid, 7623 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 20:13:04,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2746 states. [2024-11-12 20:13:04,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2746 to 1385. [2024-11-12 20:13:04,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1385 states, 872 states have (on average 1.768348623853211) internal successors, (1542), 1379 states have internal predecessors, (1542), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-12 20:13:04,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 2548 transitions. [2024-11-12 20:13:04,809 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 2548 transitions. Word has length 7 [2024-11-12 20:13:04,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:13:04,809 INFO L471 AbstractCegarLoop]: Abstraction has 1385 states and 2548 transitions. [2024-11-12 20:13:04,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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-12 20:13:04,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 2548 transitions. [2024-11-12 20:13:04,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-12 20:13:04,812 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:13:04,813 INFO L218 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] [2024-11-12 20:13:04,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 20:13:05,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:13:05,017 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 20:13:05,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:13:05,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1584338109, now seen corresponding path program 1 times [2024-11-12 20:13:05,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:13:05,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597754471] [2024-11-12 20:13:05,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:13:05,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:13:05,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:13:05,409 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-12 20:13:05,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:13:05,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597754471] [2024-11-12 20:13:05,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597754471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:13:05,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:13:05,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 20:13:05,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148587547] [2024-11-12 20:13:05,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:13:05,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 20:13:05,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:13:05,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 20:13:05,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 20:13:05,412 INFO L87 Difference]: Start difference. First operand 1385 states and 2548 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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-12 20:13:06,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:13:06,197 INFO L93 Difference]: Finished difference Result 3915 states and 7314 transitions. [2024-11-12 20:13:06,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 20:13:06,197 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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 64 [2024-11-12 20:13:06,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:13:06,215 INFO L225 Difference]: With dead ends: 3915 [2024-11-12 20:13:06,215 INFO L226 Difference]: Without dead ends: 2745 [2024-11-12 20:13:06,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 20:13:06,221 INFO L435 NwaCegarLoop]: 2826 mSDtfsCounter, 1520 mSDsluCounter, 4840 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2023 SdHoareTripleChecker+Valid, 7666 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 20:13:06,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2023 Valid, 7666 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 20:13:06,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2745 states. [2024-11-12 20:13:06,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2745 to 1385. [2024-11-12 20:13:06,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1385 states, 872 states have (on average 1.7672018348623852) internal successors, (1541), 1379 states have internal predecessors, (1541), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-12 20:13:06,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 2547 transitions. [2024-11-12 20:13:06,542 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 2547 transitions. Word has length 64 [2024-11-12 20:13:06,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:13:06,543 INFO L471 AbstractCegarLoop]: Abstraction has 1385 states and 2547 transitions. [2024-11-12 20:13:06,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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-12 20:13:06,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 2547 transitions. [2024-11-12 20:13:06,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-12 20:13:06,546 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:13:06,546 INFO L218 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] [2024-11-12 20:13:06,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 20:13:06,546 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 20:13:06,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:13:06,547 INFO L85 PathProgramCache]: Analyzing trace with hash 205854116, now seen corresponding path program 1 times [2024-11-12 20:13:06,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:13:06,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096682465] [2024-11-12 20:13:06,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:13:06,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:13:06,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:13:06,812 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-12 20:13:06,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:13:06,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096682465] [2024-11-12 20:13:06,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096682465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:13:06,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:13:06,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 20:13:06,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115511401] [2024-11-12 20:13:06,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:13:06,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 20:13:06,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:13:06,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 20:13:06,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 20:13:06,816 INFO L87 Difference]: Start difference. First operand 1385 states and 2547 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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-12 20:13:06,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:13:06,954 INFO L93 Difference]: Finished difference Result 2720 states and 5020 transitions. [2024-11-12 20:13:06,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 20:13:06,955 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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 81 [2024-11-12 20:13:06,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:13:06,965 INFO L225 Difference]: With dead ends: 2720 [2024-11-12 20:13:06,965 INFO L226 Difference]: Without dead ends: 1343 [2024-11-12 20:13:06,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 20:13:06,973 INFO L435 NwaCegarLoop]: 2438 mSDtfsCounter, 12 mSDsluCounter, 7285 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 9723 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 20:13:06,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 9723 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 20:13:06,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2024-11-12 20:13:07,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 1343. [2024-11-12 20:13:07,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1343 states, 830 states have (on average 1.763855421686747) internal successors, (1464), 1337 states have internal predecessors, (1464), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-12 20:13:07,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1343 states and 2470 transitions. [2024-11-12 20:13:07,134 INFO L78 Accepts]: Start accepts. Automaton has 1343 states and 2470 transitions. Word has length 81 [2024-11-12 20:13:07,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:13:07,134 INFO L471 AbstractCegarLoop]: Abstraction has 1343 states and 2470 transitions. [2024-11-12 20:13:07,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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-12 20:13:07,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 2470 transitions. [2024-11-12 20:13:07,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-12 20:13:07,140 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:13:07,140 INFO L218 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] [2024-11-12 20:13:07,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 20:13:07,140 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 20:13:07,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:13:07,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1580811434, now seen corresponding path program 1 times [2024-11-12 20:13:07,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:13:07,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100053722] [2024-11-12 20:13:07,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:13:07,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:13:07,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:13:07,270 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-12 20:13:07,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:13:07,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100053722] [2024-11-12 20:13:07,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100053722] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:13:07,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:13:07,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 20:13:07,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269025136] [2024-11-12 20:13:07,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:13:07,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 20:13:07,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:13:07,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 20:13:07,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 20:13:07,273 INFO L87 Difference]: Start difference. First operand 1343 states and 2470 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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-12 20:13:07,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:13:07,408 INFO L93 Difference]: Finished difference Result 3907 states and 7260 transitions. [2024-11-12 20:13:07,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 20:13:07,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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 81 [2024-11-12 20:13:07,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:13:07,427 INFO L225 Difference]: With dead ends: 3907 [2024-11-12 20:13:07,427 INFO L226 Difference]: Without dead ends: 2572 [2024-11-12 20:13:07,432 INFO L434 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-12 20:13:07,433 INFO L435 NwaCegarLoop]: 2903 mSDtfsCounter, 1267 mSDsluCounter, 2444 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1767 SdHoareTripleChecker+Valid, 5347 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 20:13:07,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1767 Valid, 5347 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 20:13:07,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2572 states. [2024-11-12 20:13:07,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2572 to 2568. [2024-11-12 20:13:07,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2568 states, 1555 states have (on average 1.7942122186495177) internal successors, (2790), 2562 states have internal predecessors, (2790), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-12 20:13:07,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2568 states to 2568 states and 4796 transitions. [2024-11-12 20:13:07,696 INFO L78 Accepts]: Start accepts. Automaton has 2568 states and 4796 transitions. Word has length 81 [2024-11-12 20:13:07,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:13:07,697 INFO L471 AbstractCegarLoop]: Abstraction has 2568 states and 4796 transitions. [2024-11-12 20:13:07,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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-12 20:13:07,697 INFO L276 IsEmpty]: Start isEmpty. Operand 2568 states and 4796 transitions. [2024-11-12 20:13:07,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-12 20:13:07,698 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:13:07,698 INFO L218 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] [2024-11-12 20:13:07,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 20:13:07,699 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 20:13:07,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:13:07,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1828556033, now seen corresponding path program 1 times [2024-11-12 20:13:07,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:13:07,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429737906] [2024-11-12 20:13:07,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:13:07,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:13:07,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:13:07,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 20:13:07,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:13:07,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-12 20:13:07,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:13:07,891 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-12 20:13:07,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:13:07,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429737906] [2024-11-12 20:13:07,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429737906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:13:07,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:13:07,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 20:13:07,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466886082] [2024-11-12 20:13:07,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:13:07,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 20:13:07,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:13:07,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 20:13:07,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 20:13:07,897 INFO L87 Difference]: Start difference. First operand 2568 states and 4796 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 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-12 20:13:10,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:13:10,011 INFO L93 Difference]: Finished difference Result 5103 states and 9558 transitions. [2024-11-12 20:13:10,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 20:13:10,012 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 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 96 [2024-11-12 20:13:10,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:13:10,036 INFO L225 Difference]: With dead ends: 5103 [2024-11-12 20:13:10,037 INFO L226 Difference]: Without dead ends: 2571 [2024-11-12 20:13:10,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 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-12 20:13:10,046 INFO L435 NwaCegarLoop]: 2448 mSDtfsCounter, 7 mSDsluCounter, 3322 mSDsCounter, 0 mSdLazyCounter, 1094 mSolverCounterSat, 508 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 5770 SdHoareTripleChecker+Invalid, 1602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 508 IncrementalHoareTripleChecker+Valid, 1094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-12 20:13:10,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 5770 Invalid, 1602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [508 Valid, 1094 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-12 20:13:10,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2571 states. [2024-11-12 20:13:10,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2571 to 2568. [2024-11-12 20:13:10,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2568 states, 1555 states have (on average 1.790353697749196) internal successors, (2784), 2562 states have internal predecessors, (2784), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-12 20:13:10,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2568 states to 2568 states and 4790 transitions. [2024-11-12 20:13:10,402 INFO L78 Accepts]: Start accepts. Automaton has 2568 states and 4790 transitions. Word has length 96 [2024-11-12 20:13:10,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:13:10,403 INFO L471 AbstractCegarLoop]: Abstraction has 2568 states and 4790 transitions. [2024-11-12 20:13:10,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 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-12 20:13:10,403 INFO L276 IsEmpty]: Start isEmpty. Operand 2568 states and 4790 transitions. [2024-11-12 20:13:10,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-12 20:13:10,404 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:13:10,404 INFO L218 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] [2024-11-12 20:13:10,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 20:13:10,405 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 20:13:10,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:13:10,406 INFO L85 PathProgramCache]: Analyzing trace with hash 275020411, now seen corresponding path program 1 times [2024-11-12 20:13:10,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:13:10,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468413715] [2024-11-12 20:13:10,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:13:10,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:13:10,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:13:10,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 20:13:10,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:13:10,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-12 20:13:10,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:13:10,815 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-12 20:13:10,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:13:10,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468413715] [2024-11-12 20:13:10,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468413715] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:13:10,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:13:10,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 20:13:10,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42226331] [2024-11-12 20:13:10,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:13:10,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 20:13:10,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:13:10,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 20:13:10,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 20:13:10,817 INFO L87 Difference]: Start difference. First operand 2568 states and 4790 transitions. Second operand has 5 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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-12 20:13:15,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:13:15,069 INFO L93 Difference]: Finished difference Result 4813 states and 9140 transitions. [2024-11-12 20:13:15,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 20:13:15,070 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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 96 [2024-11-12 20:13:15,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:13:15,099 INFO L225 Difference]: With dead ends: 4813 [2024-11-12 20:13:15,099 INFO L226 Difference]: Without dead ends: 4811 [2024-11-12 20:13:15,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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-12 20:13:15,101 INFO L435 NwaCegarLoop]: 2716 mSDtfsCounter, 1357 mSDsluCounter, 4806 mSDsCounter, 0 mSdLazyCounter, 2650 mSolverCounterSat, 1006 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1859 SdHoareTripleChecker+Valid, 7522 SdHoareTripleChecker+Invalid, 3656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1006 IncrementalHoareTripleChecker+Valid, 2650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-12 20:13:15,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1859 Valid, 7522 Invalid, 3656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1006 Valid, 2650 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-12 20:13:15,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4811 states. [2024-11-12 20:13:15,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4811 to 2632. [2024-11-12 20:13:15,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2632 states, 1616 states have (on average 1.771039603960396) internal successors, (2862), 2623 states have internal predecessors, (2862), 1006 states have call successors, (1006), 2 states have call predecessors, (1006), 2 states have return successors, (1006), 8 states have call predecessors, (1006), 1006 states have call successors, (1006) [2024-11-12 20:13:15,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2632 states to 2632 states and 4874 transitions. [2024-11-12 20:13:15,619 INFO L78 Accepts]: Start accepts. Automaton has 2632 states and 4874 transitions. Word has length 96 [2024-11-12 20:13:15,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:13:15,621 INFO L471 AbstractCegarLoop]: Abstraction has 2632 states and 4874 transitions. [2024-11-12 20:13:15,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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-12 20:13:15,621 INFO L276 IsEmpty]: Start isEmpty. Operand 2632 states and 4874 transitions. [2024-11-12 20:13:15,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-12 20:13:15,622 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:13:15,623 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:13:15,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 20:13:15,623 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 20:13:15,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:13:15,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1006911910, now seen corresponding path program 1 times [2024-11-12 20:13:15,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:13:15,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944465833] [2024-11-12 20:13:15,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:13:15,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:13:15,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:13:16,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 20:13:16,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:13:16,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-12 20:13:16,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:13:16,097 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 20:13:16,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:13:16,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944465833] [2024-11-12 20:13:16,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944465833] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:13:16,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079976261] [2024-11-12 20:13:16,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:13:16,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:13:16,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:13:16,101 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-12 20:13:16,103 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-12 20:13:16,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:13:16,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-12 20:13:16,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:13:16,457 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-12 20:13:16,484 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-12 20:13:16,505 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-12 20:13:17,323 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 20:13:17,323 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 20:13:17,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079976261] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:13:17,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 20:13:17,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2024-11-12 20:13:17,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577263005] [2024-11-12 20:13:17,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:13:17,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 20:13:17,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:13:17,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 20:13:17,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-12 20:13:17,325 INFO L87 Difference]: Start difference. First operand 2632 states and 4874 transitions. Second operand has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 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-12 20:13:19,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:13:19,216 INFO L93 Difference]: Finished difference Result 7396 states and 13955 transitions. [2024-11-12 20:13:19,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 20:13:19,217 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 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 102 [2024-11-12 20:13:19,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:13:19,259 INFO L225 Difference]: With dead ends: 7396 [2024-11-12 20:13:19,259 INFO L226 Difference]: Without dead ends: 4810 [2024-11-12 20:13:19,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 96 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-12 20:13:19,271 INFO L435 NwaCegarLoop]: 2721 mSDtfsCounter, 1554 mSDsluCounter, 12523 mSDsCounter, 0 mSdLazyCounter, 1009 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2056 SdHoareTripleChecker+Valid, 15244 SdHoareTripleChecker+Invalid, 1014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-12 20:13:19,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2056 Valid, 15244 Invalid, 1014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1009 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-12 20:13:19,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2024-11-12 20:13:19,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 2632. [2024-11-12 20:13:19,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2632 states, 1616 states have (on average 1.7704207920792079) internal successors, (2861), 2623 states have internal predecessors, (2861), 1006 states have call successors, (1006), 2 states have call predecessors, (1006), 2 states have return successors, (1006), 8 states have call predecessors, (1006), 1006 states have call successors, (1006) [2024-11-12 20:13:19,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2632 states to 2632 states and 4873 transitions. [2024-11-12 20:13:19,886 INFO L78 Accepts]: Start accepts. Automaton has 2632 states and 4873 transitions. Word has length 102 [2024-11-12 20:13:19,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:13:19,886 INFO L471 AbstractCegarLoop]: Abstraction has 2632 states and 4873 transitions. [2024-11-12 20:13:19,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 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-12 20:13:19,887 INFO L276 IsEmpty]: Start isEmpty. Operand 2632 states and 4873 transitions. [2024-11-12 20:13:19,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-12 20:13:19,887 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:13:19,888 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:13:19,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 20:13:20,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-12 20:13:20,092 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 20:13:20,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:13:20,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1758387251, now seen corresponding path program 1 times [2024-11-12 20:13:20,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:13:20,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866185466] [2024-11-12 20:13:20,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:13:20,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:13:20,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:13:20,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-12 20:13:20,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:13:20,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 20:13:20,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:13:20,437 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 20:13:20,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:13:20,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866185466] [2024-11-12 20:13:20,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866185466] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:13:20,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741307040] [2024-11-12 20:13:20,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:13:20,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:13:20,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:13:20,440 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-12 20:13:20,441 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-12 20:13:21,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:13:21,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-12 20:13:21,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:13:50,810 WARN L286 SmtUtils]: Spent 8.67s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)