./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3061b6dc 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_BER_test9-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 50ec0e1b32f61b9ee697cf2c7598d178ee7b7b08e68108a0f594c4a6a80ab80c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 13:30:36,001 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 13:30:36,082 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-19 13:30:36,087 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 13:30:36,088 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 13:30:36,119 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 13:30:36,120 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 13:30:36,120 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 13:30:36,121 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 13:30:36,123 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 13:30:36,123 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 13:30:36,123 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 13:30:36,124 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 13:30:36,125 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 13:30:36,126 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 13:30:36,126 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 13:30:36,126 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 13:30:36,126 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 13:30:36,127 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 13:30:36,127 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 13:30:36,127 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 13:30:36,128 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 13:30:36,128 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 13:30:36,129 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 13:30:36,129 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 13:30:36,129 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-19 13:30:36,129 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 13:30:36,130 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 13:30:36,130 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 13:30:36,130 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 13:30:36,131 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 13:30:36,131 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 13:30:36,131 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 13:30:36,131 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 13:30:36,131 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 13:30:36,132 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 13:30:36,132 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 13:30:36,132 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 13:30:36,132 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 13:30:36,132 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 13:30:36,133 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 13:30:36,133 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 13:30:36,134 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 13:30:36,134 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 13:30:36,135 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 -> 50ec0e1b32f61b9ee697cf2c7598d178ee7b7b08e68108a0f594c4a6a80ab80c [2024-11-19 13:30:36,391 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 13:30:36,415 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 13:30:36,419 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 13:30:36,420 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 13:30:36,421 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 13:30:36,422 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-2.i [2024-11-19 13:30:37,867 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 13:30:38,244 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 13:30:38,245 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-2.i [2024-11-19 13:30:38,267 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f862c37f3/198c316315c5464ab501b425428c898c/FLAG873b19d42 [2024-11-19 13:30:38,436 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f862c37f3/198c316315c5464ab501b425428c898c [2024-11-19 13:30:38,438 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 13:30:38,440 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 13:30:38,441 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 13:30:38,441 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 13:30:38,446 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 13:30:38,447 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:30:38" (1/1) ... [2024-11-19 13:30:38,448 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bf52849 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:30:38, skipping insertion in model container [2024-11-19 13:30:38,448 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:30:38" (1/1) ... [2024-11-19 13:30:38,512 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 13:30:39,144 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 13:30:39,152 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 13:30:39,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 13:30:39,307 INFO L204 MainTranslator]: Completed translation [2024-11-19 13:30:39,308 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:30:39 WrapperNode [2024-11-19 13:30:39,308 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 13:30:39,309 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 13:30:39,309 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 13:30:39,309 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 13:30:39,316 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:30:39" (1/1) ... [2024-11-19 13:30:39,365 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:30:39" (1/1) ... [2024-11-19 13:30:39,477 INFO L138 Inliner]: procedures = 177, calls = 775, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3456 [2024-11-19 13:30:39,477 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 13:30:39,478 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 13:30:39,478 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 13:30:39,478 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 13:30:39,488 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:30:39" (1/1) ... [2024-11-19 13:30:39,489 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:30:39" (1/1) ... [2024-11-19 13:30:39,515 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:30:39" (1/1) ... [2024-11-19 13:30:39,614 INFO L175 MemorySlicer]: Split 256 memory accesses to 3 slices as follows [2, 220, 34]. 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, 50, 4]. [2024-11-19 13:30:39,615 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:30:39" (1/1) ... [2024-11-19 13:30:39,615 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:30:39" (1/1) ... [2024-11-19 13:30:39,666 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:30:39" (1/1) ... [2024-11-19 13:30:39,762 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:30:39" (1/1) ... [2024-11-19 13:30:39,772 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:30:39" (1/1) ... [2024-11-19 13:30:39,787 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:30:39" (1/1) ... [2024-11-19 13:30:39,800 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 13:30:39,801 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 13:30:39,801 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 13:30:39,802 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 13:30:39,803 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:30:39" (1/1) ... [2024-11-19 13:30:39,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 13:30:39,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 13:30:39,836 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-19 13:30:39,842 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-19 13:30:39,878 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-19 13:30:39,878 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-19 13:30:39,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 13:30:39,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 13:30:39,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 13:30:39,879 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-19 13:30:39,879 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-19 13:30:39,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 13:30:39,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 13:30:39,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 13:30:39,879 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-19 13:30:39,879 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-19 13:30:39,879 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-19 13:30:39,879 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-19 13:30:39,879 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-19 13:30:39,879 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-19 13:30:39,880 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 13:30:39,880 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 13:30:39,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 13:30:39,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 13:30:39,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 13:30:39,880 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 13:30:39,880 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 13:30:39,880 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 13:30:39,880 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 13:30:39,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 13:30:39,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 13:30:39,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 13:30:39,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 13:30:39,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 13:30:39,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 13:30:40,105 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 13:30:40,107 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 13:30:42,771 INFO L? ?]: Removed 835 outVars from TransFormulas that were not future-live. [2024-11-19 13:30:42,771 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 13:30:42,819 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 13:30:42,819 INFO L316 CfgBuilder]: Removed 63 assume(true) statements. [2024-11-19 13:30:42,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:30:42 BoogieIcfgContainer [2024-11-19 13:30:42,820 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 13:30:42,822 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 13:30:42,822 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 13:30:42,825 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 13:30:42,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:30:38" (1/3) ... [2024-11-19 13:30:42,826 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2256d820 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:30:42, skipping insertion in model container [2024-11-19 13:30:42,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:30:39" (2/3) ... [2024-11-19 13:30:42,827 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2256d820 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:30:42, skipping insertion in model container [2024-11-19 13:30:42,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:30:42" (3/3) ... [2024-11-19 13:30:42,828 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test9-2.i [2024-11-19 13:30:42,843 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 13:30:42,844 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-11-19 13:30:42,950 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 13:30:42,957 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;@62cedd01, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 13:30:42,957 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-19 13:30:42,969 INFO L276 IsEmpty]: Start isEmpty. Operand has 1423 states, 906 states have (on average 1.8311258278145695) internal successors, (1659), 1416 states have internal predecessors, (1659), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) [2024-11-19 13:30:42,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-19 13:30:42,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:30:42,975 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 13:30:42,976 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-19 13:30:42,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:30:42,981 INFO L85 PathProgramCache]: Analyzing trace with hash 170881670, now seen corresponding path program 1 times [2024-11-19 13:30:42,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:30:42,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520680692] [2024-11-19 13:30:42,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:30:42,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:30:43,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:30:43,172 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-19 13:30:43,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:30:43,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520680692] [2024-11-19 13:30:43,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520680692] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:30:43,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 13:30:43,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 13:30:43,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295349227] [2024-11-19 13:30:43,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:30:43,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 13:30:43,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:30:43,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 13:30:43,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 13:30:43,218 INFO L87 Difference]: Start difference. First operand has 1423 states, 906 states have (on average 1.8311258278145695) internal successors, (1659), 1416 states have internal predecessors, (1659), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 13:30:43,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:30:43,384 INFO L93 Difference]: Finished difference Result 2842 states and 5835 transitions. [2024-11-19 13:30:43,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 13:30:43,387 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-19 13:30:43,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:30:43,428 INFO L225 Difference]: With dead ends: 2842 [2024-11-19 13:30:43,428 INFO L226 Difference]: Without dead ends: 1379 [2024-11-19 13:30:43,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 13:30:43,445 INFO L432 NwaCegarLoop]: 2597 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2597 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 13:30:43,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2597 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 13:30:43,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2024-11-19 13:30:43,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1379. [2024-11-19 13:30:43,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1379 states, 866 states have (on average 1.7725173210161662) internal successors, (1535), 1373 states have internal predecessors, (1535), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-19 13:30:43,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1379 states to 1379 states and 2541 transitions. [2024-11-19 13:30:43,831 INFO L78 Accepts]: Start accepts. Automaton has 1379 states and 2541 transitions. Word has length 7 [2024-11-19 13:30:43,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:30:43,832 INFO L471 AbstractCegarLoop]: Abstraction has 1379 states and 2541 transitions. [2024-11-19 13:30:43,832 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-19 13:30:43,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1379 states and 2541 transitions. [2024-11-19 13:30:43,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-19 13:30:43,833 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:30:43,833 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 13:30:43,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 13:30:43,834 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-19 13:30:43,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:30:43,835 INFO L85 PathProgramCache]: Analyzing trace with hash 170883592, now seen corresponding path program 1 times [2024-11-19 13:30:43,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:30:43,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866209384] [2024-11-19 13:30:43,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:30:43,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:30:43,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 13:30:43,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1287725943] [2024-11-19 13:30:43,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:30:43,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 13:30:43,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 13:30:43,875 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-19 13:30:43,877 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-19 13:30:44,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:30:44,044 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 13:30:44,050 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 13:30:44,095 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-19 13:30:44,128 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-19 13:30:44,128 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 13:30:44,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:30:44,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866209384] [2024-11-19 13:30:44,132 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 13:30:44,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287725943] [2024-11-19 13:30:44,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287725943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:30:44,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 13:30:44,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 13:30:44,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565101625] [2024-11-19 13:30:44,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:30:44,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 13:30:44,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:30:44,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 13:30:44,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 13:30:44,137 INFO L87 Difference]: Start difference. First operand 1379 states and 2541 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 13:30:45,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:30:45,078 INFO L93 Difference]: Finished difference Result 2748 states and 5073 transitions. [2024-11-19 13:30:45,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 13:30:45,079 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-19 13:30:45,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:30:45,097 INFO L225 Difference]: With dead ends: 2748 [2024-11-19 13:30:45,097 INFO L226 Difference]: Without dead ends: 2746 [2024-11-19 13:30:45,098 INFO L431 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-19 13:30:45,099 INFO L432 NwaCegarLoop]: 2805 mSDtfsCounter, 1519 mSDsluCounter, 4818 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2022 SdHoareTripleChecker+Valid, 7623 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 13:30:45,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2022 Valid, 7623 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 13:30:45,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2746 states. [2024-11-19 13:30:45,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2746 to 1385. [2024-11-19 13:30:45,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1385 states, 872 states have (on average 1.768348623853211) internal successors, (1542), 1379 states have internal predecessors, (1542), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-19 13:30:45,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 2548 transitions. [2024-11-19 13:30:45,392 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 2548 transitions. Word has length 7 [2024-11-19 13:30:45,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:30:45,393 INFO L471 AbstractCegarLoop]: Abstraction has 1385 states and 2548 transitions. [2024-11-19 13:30:45,393 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-19 13:30:45,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 2548 transitions. [2024-11-19 13:30:45,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-19 13:30:45,396 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:30:45,396 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 13:30:45,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-19 13:30:45,597 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-19 13:30:45,598 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-19 13:30:45,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:30:45,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1584338109, now seen corresponding path program 1 times [2024-11-19 13:30:45,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:30:45,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807334797] [2024-11-19 13:30:45,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:30:45,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:30:45,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:30:45,971 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-19 13:30:45,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:30:45,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807334797] [2024-11-19 13:30:45,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807334797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:30:45,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 13:30:45,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 13:30:45,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286991844] [2024-11-19 13:30:45,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:30:45,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 13:30:45,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:30:45,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 13:30:45,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 13:30:45,974 INFO L87 Difference]: Start difference. First operand 1385 states and 2548 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 13:30:46,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:30:46,741 INFO L93 Difference]: Finished difference Result 3915 states and 7314 transitions. [2024-11-19 13:30:46,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 13:30:46,742 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-19 13:30:46,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:30:46,761 INFO L225 Difference]: With dead ends: 3915 [2024-11-19 13:30:46,761 INFO L226 Difference]: Without dead ends: 2745 [2024-11-19 13:30:46,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 13:30:46,767 INFO L432 NwaCegarLoop]: 2826 mSDtfsCounter, 1520 mSDsluCounter, 4840 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2023 SdHoareTripleChecker+Valid, 7666 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 13:30:46,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2023 Valid, 7666 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 13:30:46,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2745 states. [2024-11-19 13:30:47,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2745 to 1385. [2024-11-19 13:30:47,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1385 states, 872 states have (on average 1.7672018348623852) internal successors, (1541), 1379 states have internal predecessors, (1541), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-19 13:30:47,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 2547 transitions. [2024-11-19 13:30:47,065 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 2547 transitions. Word has length 64 [2024-11-19 13:30:47,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:30:47,065 INFO L471 AbstractCegarLoop]: Abstraction has 1385 states and 2547 transitions. [2024-11-19 13:30:47,065 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-19 13:30:47,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 2547 transitions. [2024-11-19 13:30:47,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-19 13:30:47,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:30:47,072 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 13:30:47,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 13:30:47,072 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-19 13:30:47,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:30:47,073 INFO L85 PathProgramCache]: Analyzing trace with hash 205854116, now seen corresponding path program 1 times [2024-11-19 13:30:47,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:30:47,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647404032] [2024-11-19 13:30:47,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:30:47,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:30:47,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:30:47,306 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-19 13:30:47,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:30:47,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647404032] [2024-11-19 13:30:47,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647404032] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:30:47,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 13:30:47,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 13:30:47,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769094158] [2024-11-19 13:30:47,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:30:47,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 13:30:47,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:30:47,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 13:30:47,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 13:30:47,309 INFO L87 Difference]: Start difference. First operand 1385 states and 2547 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 13:30:47,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:30:47,466 INFO L93 Difference]: Finished difference Result 2765 states and 5089 transitions. [2024-11-19 13:30:47,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 13:30:47,467 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-19 13:30:47,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:30:47,481 INFO L225 Difference]: With dead ends: 2765 [2024-11-19 13:30:47,481 INFO L226 Difference]: Without dead ends: 1388 [2024-11-19 13:30:47,486 INFO L431 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-19 13:30:47,487 INFO L432 NwaCegarLoop]: 2513 mSDtfsCounter, 87 mSDsluCounter, 7434 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 9947 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 13:30:47,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 9947 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 13:30:47,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2024-11-19 13:30:47,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 1385. [2024-11-19 13:30:47,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1385 states, 872 states have (on average 1.7591743119266054) internal successors, (1534), 1379 states have internal predecessors, (1534), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-19 13:30:47,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 2540 transitions. [2024-11-19 13:30:47,643 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 2540 transitions. Word has length 81 [2024-11-19 13:30:47,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:30:47,643 INFO L471 AbstractCegarLoop]: Abstraction has 1385 states and 2540 transitions. [2024-11-19 13:30:47,644 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-19 13:30:47,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 2540 transitions. [2024-11-19 13:30:47,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-19 13:30:47,646 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:30:47,646 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 13:30:47,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 13:30:47,646 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-19 13:30:47,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:30:47,647 INFO L85 PathProgramCache]: Analyzing trace with hash 774993816, now seen corresponding path program 1 times [2024-11-19 13:30:47,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:30:47,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339129656] [2024-11-19 13:30:47,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:30:47,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:30:47,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:30:47,809 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-19 13:30:47,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:30:47,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339129656] [2024-11-19 13:30:47,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339129656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:30:47,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 13:30:47,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 13:30:47,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961945051] [2024-11-19 13:30:47,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:30:47,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 13:30:47,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:30:47,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 13:30:47,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 13:30:47,812 INFO L87 Difference]: Start difference. First operand 1385 states and 2540 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-19 13:30:47,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:30:47,932 INFO L93 Difference]: Finished difference Result 4033 states and 7470 transitions. [2024-11-19 13:30:47,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 13:30:47,933 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-19 13:30:47,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:30:47,950 INFO L225 Difference]: With dead ends: 4033 [2024-11-19 13:30:47,951 INFO L226 Difference]: Without dead ends: 2656 [2024-11-19 13:30:47,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 13:30:47,960 INFO L432 NwaCegarLoop]: 2980 mSDtfsCounter, 1343 mSDsluCounter, 2520 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1843 SdHoareTripleChecker+Valid, 5500 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 13:30:47,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1843 Valid, 5500 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 13:30:47,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2656 states. [2024-11-19 13:30:48,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2656 to 2652. [2024-11-19 13:30:48,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2652 states, 1639 states have (on average 1.7876754118364857) internal successors, (2930), 2646 states have internal predecessors, (2930), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-19 13:30:48,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2652 states to 2652 states and 4936 transitions. [2024-11-19 13:30:48,253 INFO L78 Accepts]: Start accepts. Automaton has 2652 states and 4936 transitions. Word has length 81 [2024-11-19 13:30:48,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:30:48,255 INFO L471 AbstractCegarLoop]: Abstraction has 2652 states and 4936 transitions. [2024-11-19 13:30:48,257 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-19 13:30:48,257 INFO L276 IsEmpty]: Start isEmpty. Operand 2652 states and 4936 transitions. [2024-11-19 13:30:48,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-19 13:30:48,258 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:30:48,258 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 13:30:48,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 13:30:48,259 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-19 13:30:48,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:30:48,259 INFO L85 PathProgramCache]: Analyzing trace with hash -601606019, now seen corresponding path program 1 times [2024-11-19 13:30:48,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:30:48,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869135975] [2024-11-19 13:30:48,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:30:48,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:30:48,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:30:48,435 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-19 13:30:48,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:30:48,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869135975] [2024-11-19 13:30:48,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869135975] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:30:48,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 13:30:48,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 13:30:48,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148057031] [2024-11-19 13:30:48,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:30:48,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 13:30:48,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:30:48,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 13:30:48,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 13:30:48,439 INFO L87 Difference]: Start difference. First operand 2652 states and 4936 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) 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-19 13:30:48,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:30:48,584 INFO L93 Difference]: Finished difference Result 5238 states and 9782 transitions. [2024-11-19 13:30:48,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 13:30:48,584 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) 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-19 13:30:48,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:30:48,606 INFO L225 Difference]: With dead ends: 5238 [2024-11-19 13:30:48,606 INFO L226 Difference]: Without dead ends: 2664 [2024-11-19 13:30:48,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 13:30:48,615 INFO L432 NwaCegarLoop]: 2528 mSDtfsCounter, 1 mSDsluCounter, 2506 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 5034 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 13:30:48,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 5034 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 13:30:48,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2664 states. [2024-11-19 13:30:48,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2664 to 2664. [2024-11-19 13:30:48,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2664 states, 1651 states have (on average 1.7819503331314355) internal successors, (2942), 2658 states have internal predecessors, (2942), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-19 13:30:48,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2664 states to 2664 states and 4948 transitions. [2024-11-19 13:30:48,895 INFO L78 Accepts]: Start accepts. Automaton has 2664 states and 4948 transitions. Word has length 96 [2024-11-19 13:30:48,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:30:48,895 INFO L471 AbstractCegarLoop]: Abstraction has 2664 states and 4948 transitions. [2024-11-19 13:30:48,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) 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-19 13:30:48,896 INFO L276 IsEmpty]: Start isEmpty. Operand 2664 states and 4948 transitions. [2024-11-19 13:30:48,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-19 13:30:48,898 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:30:48,898 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 13:30:48,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 13:30:48,899 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-19 13:30:48,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:30:48,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1084573819, now seen corresponding path program 1 times [2024-11-19 13:30:48,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:30:48,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531408923] [2024-11-19 13:30:48,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:30:48,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:30:48,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:30:49,249 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-19 13:30:49,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:30:49,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531408923] [2024-11-19 13:30:49,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531408923] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:30:49,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 13:30:49,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 13:30:49,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198671657] [2024-11-19 13:30:49,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:30:49,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 13:30:49,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:30:49,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 13:30:49,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 13:30:49,252 INFO L87 Difference]: Start difference. First operand 2664 states and 4948 transitions. Second operand has 4 states, 3 states have (on average 29.666666666666668) 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-19 13:30:50,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:30:50,053 INFO L93 Difference]: Finished difference Result 4906 states and 9289 transitions. [2024-11-19 13:30:50,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 13:30:50,054 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 29.666666666666668) 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-19 13:30:50,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:30:50,087 INFO L225 Difference]: With dead ends: 4906 [2024-11-19 13:30:50,087 INFO L226 Difference]: Without dead ends: 4904 [2024-11-19 13:30:50,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-19 13:30:50,090 INFO L432 NwaCegarLoop]: 2762 mSDtfsCounter, 1427 mSDsluCounter, 4768 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1928 SdHoareTripleChecker+Valid, 7530 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 13:30:50,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1928 Valid, 7530 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 13:30:50,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4904 states. [2024-11-19 13:30:50,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4904 to 2728. [2024-11-19 13:30:50,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2728 states, 1712 states have (on average 1.764018691588785) internal successors, (3020), 2719 states have internal predecessors, (3020), 1006 states have call successors, (1006), 2 states have call predecessors, (1006), 2 states have return successors, (1006), 8 states have call predecessors, (1006), 1006 states have call successors, (1006) [2024-11-19 13:30:50,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2728 states to 2728 states and 5032 transitions. [2024-11-19 13:30:50,696 INFO L78 Accepts]: Start accepts. Automaton has 2728 states and 5032 transitions. Word has length 96 [2024-11-19 13:30:50,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:30:50,697 INFO L471 AbstractCegarLoop]: Abstraction has 2728 states and 5032 transitions. [2024-11-19 13:30:50,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 29.666666666666668) 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-19 13:30:50,697 INFO L276 IsEmpty]: Start isEmpty. Operand 2728 states and 5032 transitions. [2024-11-19 13:30:50,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-19 13:30:50,700 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:30:50,700 INFO L215 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-19 13:30:50,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 13:30:50,700 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-19 13:30:50,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:30:50,701 INFO L85 PathProgramCache]: Analyzing trace with hash 132779098, now seen corresponding path program 1 times [2024-11-19 13:30:50,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:30:50,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845672247] [2024-11-19 13:30:50,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:30:50,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:30:51,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:30:51,210 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-19 13:30:51,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:30:51,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845672247] [2024-11-19 13:30:51,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845672247] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 13:30:51,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525788517] [2024-11-19 13:30:51,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:30:51,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 13:30:51,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 13:30:51,213 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-19 13:30:51,215 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-19 13:30:51,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:30:51,509 INFO L255 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-19 13:30:51,515 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 13:30:51,519 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-19 13:30:51,536 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-19 13:30:51,552 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-19 13:30:52,255 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-19 13:30:52,255 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 13:30:52,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525788517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:30:52,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 13:30:52,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2024-11-19 13:30:52,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980121481] [2024-11-19 13:30:52,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:30:52,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 13:30:52,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:30:52,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 13:30:52,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-19 13:30:52,257 INFO L87 Difference]: Start difference. First operand 2728 states and 5032 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-19 13:30:55,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:30:55,289 INFO L93 Difference]: Finished difference Result 7575 states and 14235 transitions. [2024-11-19 13:30:55,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 13:30:55,290 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-19 13:30:55,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:30:55,377 INFO L225 Difference]: With dead ends: 7575 [2024-11-19 13:30:55,377 INFO L226 Difference]: Without dead ends: 4941 [2024-11-19 13:30:55,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2024-11-19 13:30:55,394 INFO L432 NwaCegarLoop]: 2738 mSDtfsCounter, 1777 mSDsluCounter, 17603 mSDsCounter, 0 mSdLazyCounter, 1632 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2279 SdHoareTripleChecker+Valid, 20341 SdHoareTripleChecker+Invalid, 1637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-19 13:30:55,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2279 Valid, 20341 Invalid, 1637 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [5 Valid, 1632 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-19 13:30:55,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4941 states. [2024-11-19 13:30:55,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4941 to 2760. [2024-11-19 13:30:55,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2760 states, 1744 states have (on average 1.7528669724770642) internal successors, (3057), 2751 states have internal predecessors, (3057), 1006 states have call successors, (1006), 2 states have call predecessors, (1006), 2 states have return successors, (1006), 8 states have call predecessors, (1006), 1006 states have call successors, (1006) [2024-11-19 13:30:55,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2760 states to 2760 states and 5069 transitions. [2024-11-19 13:30:55,994 INFO L78 Accepts]: Start accepts. Automaton has 2760 states and 5069 transitions. Word has length 102 [2024-11-19 13:30:55,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:30:55,994 INFO L471 AbstractCegarLoop]: Abstraction has 2760 states and 5069 transitions. [2024-11-19 13:30:55,995 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-19 13:30:55,995 INFO L276 IsEmpty]: Start isEmpty. Operand 2760 states and 5069 transitions. [2024-11-19 13:30:55,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-19 13:30:55,997 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:30:55,997 INFO L215 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-19 13:30:56,016 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-19 13:30:56,201 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-19 13:30:56,202 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-19 13:30:56,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:30:56,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1396889037, now seen corresponding path program 1 times [2024-11-19 13:30:56,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:30:56,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552516329] [2024-11-19 13:30:56,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:30:56,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:30:56,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:30:56,661 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-19 13:30:56,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:30:56,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552516329] [2024-11-19 13:30:56,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552516329] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 13:30:56,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737211890] [2024-11-19 13:30:56,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:30:56,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 13:30:56,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 13:30:56,664 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-19 13:30:56,665 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-19 13:30:56,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:30:56,996 INFO L255 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-19 13:30:57,002 INFO L278 TraceCheckSpWp]: Computing forward predicates...