./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-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_SAX_test2-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 d619c50f205026415119876db06c9bf079f51316bee7c051af8e3a06a37e393d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 20:20:26,715 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 20:20:26,786 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-12 20:20:26,794 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 20:20:26,795 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 20:20:26,828 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 20:20:26,831 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 20:20:26,831 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 20:20:26,832 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 20:20:26,833 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 20:20:26,834 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 20:20:26,834 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 20:20:26,834 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 20:20:26,835 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 20:20:26,837 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 20:20:26,837 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 20:20:26,838 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 20:20:26,838 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 20:20:26,838 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 20:20:26,839 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 20:20:26,839 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 20:20:26,844 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 20:20:26,845 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 20:20:26,845 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 20:20:26,845 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 20:20:26,846 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-12 20:20:26,846 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 20:20:26,846 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 20:20:26,846 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 20:20:26,847 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 20:20:26,847 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 20:20:26,847 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 20:20:26,847 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 20:20:26,848 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 20:20:26,848 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 20:20:26,848 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 20:20:26,848 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 20:20:26,848 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 20:20:26,849 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 20:20:26,849 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 20:20:26,849 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 20:20:26,850 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 20:20:26,850 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 20:20:26,851 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 20:20:26,851 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 -> d619c50f205026415119876db06c9bf079f51316bee7c051af8e3a06a37e393d [2024-11-12 20:20:27,103 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 20:20:27,132 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 20:20:27,134 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 20:20:27,136 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 20:20:27,136 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 20:20:27,137 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-2.i [2024-11-12 20:20:28,639 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 20:20:28,926 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 20:20:28,929 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-2.i [2024-11-12 20:20:28,956 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd33a4765/647c1d0383344aa8ad1850f79b4644d0/FLAG07fed0fbe [2024-11-12 20:20:28,973 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd33a4765/647c1d0383344aa8ad1850f79b4644d0 [2024-11-12 20:20:28,976 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 20:20:28,978 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 20:20:28,979 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 20:20:28,979 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 20:20:28,988 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 20:20:28,989 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:20:28" (1/1) ... [2024-11-12 20:20:28,991 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42dec9f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:20:28, skipping insertion in model container [2024-11-12 20:20:28,992 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:20:28" (1/1) ... [2024-11-12 20:20:29,045 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 20:20:29,639 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 20:20:29,659 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 20:20:29,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 20:20:29,837 INFO L204 MainTranslator]: Completed translation [2024-11-12 20:20:29,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:20:29 WrapperNode [2024-11-12 20:20:29,838 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 20:20:29,839 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 20:20:29,839 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 20:20:29,839 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 20:20:29,846 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:20:29" (1/1) ... [2024-11-12 20:20:29,884 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:20:29" (1/1) ... [2024-11-12 20:20:29,961 INFO L138 Inliner]: procedures = 208, calls = 280, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1476 [2024-11-12 20:20:29,961 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 20:20:29,962 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 20:20:29,962 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 20:20:29,962 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 20:20:29,980 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:20:29" (1/1) ... [2024-11-12 20:20:29,980 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:20:29" (1/1) ... [2024-11-12 20:20:29,991 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:20:29" (1/1) ... [2024-11-12 20:20:30,092 INFO L175 MemorySlicer]: Split 256 memory accesses to 3 slices as follows [2, 34, 220]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 4, 50]. [2024-11-12 20:20:30,093 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:20:29" (1/1) ... [2024-11-12 20:20:30,093 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:20:29" (1/1) ... [2024-11-12 20:20:30,143 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:20:29" (1/1) ... [2024-11-12 20:20:30,163 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:20:29" (1/1) ... [2024-11-12 20:20:30,170 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:20:29" (1/1) ... [2024-11-12 20:20:30,177 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:20:29" (1/1) ... [2024-11-12 20:20:30,186 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 20:20:30,187 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 20:20:30,188 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 20:20:30,188 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 20:20:30,189 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:20:29" (1/1) ... [2024-11-12 20:20:30,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 20:20:30,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:20:30,230 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:20:30,232 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:20:30,281 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-12 20:20:30,281 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-12 20:20:30,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-12 20:20:30,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-12 20:20:30,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-12 20:20:30,282 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-12 20:20:30,282 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-12 20:20:30,282 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-12 20:20:30,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-12 20:20:30,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-12 20:20:30,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-12 20:20:30,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-12 20:20:30,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 20:20:30,285 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-12 20:20:30,285 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-12 20:20:30,285 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-12 20:20:30,285 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-12 20:20:30,285 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-12 20:20:30,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 20:20:30,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-12 20:20:30,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-12 20:20:30,286 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 20:20:30,286 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 20:20:30,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-12 20:20:30,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-12 20:20:30,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-12 20:20:30,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 20:20:30,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-12 20:20:30,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-12 20:20:30,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 20:20:30,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 20:20:30,541 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 20:20:30,543 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 20:20:32,011 INFO L? ?]: Removed 340 outVars from TransFormulas that were not future-live. [2024-11-12 20:20:32,011 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 20:20:32,032 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 20:20:32,035 INFO L316 CfgBuilder]: Removed 63 assume(true) statements. [2024-11-12 20:20:32,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:20:32 BoogieIcfgContainer [2024-11-12 20:20:32,035 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 20:20:32,037 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 20:20:32,037 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 20:20:32,041 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 20:20:32,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 08:20:28" (1/3) ... [2024-11-12 20:20:32,042 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d5f6204 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:20:32, skipping insertion in model container [2024-11-12 20:20:32,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:20:29" (2/3) ... [2024-11-12 20:20:32,043 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d5f6204 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:20:32, skipping insertion in model container [2024-11-12 20:20:32,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:20:32" (3/3) ... [2024-11-12 20:20:32,044 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test2-2.i [2024-11-12 20:20:32,061 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 20:20:32,062 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-11-12 20:20:32,152 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 20:20:32,162 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;@12a83400, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 20:20:32,162 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-12 20:20:32,168 INFO L276 IsEmpty]: Start isEmpty. Operand has 433 states, 411 states have (on average 1.6277372262773722) internal successors, (669), 426 states have internal predecessors, (669), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-12 20:20:32,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-12 20:20:32,174 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:20:32,176 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:20:32,176 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:20:32,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:20:32,183 INFO L85 PathProgramCache]: Analyzing trace with hash 170881670, now seen corresponding path program 1 times [2024-11-12 20:20:32,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:20:32,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904395095] [2024-11-12 20:20:32,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:20:32,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:20:32,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:32,384 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:20:32,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:20:32,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904395095] [2024-11-12 20:20:32,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904395095] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:20:32,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:20:32,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 20:20:32,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604091991] [2024-11-12 20:20:32,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:20:32,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 20:20:32,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:20:32,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 20:20:32,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 20:20:32,430 INFO L87 Difference]: Start difference. First operand has 433 states, 411 states have (on average 1.6277372262773722) internal successors, (669), 426 states have internal predecessors, (669), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) 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:20:32,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:20:32,491 INFO L93 Difference]: Finished difference Result 862 states and 1380 transitions. [2024-11-12 20:20:32,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 20:20:32,494 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:20:32,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:20:32,509 INFO L225 Difference]: With dead ends: 862 [2024-11-12 20:20:32,509 INFO L226 Difference]: Without dead ends: 389 [2024-11-12 20:20:32,515 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:20:32,520 INFO L435 NwaCegarLoop]: 617 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, 617 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:20:32,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 20:20:32,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2024-11-12 20:20:32,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 389. [2024-11-12 20:20:32,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 371 states have (on average 1.4690026954177897) internal successors, (545), 383 states have internal predecessors, (545), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 20:20:32,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 561 transitions. [2024-11-12 20:20:32,595 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 561 transitions. Word has length 7 [2024-11-12 20:20:32,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:20:32,596 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 561 transitions. [2024-11-12 20:20:32,596 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:20:32,596 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 561 transitions. [2024-11-12 20:20:32,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-12 20:20:32,598 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:20:32,599 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:20:32,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 20:20:32,599 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:20:32,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:20:32,600 INFO L85 PathProgramCache]: Analyzing trace with hash 170883592, now seen corresponding path program 1 times [2024-11-12 20:20:32,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:20:32,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757188908] [2024-11-12 20:20:32,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:20:32,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:20:32,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 20:20:32,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1657191940] [2024-11-12 20:20:32,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:20:32,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:20:32,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:20:32,693 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:20:32,695 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:20:32,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:32,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 20:20:32,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:20:32,929 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:20:32,962 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:20:32,962 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 20:20:32,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:20:32,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757188908] [2024-11-12 20:20:32,963 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 20:20:32,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657191940] [2024-11-12 20:20:32,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657191940] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:20:32,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:20:32,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 20:20:32,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729325551] [2024-11-12 20:20:32,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:20:32,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 20:20:32,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:20:32,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 20:20:32,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 20:20:32,967 INFO L87 Difference]: Start difference. First operand 389 states and 561 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:20:33,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:20:33,132 INFO L93 Difference]: Finished difference Result 768 states and 1113 transitions. [2024-11-12 20:20:33,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 20:20:33,133 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:20:33,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:20:33,138 INFO L225 Difference]: With dead ends: 768 [2024-11-12 20:20:33,138 INFO L226 Difference]: Without dead ends: 766 [2024-11-12 20:20:33,139 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:20:33,140 INFO L435 NwaCegarLoop]: 582 mSDtfsCounter, 529 mSDsluCounter, 1110 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 1692 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 20:20:33,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [537 Valid, 1692 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 20:20:33,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2024-11-12 20:20:33,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 395. [2024-11-12 20:20:33,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 377 states have (on average 1.4641909814323608) internal successors, (552), 389 states have internal predecessors, (552), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 20:20:33,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 568 transitions. [2024-11-12 20:20:33,187 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 568 transitions. Word has length 7 [2024-11-12 20:20:33,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:20:33,189 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 568 transitions. [2024-11-12 20:20:33,189 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:20:33,189 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 568 transitions. [2024-11-12 20:20:33,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-12 20:20:33,193 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:20:33,193 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:20:33,215 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:20:33,396 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:20:33,396 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:20:33,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:20:33,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1584338109, now seen corresponding path program 1 times [2024-11-12 20:20:33,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:20:33,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384750319] [2024-11-12 20:20:33,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:20:33,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:20:33,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:33,798 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:20:33,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:20:33,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384750319] [2024-11-12 20:20:33,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384750319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:20:33,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:20:33,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 20:20:33,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153765815] [2024-11-12 20:20:33,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:20:33,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 20:20:33,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:20:33,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 20:20:33,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 20:20:33,803 INFO L87 Difference]: Start difference. First operand 395 states and 568 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:20:33,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:20:33,953 INFO L93 Difference]: Finished difference Result 945 states and 1374 transitions. [2024-11-12 20:20:33,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 20:20:33,954 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:20:33,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:20:33,960 INFO L225 Difference]: With dead ends: 945 [2024-11-12 20:20:33,961 INFO L226 Difference]: Without dead ends: 765 [2024-11-12 20:20:33,962 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:20:33,963 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 530 mSDsluCounter, 1070 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 1611 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 20:20:33,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 1611 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 20:20:33,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2024-11-12 20:20:33,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 395. [2024-11-12 20:20:33,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 377 states have (on average 1.4615384615384615) internal successors, (551), 389 states have internal predecessors, (551), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 20:20:33,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 567 transitions. [2024-11-12 20:20:33,984 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 567 transitions. Word has length 64 [2024-11-12 20:20:33,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:20:33,984 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 567 transitions. [2024-11-12 20:20:33,984 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:20:33,985 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 567 transitions. [2024-11-12 20:20:33,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-12 20:20:33,990 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:20:33,990 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:20:33,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 20:20:33,990 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:20:33,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:20:33,992 INFO L85 PathProgramCache]: Analyzing trace with hash 205854116, now seen corresponding path program 1 times [2024-11-12 20:20:33,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:20:33,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567956543] [2024-11-12 20:20:33,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:20:33,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:20:34,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:34,257 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:20:34,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:20:34,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567956543] [2024-11-12 20:20:34,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567956543] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:20:34,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:20:34,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 20:20:34,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46574615] [2024-11-12 20:20:34,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:20:34,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 20:20:34,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:20:34,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 20:20:34,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 20:20:34,259 INFO L87 Difference]: Start difference. First operand 395 states and 567 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:20:34,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:20:34,337 INFO L93 Difference]: Finished difference Result 785 states and 1129 transitions. [2024-11-12 20:20:34,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 20:20:34,338 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:20:34,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:20:34,341 INFO L225 Difference]: With dead ends: 785 [2024-11-12 20:20:34,342 INFO L226 Difference]: Without dead ends: 398 [2024-11-12 20:20:34,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:20:34,345 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 108 mSDsluCounter, 973 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 1506 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 20:20:34,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 1506 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 20:20:34,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2024-11-12 20:20:34,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 395. [2024-11-12 20:20:34,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 377 states have (on average 1.442970822281167) internal successors, (544), 389 states have internal predecessors, (544), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 20:20:34,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 560 transitions. [2024-11-12 20:20:34,359 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 560 transitions. Word has length 81 [2024-11-12 20:20:34,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:20:34,359 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 560 transitions. [2024-11-12 20:20:34,359 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:20:34,360 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 560 transitions. [2024-11-12 20:20:34,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-12 20:20:34,364 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:20:34,365 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:20:34,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 20:20:34,365 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:20:34,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:20:34,366 INFO L85 PathProgramCache]: Analyzing trace with hash 774993816, now seen corresponding path program 1 times [2024-11-12 20:20:34,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:20:34,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059975870] [2024-11-12 20:20:34,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:20:34,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:20:34,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:34,572 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:20:34,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:20:34,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059975870] [2024-11-12 20:20:34,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059975870] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:20:34,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:20:34,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 20:20:34,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72320468] [2024-11-12 20:20:34,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:20:34,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 20:20:34,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:20:34,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 20:20:34,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 20:20:34,577 INFO L87 Difference]: Start difference. First operand 395 states and 560 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:20:34,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:20:34,666 INFO L93 Difference]: Finished difference Result 1063 states and 1530 transitions. [2024-11-12 20:20:34,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 20:20:34,666 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:20:34,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:20:34,671 INFO L225 Difference]: With dead ends: 1063 [2024-11-12 20:20:34,671 INFO L226 Difference]: Without dead ends: 676 [2024-11-12 20:20:34,672 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:20:34,675 INFO L435 NwaCegarLoop]: 749 mSDtfsCounter, 353 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 1289 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.1s IncrementalHoareTripleChecker+Time [2024-11-12 20:20:34,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 1289 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 20:20:34,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2024-11-12 20:20:34,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 672. [2024-11-12 20:20:34,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 649 states have (on average 1.4637904468412943) internal successors, (950), 666 states have internal predecessors, (950), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-12 20:20:34,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 976 transitions. [2024-11-12 20:20:34,708 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 976 transitions. Word has length 81 [2024-11-12 20:20:34,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:20:34,709 INFO L471 AbstractCegarLoop]: Abstraction has 672 states and 976 transitions. [2024-11-12 20:20:34,711 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:20:34,712 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 976 transitions. [2024-11-12 20:20:34,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-12 20:20:34,713 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:20:34,713 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:20:34,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 20:20:34,713 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:20:34,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:20:34,715 INFO L85 PathProgramCache]: Analyzing trace with hash -63787779, now seen corresponding path program 1 times [2024-11-12 20:20:34,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:20:34,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343570424] [2024-11-12 20:20:34,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:20:34,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:20:34,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:34,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 20:20:34,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:34,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-12 20:20:34,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:34,925 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:20:34,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:20:34,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343570424] [2024-11-12 20:20:34,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343570424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:20:34,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:20:34,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 20:20:34,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111930698] [2024-11-12 20:20:34,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:20:34,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 20:20:34,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:20:34,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 20:20:34,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 20:20:34,930 INFO L87 Difference]: Start difference. First operand 672 states and 976 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:20:35,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:20:35,207 INFO L93 Difference]: Finished difference Result 1281 states and 1868 transitions. [2024-11-12 20:20:35,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 20:20:35,207 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:20:35,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:20:35,211 INFO L225 Difference]: With dead ends: 1281 [2024-11-12 20:20:35,211 INFO L226 Difference]: Without dead ends: 687 [2024-11-12 20:20:35,212 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:20:35,214 INFO L435 NwaCegarLoop]: 544 mSDtfsCounter, 7 mSDsluCounter, 998 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1542 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 20:20:35,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1542 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 20:20:35,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2024-11-12 20:20:35,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 684. [2024-11-12 20:20:35,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 661 states have (on average 1.4553706505295008) internal successors, (962), 678 states have internal predecessors, (962), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-12 20:20:35,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 988 transitions. [2024-11-12 20:20:35,235 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 988 transitions. Word has length 96 [2024-11-12 20:20:35,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:20:35,235 INFO L471 AbstractCegarLoop]: Abstraction has 684 states and 988 transitions. [2024-11-12 20:20:35,236 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:20:35,236 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 988 transitions. [2024-11-12 20:20:35,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-12 20:20:35,239 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:20:35,239 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:20:35,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 20:20:35,239 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:20:35,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:20:35,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1622392059, now seen corresponding path program 1 times [2024-11-12 20:20:35,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:20:35,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096795479] [2024-11-12 20:20:35,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:20:35,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:20:35,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:35,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 20:20:35,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:35,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-12 20:20:35,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:35,607 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:20:35,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:20:35,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096795479] [2024-11-12 20:20:35,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096795479] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:20:35,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:20:35,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 20:20:35,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594881113] [2024-11-12 20:20:35,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:20:35,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 20:20:35,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:20:35,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 20:20:35,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 20:20:35,613 INFO L87 Difference]: Start difference. First operand 684 states and 988 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:20:35,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:20:35,973 INFO L93 Difference]: Finished difference Result 949 states and 1378 transitions. [2024-11-12 20:20:35,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 20:20:35,973 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:20:35,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:20:35,980 INFO L225 Difference]: With dead ends: 949 [2024-11-12 20:20:35,980 INFO L226 Difference]: Without dead ends: 947 [2024-11-12 20:20:35,981 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:20:35,982 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 443 mSDsluCounter, 1500 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 2032 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 20:20:35,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 2032 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 20:20:35,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2024-11-12 20:20:36,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 748. [2024-11-12 20:20:36,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 722 states have (on average 1.440443213296399) internal successors, (1040), 739 states have internal predecessors, (1040), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 8 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-12 20:20:36,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1072 transitions. [2024-11-12 20:20:36,007 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1072 transitions. Word has length 96 [2024-11-12 20:20:36,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:20:36,008 INFO L471 AbstractCegarLoop]: Abstraction has 748 states and 1072 transitions. [2024-11-12 20:20:36,008 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:20:36,008 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1072 transitions. [2024-11-12 20:20:36,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-12 20:20:36,009 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:20:36,009 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:20:36,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 20:20:36,010 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:20:36,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:20:36,010 INFO L85 PathProgramCache]: Analyzing trace with hash 728703194, now seen corresponding path program 1 times [2024-11-12 20:20:36,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:20:36,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652163605] [2024-11-12 20:20:36,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:20:36,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:20:36,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:36,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 20:20:36,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:36,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-12 20:20:36,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:36,471 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:20:36,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:20:36,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652163605] [2024-11-12 20:20:36,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652163605] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:20:36,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624414708] [2024-11-12 20:20:36,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:20:36,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:20:36,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:20:36,475 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:20:36,476 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:20:36,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:36,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-12 20:20:36,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:20:36,814 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:20:36,840 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:20:36,862 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:20:37,718 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:20:37,718 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 20:20:37,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624414708] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:20:37,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 20:20:37,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2024-11-12 20:20:37,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455455594] [2024-11-12 20:20:37,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:20:37,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 20:20:37,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:20:37,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 20:20:37,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-12 20:20:37,721 INFO L87 Difference]: Start difference. First operand 748 states and 1072 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:20:39,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:20:39,572 INFO L93 Difference]: Finished difference Result 1635 states and 2355 transitions. [2024-11-12 20:20:39,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 20:20:39,573 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:20:39,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:20:39,577 INFO L225 Difference]: With dead ends: 1635 [2024-11-12 20:20:39,577 INFO L226 Difference]: Without dead ends: 981 [2024-11-12 20:20:39,579 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:20:39,580 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 794 mSDsluCounter, 2483 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 801 SdHoareTripleChecker+Valid, 3004 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-12 20:20:39,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [801 Valid, 3004 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 913 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-12 20:20:39,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2024-11-12 20:20:39,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 780. [2024-11-12 20:20:39,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 780 states, 754 states have (on average 1.4283819628647214) internal successors, (1077), 771 states have internal predecessors, (1077), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 8 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-12 20:20:39,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1109 transitions. [2024-11-12 20:20:39,605 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1109 transitions. Word has length 102 [2024-11-12 20:20:39,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:20:39,607 INFO L471 AbstractCegarLoop]: Abstraction has 780 states and 1109 transitions. [2024-11-12 20:20:39,607 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:20:39,607 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1109 transitions. [2024-11-12 20:20:39,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-12 20:20:39,608 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:20:39,608 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:20:39,627 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:20:39,812 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:20:39,813 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:20:39,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:20:39,813 INFO L85 PathProgramCache]: Analyzing trace with hash -800964941, now seen corresponding path program 1 times [2024-11-12 20:20:39,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:20:39,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523509849] [2024-11-12 20:20:39,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:20:39,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:20:40,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:40,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-12 20:20:40,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:40,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 20:20:40,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:40,301 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:20:40,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:20:40,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523509849] [2024-11-12 20:20:40,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523509849] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:20:40,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650190261] [2024-11-12 20:20:40,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:20:40,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:20:40,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:20:40,304 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:20:40,305 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:20:40,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:40,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-12 20:20:40,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:21:10,472 WARN L286 SmtUtils]: Spent 5.07s 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)